0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_int
0.00/0.00	% Ordering    : kbo
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 int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
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   : n050.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 07:00:54 CST 2018
2.45/2.66	% done 706 iterations in 2.470s
2.45/2.66	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
2.45/2.66	% SZS output start Refutation
2.45/2.67	tff(fact_21_insert__Nil, axiom,
2.45/2.67	  (![A:$tType,X:A]:
2.45/2.67	     (insert(A,X,nil(A)) =
2.45/2.67	      aa(list(A),list(A),aa(A,fun(list(A),list(A)),cons(A),X),nil(A))))).
2.45/2.67	tff('0', plain,
2.45/2.67	    ![X78 : $tType, X79 : X78]:
2.45/2.67	      insert(X78, X79, nil(X78))
2.45/2.67	       = aa(list(X78), list(X78), 
2.45/2.67	           aa(X78, fun(list(X78), list(X78)), cons(X78), X79), nil(X78)),
2.45/2.67	    inference('cnf', [status(esa)], [fact_21_insert__Nil])).
2.45/2.67	tff(fact_10_listsp_Osimps, axiom,
2.45/2.67	  (![A:$tType,A2:list(A),A1:fun(A,bool)]:
2.45/2.67	     (listsp(A,A1,A2) <=>
2.45/2.67	      ((?[A4:A,L:list(A)]:
2.45/2.67	          (listsp(A,A1,L) & pp(aa(A,bool,A1,A4)) & 
2.45/2.67	           (A2 = aa(list(A),list(A),aa(A,fun(list(A),list(A)),cons(A),A4),L)))) | 
2.45/2.67	       (A2 = nil(A)))))).
2.45/2.67	tff('1', plain,
2.45/2.67	    ![X34 : $tType, X35 : list(X34), X37 : fun(X34, bool), X38 : X34, 
2.45/2.67	      X39 : list(X34)]:
2.45/2.67	      (listsp(X34, X37, X35)
2.45/2.67	       | ~ pp(aa(X34, bool, X37, X38))
2.45/2.67	       | X35
2.45/2.67	          != aa(list(X34), list(X34), 
2.45/2.67	               aa(X34, fun(list(X34), list(X34)), cons(X34), X38), X39)
2.45/2.67	       | ~ listsp(X34, X37, X39)),
2.45/2.67	    inference('cnf', [status(esa)], [fact_10_listsp_Osimps])).
2.45/2.67	tff('2', plain,
2.45/2.67	    ![X34 : $tType, X37 : fun(X34, bool), X38 : X34, X39 : list(X34)]:
2.45/2.67	      (~ listsp(X34, X37, X39)
2.45/2.67	       | ~ pp(aa(X34, bool, X37, X38))
2.45/2.67	       | listsp(X34, X37, 
2.45/2.67	           aa(list(X34), list(X34), 
2.45/2.67	             aa(X34, fun(list(X34), list(X34)), cons(X34), X38), X39))),
2.45/2.67	    inference('simplify', [status(thm)], ['1'])).
2.45/2.67	tff('3', plain,
2.45/2.67	    ![X0 : $tType, X1 : X0, X2 : fun(X0, bool)]:
2.45/2.67	      (listsp(X0, X2, insert(X0, X1, nil(X0)))
2.45/2.67	       | ~ pp(aa(X0, bool, X2, X1))
2.45/2.67	       | ~ listsp(X0, X2, nil(X0))),
2.45/2.67	    inference('sup+', [status(thm)], ['0', '2'])).
2.45/2.67	tff(fact_1_listsp_ONil, axiom,
2.45/2.67	  (![A:$tType,A1:fun(A,bool)]: listsp(A,A1,nil(A)))).
2.45/2.67	tff('4', plain, ![X1 : $tType, X2 : fun(X1, bool)]: listsp(X1, X2, nil(X1)),
2.45/2.67	    inference('cnf', [status(esa)], [fact_1_listsp_ONil])).
2.45/2.67	tff('5', plain,
2.45/2.67	    ![X0 : $tType, X1 : X0, X2 : fun(X0, bool)]:
2.45/2.67	      (listsp(X0, X2, insert(X0, X1, nil(X0)))
2.45/2.67	       | ~ pp(aa(X0, bool, X2, X1))
2.45/2.67	       | ~ $true),
2.45/2.67	    inference('demod', [status(thm)], ['3', '4'])).
2.45/2.67	tff('6', plain,
2.45/2.67	    ![X0 : $tType, X1 : X0, X2 : fun(X0, bool)]:
2.45/2.67	      (~ pp(aa(X0, bool, X2, X1)) | listsp(X0, X2, insert(X0, X1, nil(X0)))),
2.45/2.67	    inference('simplify', [status(thm)], ['5'])).
2.45/2.67	tff(conj_1, conjecture,
2.45/2.67	  (listsp(dB,it,
2.45/2.67	          aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),
2.45/2.67	             nil(dB))))).
2.45/2.67	tff(zf_stmt_0, negated_conjecture,
2.45/2.67	  (~
2.45/2.67	    listsp(dB,it,
2.45/2.67	           aa(list(dB),list(dB),
2.45/2.67	              aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))))).
2.45/2.67	tff('7', plain,
2.45/2.67	    ~ listsp(dB, it, 
2.45/2.67	        aa(list(dB), list(dB), 
2.45/2.67	          aa(dB, fun(list(dB), list(dB)), cons(dB), var(i)), nil(dB))),
2.45/2.67	    inference('cnf', [status(esa)], [zf_stmt_0])).
2.45/2.67	tff('8', plain, ~ listsp(dB, it, insert(dB, var(i), nil(dB))),
2.45/2.67	    inference('demod', [status(thm)], ['7', '0'])).
2.45/2.67	tff('9', plain, (~ $true | ~ pp(aa(dB, bool, it, var(i)))),
2.45/2.67	    inference('sup-', [status(thm)], ['6', '8'])).
2.45/2.67	tff(fact_0_Var__IT, axiom, (![N2:nat]: pp(aa(dB,bool,it,var(N2))))).
2.45/2.67	tff('10', plain, ![X0 : nat]: pp(aa(dB, bool, it, var(X0))),
2.45/2.67	    inference('cnf', [status(esa)], [fact_0_Var__IT])).
2.45/2.67	tff('11', plain, (~ $true | ~ $true),
2.45/2.67	    inference('demod', [status(thm)], ['9', '10'])).
2.45/2.67	tff('12', plain, $false, inference('simplify', [status(thm)], ['11'])).
2.45/2.67	
2.45/2.67	% SZS output end Refutation
2.45/2.67	EOF
