0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n163.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 06:41:38 CST 2018
0.00/0.26	% done 120 iterations in 0.066s
0.00/0.26	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.26	% SZS output start Refutation
0.00/0.26	tff(fact_13_listsp_ONil, axiom,
0.00/0.26	  (![A:$tType,A1:fun(A,bool)]: listsp(A,A1,nil(A)))).
0.00/0.26	tff('0', plain,
0.00/0.26	    ![X47 : $tType, X48 : fun(X47, bool)]: listsp(X47, X48, nil(X47)),
0.00/0.26	    inference('cnf', [status(esa)], [fact_13_listsp_ONil])).
0.00/0.26	tff(fact_8_IT_OVar, axiom,
0.00/0.26	  (![Na:nat,Rs:list(dB)]:
0.00/0.26	     (listsp(dB,it,Rs) => pp(aa(dB,bool,it,foldl(dB,dB,app,var(Na),Rs)))))).
0.00/0.26	tff('1', plain,
0.00/0.26	    ![X31 : nat, X32 : list(dB)]:
0.00/0.26	      (pp(aa(dB, bool, it, foldl(dB, dB, app, var(X31), X32)))
0.00/0.26	       | ~ listsp(dB, it, X32)),
0.00/0.26	    inference('cnf', [status(esa)], [fact_8_IT_OVar])).
0.00/0.26	tff('2', plain,
0.00/0.26	    ![X0 : nat]:
0.00/0.26	      (~ $true | pp(aa(dB, bool, it, foldl(dB, dB, app, var(X0), nil(dB))))),
0.00/0.26	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.26	tff(fact_7_foldl__Nil, axiom,
0.00/0.26	  (![B:$tType,A:$tType,A5:A,F:fun(A,fun(B,A))]: (foldl(A,B,F,A5,nil(B)) = A5))).
0.00/0.26	tff('3', plain,
0.00/0.26	    ![X27 : $tType, X28 : X27, X29 : $tType, X30 : fun(X27, fun(X29, X27))]:
0.00/0.26	      foldl(X27, X29, X30, X28, nil(X29)) = X28,
0.00/0.26	    inference('cnf', [status(esa)], [fact_7_foldl__Nil])).
0.00/0.26	tff('4', plain, ![X0 : nat]: (~ $true | pp(aa(dB, bool, it, var(X0)))),
0.00/0.26	    inference('demod', [status(thm)], ['2', '3'])).
0.00/0.26	tff('5', plain, ![X0 : nat]: pp(aa(dB, bool, it, var(X0))),
0.00/0.26	    inference('simplify', [status(thm)], ['4'])).
0.00/0.26	tff(conj_0, conjecture, (pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))))).
0.00/0.26	tff(zf_stmt_0, negated_conjecture,
0.00/0.26	  (~pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))))).
0.00/0.26	tff('6', plain, ~ pp(aa(dB, bool, it, foldl(dB, dB, app, var(n), nil(dB)))),
0.00/0.26	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.26	tff('7', plain, ~ pp(aa(dB, bool, it, var(n))),
0.00/0.26	    inference('demod', [status(thm)], ['6', '3'])).
0.00/0.26	tff('8', plain, ~ $true, inference('sup-', [status(thm)], ['5', '7'])).
0.00/0.26	tff('9', plain, $false, inference('simplify', [status(thm)], ['8'])).
0.00/0.26	
0.00/0.26	% SZS output end Refutation
0.00/0.26	EOF
