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    : supatvars_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	  --sup-at-vars \
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   : n184.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:44:23 CST 2018
1.93/2.14	% done 451 iterations in 1.940s
1.93/2.14	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
1.93/2.14	% SZS output start Refutation
1.93/2.14	tff(fact_37_insert__Nil, axiom,
1.93/2.14	  (![A:$tType,X:A]:
1.93/2.14	     (insert(A,X,nil(A)) =
1.93/2.14	      aa(list(A),list(A),aa(A,fun(list(A),list(A)),cons(A),X),nil(A))))).
1.93/2.14	tff('0', plain,
1.93/2.14	    ![X152 : $tType, X153 : X152]:
1.93/2.14	      insert(X152, X153, nil(X152))
1.93/2.14	       = aa(list(X152), list(X152), 
1.93/2.14	           aa(X152, fun(list(X152), list(X152)), cons(X152), X153), 
1.93/2.14	           nil(X152)),
1.93/2.14	    inference('cnf', [status(esa)], [fact_37_insert__Nil])).
1.93/2.14	tff(fact_28_listsp_Osimps, axiom,
1.93/2.14	  (![A:$tType,A1:list(A),A3:fun(A,bool)]:
1.93/2.14	     (listsp(A,A3,A1) <=>
1.93/2.14	      ((?[A4:A,L:list(A)]:
1.93/2.14	          (listsp(A,A3,L) & pp(aa(A,bool,A3,A4)) & 
1.93/2.14	           (A1 = aa(list(A),list(A),aa(A,fun(list(A),list(A)),cons(A),A4),L)))) | 
1.93/2.14	       (A1 = nil(A)))))).
1.93/2.14	tff('1', plain,
1.93/2.14	    ![X120 : $tType, X121 : list(X120), X123 : fun(X120, bool), X124 : X120, 
1.93/2.14	      X125 : list(X120)]:
1.93/2.14	      (listsp(X120, X123, X121)
1.93/2.14	       | ~ pp(aa(X120, bool, X123, X124))
1.93/2.14	       | X121
1.93/2.14	          != aa(list(X120), list(X120), 
1.93/2.14	               aa(X120, fun(list(X120), list(X120)), cons(X120), X124), X125)
1.93/2.14	       | ~ listsp(X120, X123, X125)),
1.93/2.14	    inference('cnf', [status(esa)], [fact_28_listsp_Osimps])).
1.93/2.14	tff('2', plain,
1.93/2.14	    ![X120 : $tType, X123 : fun(X120, bool), X124 : X120, X125 : list(X120)]:
1.93/2.14	      (~ listsp(X120, X123, X125)
1.93/2.14	       | ~ pp(aa(X120, bool, X123, X124))
1.93/2.14	       | listsp(X120, X123, 
1.93/2.14	           aa(list(X120), list(X120), 
1.93/2.14	             aa(X120, fun(list(X120), list(X120)), cons(X120), X124), X125))),
1.93/2.14	    inference('simplify', [status(thm)], ['1'])).
1.93/2.14	tff('3', plain,
1.93/2.14	    ![X0 : $tType, X1 : X0, X2 : fun(X0, bool)]:
1.93/2.14	      (listsp(X0, X2, insert(X0, X1, nil(X0)))
1.93/2.14	       | ~ pp(aa(X0, bool, X2, X1))
1.93/2.14	       | ~ listsp(X0, X2, nil(X0))),
1.93/2.14	    inference('sup+', [status(thm)], ['0', '2'])).
1.93/2.14	tff(fact_3_listsp_ONil, axiom,
1.93/2.14	  (![A:$tType,A3:fun(A,bool)]: listsp(A,A3,nil(A)))).
1.93/2.14	tff('4', plain,
1.93/2.14	    ![X12 : $tType, X13 : fun(X12, bool)]: listsp(X12, X13, nil(X12)),
1.93/2.14	    inference('cnf', [status(esa)], [fact_3_listsp_ONil])).
1.93/2.14	tff('5', plain,
1.93/2.14	    ![X0 : $tType, X1 : X0, X2 : fun(X0, bool)]:
1.93/2.14	      (listsp(X0, X2, insert(X0, X1, nil(X0)))
1.93/2.14	       | ~ pp(aa(X0, bool, X2, X1))
1.93/2.14	       | ~ $true),
1.93/2.14	    inference('demod', [status(thm)], ['3', '4'])).
1.93/2.14	tff('6', plain,
1.93/2.14	    ![X0 : $tType, X1 : X0, X2 : fun(X0, bool)]:
1.93/2.14	      (~ pp(aa(X0, bool, X2, X1)) | listsp(X0, X2, insert(X0, X1, nil(X0)))),
1.93/2.14	    inference('simplify', [status(thm)], ['5'])).
1.93/2.14	tff(fact_2_append__in__listsp__conv, axiom,
1.93/2.14	  (![A:$tType,Ys:list(A),Xs:list(A),A3:fun(A,bool)]:
1.93/2.14	     (listsp(A,A3,
1.93/2.14	             aa(list(A),list(A),
1.93/2.14	                aa(list(A),fun(list(A),list(A)),append(A),Xs),Ys)) <=>
1.93/2.14	      (listsp(A,A3,Ys) & listsp(A,A3,Xs))))).
1.93/2.14	tff('7', plain,
1.93/2.14	    ![X7 : $tType, X9 : list(X7), X10 : list(X7), X11 : fun(X7, bool)]:
1.93/2.14	      (listsp(X7, X11, 
1.93/2.14	         aa(list(X7), list(X7), 
1.93/2.14	           aa(list(X7), fun(list(X7), list(X7)), append(X7), X10), X9))
1.93/2.14	       | ~ listsp(X7, X11, X10)
1.93/2.14	       | ~ listsp(X7, X11, X9)),
1.93/2.14	    inference('cnf', [status(esa)], [fact_2_append__in__listsp__conv])).
1.93/2.14	tff(conj_1, conjecture,
1.93/2.14	  (listsp(dB,it,
1.93/2.14	          aa(list(dB),list(dB),
1.93/2.14	             aa(list(dB),fun(list(dB),list(dB)),append(dB),rs),
1.93/2.14	             aa(list(dB),list(dB),
1.93/2.14	                aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB)))))).
1.93/2.14	tff(zf_stmt_0, negated_conjecture,
1.93/2.14	  (~
1.93/2.14	    listsp(dB,it,
1.93/2.14	           aa(list(dB),list(dB),
1.93/2.14	              aa(list(dB),fun(list(dB),list(dB)),append(dB),rs),
1.93/2.14	              aa(list(dB),list(dB),
1.93/2.14	                 aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB)))))).
1.93/2.14	tff('8', plain,
1.93/2.14	    ~ listsp(dB, it, 
1.93/2.14	        aa(list(dB), list(dB), 
1.93/2.14	          aa(list(dB), fun(list(dB), list(dB)), append(dB), rs), 
1.93/2.14	          aa(list(dB), list(dB), 
1.93/2.14	            aa(dB, fun(list(dB), list(dB)), cons(dB), var(i)), nil(dB)))),
1.93/2.14	    inference('cnf', [status(esa)], [zf_stmt_0])).
1.93/2.14	tff('9', plain,
1.93/2.14	    ~ listsp(dB, it, 
1.93/2.14	        aa(list(dB), list(dB), 
1.93/2.14	          aa(list(dB), fun(list(dB), list(dB)), append(dB), rs), 
1.93/2.14	          insert(dB, var(i), nil(dB)))),
1.93/2.14	    inference('demod', [status(thm)], ['8', '0'])).
1.93/2.14	tff('10', plain,
1.93/2.14	    (~ $true
1.93/2.14	     | ~ listsp(dB, it, insert(dB, var(i), nil(dB)))
1.93/2.14	     | ~ listsp(dB, it, rs)),
1.93/2.14	    inference('sup-', [status(thm)], ['7', '9'])).
1.93/2.14	tff(conj_0, axiom,
1.93/2.14	  (listsp(dB,
1.93/2.14	          combs(dB,bool,bool,combb(bool,fun(bool,bool),dB,fconj,it),
1.93/2.14	                combb(dB,bool,dB,it,
1.93/2.14	                      aa(dB,fun(dB,dB),combc(dB,dB,dB,app),var(i)))),
1.93/2.14	          rs))).
1.93/2.14	tff('11', plain,
1.93/2.14	    listsp(dB, 
1.93/2.14	      combs(dB, bool, bool, combb(bool, fun(bool, bool), dB, fconj, it), 
1.93/2.14	        combb(dB, bool, dB, it, 
1.93/2.14	          aa(dB, fun(dB, dB), combc(dB, dB, dB, app), var(i)))), rs),
1.93/2.14	    inference('cnf', [status(esa)], [conj_0])).
1.93/2.14	tff(fact_11_listsp__conj__eq, axiom,
1.93/2.14	  (![A:$tType,B1:fun(A,bool),A3:fun(A,bool),X3:list(A)]:
1.93/2.14	     (listsp(A,combs(A,bool,bool,combb(bool,fun(bool,bool),A,fconj,A3),B1),X3) <=>
1.93/2.14	      (listsp(A,B1,X3) & listsp(A,A3,X3))))).
1.93/2.14	tff('12', plain,
1.93/2.14	    ![X42 : $tType, X43 : fun(X42, bool), X44 : list(X42), 
1.93/2.14	      X45 : fun(X42, bool)]:
1.93/2.14	      (listsp(X42, X45, X44)
1.93/2.14	       | ~ listsp(X42, 
1.93/2.14	             combs(X42, bool, bool, 
1.93/2.14	               combb(bool, fun(bool, bool), X42, fconj, X45), X43), X44)),
1.93/2.14	    inference('cnf', [status(esa)], [fact_11_listsp__conj__eq])).
1.93/2.14	tff('13', plain, (~ $true | listsp(dB, it, rs)),
1.93/2.14	    inference('sup-', [status(thm)], ['11', '12'])).
1.93/2.14	tff('14', plain, listsp(dB, it, rs),
1.93/2.14	    inference('simplify', [status(thm)], ['13'])).
1.93/2.14	tff('15', plain,
1.93/2.14	    (~ $true | ~ listsp(dB, it, insert(dB, var(i), nil(dB))) | ~ $true),
1.93/2.14	    inference('demod', [status(thm)], ['10', '14'])).
1.93/2.14	tff('16', plain, ~ listsp(dB, it, insert(dB, var(i), nil(dB))),
1.93/2.14	    inference('simplify', [status(thm)], ['15'])).
1.93/2.14	tff('17', plain, (~ $true | ~ pp(aa(dB, bool, it, var(i)))),
1.93/2.14	    inference('sup-', [status(thm)], ['6', '16'])).
1.93/2.14	tff(fact_0_Var__IT, axiom, (![N:nat]: pp(aa(dB,bool,it,var(N))))).
1.93/2.14	tff('18', plain, ![X0 : nat]: pp(aa(dB, bool, it, var(X0))),
1.93/2.14	    inference('cnf', [status(esa)], [fact_0_Var__IT])).
1.93/2.14	tff('19', plain, (~ $true | ~ $true),
1.93/2.14	    inference('demod', [status(thm)], ['17', '18'])).
1.93/2.14	tff('20', plain, $false, inference('simplify', [status(thm)], ['19'])).
1.93/2.14	
1.93/2.14	% SZS output end Refutation
1.93/2.14	EOF
