0.00/0.01	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : purification_int
0.00/0.01	% Ordering    : rpo6
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --ho-purify int \
0.00/0.01	  --ho-no-ext-pos \
0.00/0.01	  --ho-no-ext-neg \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n145.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 07:04:08 CST 2018
151.07/151.29	% done 3162 iterations in 151.078s
151.07/151.29	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
151.07/151.29	% SZS output start Refutation
151.07/151.29	tff(help_COMBC_1_1_U, axiom,
151.07/151.29	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun(A,fun(B,C))]:
151.07/151.29	     (aa(A,C,aa(B,fun(A,C),combc(A,B,C,P),Q),R) =
151.07/151.29	      aa(B,C,aa(A,fun(B,C),P,R),Q)))).
151.07/151.29	tff('0', plain,
151.07/151.29	    ![X385 : $tType, X386 : $tType, X387 : $tType, 
151.07/151.29	      X388 : fun(X387, fun(X385, X386)), X389 : X387, X390 : X385]:
151.07/151.29	      aa(X387, X386, 
151.07/151.29	        aa(X385, fun(X387, X386), combc(X387, X385, X386, X388), X390), X389)
151.07/151.29	       = aa(X385, X386, aa(X387, fun(X385, X386), X388, X389), X390),
151.07/151.29	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
151.07/151.29	tff(fact_10_listsp_Osimps, axiom,
151.07/151.29	  (![A:$tType,A2:list(A),A1:fun(A,bool)]:
151.07/151.29	     (listsp(A,A1,A2) <=>
151.07/151.29	      ((?[A4:A,L:list(A)]:
151.07/151.29	          (listsp(A,A1,L) & pp(aa(A,bool,A1,A4)) & 
151.07/151.29	           (A2 = aa(list(A),list(A),aa(A,fun(list(A),list(A)),cons(A),A4),L)))) | 
151.07/151.29	       (A2 = nil(A)))))).
151.07/151.29	tff('1', plain,
151.07/151.29	    ![X34 : $tType, X35 : list(X34), X37 : fun(X34, bool), X38 : X34, 
151.07/151.29	      X39 : list(X34)]:
151.07/151.29	      (listsp(X34, X37, X35)
151.07/151.29	       | ~ pp(aa(X34, bool, X37, X38))
151.07/151.29	       | X35
151.07/151.29	          != aa(list(X34), list(X34), 
151.07/151.29	               aa(X34, fun(list(X34), list(X34)), cons(X34), X38), X39)
151.07/151.29	       | ~ listsp(X34, X37, X39)),
151.07/151.29	    inference('cnf', [status(esa)], [fact_10_listsp_Osimps])).
151.07/151.29	tff('2', plain,
151.07/151.29	    ![X34 : $tType, X37 : fun(X34, bool), X38 : X34, X39 : list(X34)]:
151.07/151.29	      (~ listsp(X34, X37, X39)
151.07/151.29	       | ~ pp(aa(X34, bool, X37, X38))
151.07/151.29	       | listsp(X34, X37, 
151.07/151.29	           aa(list(X34), list(X34), 
151.07/151.29	             aa(X34, fun(list(X34), list(X34)), cons(X34), X38), X39))),
151.07/151.29	    inference('simplify', [status(thm)], ['1'])).
151.07/151.29	tff('3', plain,
151.07/151.29	    ![X0 : $tType, X1 : X0, X2 : list(X0), X3 : fun(X0, bool)]:
151.07/151.29	      (listsp(X0, X3, 
151.07/151.29	         aa(X0, list(X0), 
151.07/151.29	           aa(list(X0), fun(X0, list(X0)), 
151.07/151.29	             combc(X0, list(X0), list(X0), cons(X0)), X2), X1))
151.07/151.29	       | ~ pp(aa(X0, bool, X3, X1))
151.07/151.29	       | ~ listsp(X0, X3, X2)),
151.07/151.29	    inference('sup+', [status(thm)], ['0', '2'])).
151.07/151.29	tff(conj_1, conjecture,
151.07/151.29	  (listsp(dB,it,
151.07/151.29	          aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),
151.07/151.29	             nil(dB))))).
151.07/151.29	tff(zf_stmt_0, negated_conjecture,
151.07/151.29	  (~
151.07/151.29	    listsp(dB,it,
151.07/151.29	           aa(list(dB),list(dB),
151.07/151.29	              aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))))).
151.07/151.29	tff('4', plain,
151.07/151.29	    ~ listsp(dB, it, 
151.07/151.29	        aa(list(dB), list(dB), 
151.07/151.29	          aa(dB, fun(list(dB), list(dB)), cons(dB), var(i)), nil(dB))),
151.07/151.29	    inference('cnf', [status(esa)], [zf_stmt_0])).
151.07/151.29	tff('5', plain,
151.07/151.29	    ~ listsp(dB, it, 
151.07/151.29	        aa(dB, list(dB), 
151.07/151.29	          aa(list(dB), fun(dB, list(dB)), 
151.07/151.29	            combc(dB, list(dB), list(dB), cons(dB)), nil(dB)), var(i))),
151.07/151.29	    inference('demod', [status(thm)], ['4', '0'])).
151.07/151.29	tff('6', plain,
151.07/151.29	    (~ $true | ~ listsp(dB, it, nil(dB)) | ~ pp(aa(dB, bool, it, var(i)))),
151.07/151.29	    inference('sup-', [status(thm)], ['3', '5'])).
151.07/151.29	tff(fact_1_listsp_ONil, axiom,
151.07/151.29	  (![A:$tType,A1:fun(A,bool)]: listsp(A,A1,nil(A)))).
151.07/151.29	tff('7', plain, ![X1 : $tType, X2 : fun(X1, bool)]: listsp(X1, X2, nil(X1)),
151.07/151.29	    inference('cnf', [status(esa)], [fact_1_listsp_ONil])).
151.07/151.29	tff(fact_0_Var__IT, axiom, (![N2:nat]: pp(aa(dB,bool,it,var(N2))))).
151.07/151.29	tff('8', plain, ![X0 : nat]: pp(aa(dB, bool, it, var(X0))),
151.07/151.29	    inference('cnf', [status(esa)], [fact_0_Var__IT])).
151.07/151.29	tff('9', plain, (~ $true | ~ $true | ~ $true),
151.07/151.29	    inference('demod', [status(thm)], ['6', '7', '8'])).
151.07/151.29	tff('10', plain, $false, inference('simplify', [status(thm)], ['9'])).
151.07/151.29	
151.07/151.29	% SZS output end Refutation
151.07/151.30	EOF
