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    : 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	  --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   : n095.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:09 CST 2018
144.36/144.57	% done 3162 iterations in 144.371s
144.36/144.57	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
144.36/144.57	% SZS output start Refutation
144.36/144.57	tff(help_COMBC_1_1_U, axiom,
144.36/144.57	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun(A,fun(B,C))]:
144.36/144.57	     (aa(A,C,aa(B,fun(A,C),combc(A,B,C,P),Q),R) =
144.36/144.57	      aa(B,C,aa(A,fun(B,C),P,R),Q)))).
144.36/144.57	tff('0', plain,
144.36/144.57	    ![X385 : $tType, X386 : $tType, X387 : $tType, 
144.36/144.57	      X388 : fun(X387, fun(X385, X386)), X389 : X387, X390 : X385]:
144.36/144.57	      aa(X387, X386, 
144.36/144.57	        aa(X385, fun(X387, X386), combc(X387, X385, X386, X388), X390), X389)
144.36/144.57	       = aa(X385, X386, aa(X387, fun(X385, X386), X388, X389), X390),
144.36/144.57	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
144.36/144.57	tff(fact_10_listsp_Osimps, axiom,
144.36/144.57	  (![A:$tType,A2:list(A),A1:fun(A,bool)]:
144.36/144.57	     (listsp(A,A1,A2) <=>
144.36/144.57	      ((?[A4:A,L:list(A)]:
144.36/144.57	          (listsp(A,A1,L) & pp(aa(A,bool,A1,A4)) & 
144.36/144.57	           (A2 = aa(list(A),list(A),aa(A,fun(list(A),list(A)),cons(A),A4),L)))) | 
144.36/144.57	       (A2 = nil(A)))))).
144.36/144.57	tff('1', plain,
144.36/144.57	    ![X34 : $tType, X35 : list(X34), X37 : fun(X34, bool), X38 : X34, 
144.36/144.57	      X39 : list(X34)]:
144.36/144.57	      (listsp(X34, X37, X35)
144.36/144.57	       | ~ pp(aa(X34, bool, X37, X38))
144.36/144.57	       | X35
144.36/144.57	          != aa(list(X34), list(X34), 
144.36/144.57	               aa(X34, fun(list(X34), list(X34)), cons(X34), X38), X39)
144.36/144.57	       | ~ listsp(X34, X37, X39)),
144.36/144.57	    inference('cnf', [status(esa)], [fact_10_listsp_Osimps])).
144.36/144.57	tff('2', plain,
144.36/144.57	    ![X34 : $tType, X37 : fun(X34, bool), X38 : X34, X39 : list(X34)]:
144.36/144.57	      (~ listsp(X34, X37, X39)
144.36/144.57	       | ~ pp(aa(X34, bool, X37, X38))
144.36/144.57	       | listsp(X34, X37, 
144.36/144.57	           aa(list(X34), list(X34), 
144.36/144.57	             aa(X34, fun(list(X34), list(X34)), cons(X34), X38), X39))),
144.36/144.57	    inference('simplify', [status(thm)], ['1'])).
144.36/144.57	tff('3', plain,
144.36/144.57	    ![X0 : $tType, X1 : X0, X2 : list(X0), X3 : fun(X0, bool)]:
144.36/144.57	      (listsp(X0, X3, 
144.36/144.57	         aa(X0, list(X0), 
144.36/144.57	           aa(list(X0), fun(X0, list(X0)), 
144.36/144.57	             combc(X0, list(X0), list(X0), cons(X0)), X2), X1))
144.36/144.57	       | ~ pp(aa(X0, bool, X3, X1))
144.36/144.57	       | ~ listsp(X0, X3, X2)),
144.36/144.57	    inference('sup+', [status(thm)], ['0', '2'])).
144.36/144.57	tff(conj_1, conjecture,
144.36/144.57	  (listsp(dB,it,
144.36/144.57	          aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),
144.36/144.57	             nil(dB))))).
144.36/144.57	tff(zf_stmt_0, negated_conjecture,
144.36/144.57	  (~
144.36/144.57	    listsp(dB,it,
144.36/144.57	           aa(list(dB),list(dB),
144.36/144.57	              aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))))).
144.36/144.57	tff('4', plain,
144.36/144.57	    ~ listsp(dB, it, 
144.36/144.57	        aa(list(dB), list(dB), 
144.36/144.57	          aa(dB, fun(list(dB), list(dB)), cons(dB), var(i)), nil(dB))),
144.36/144.57	    inference('cnf', [status(esa)], [zf_stmt_0])).
144.36/144.57	tff('5', plain,
144.36/144.57	    ~ listsp(dB, it, 
144.36/144.57	        aa(dB, list(dB), 
144.36/144.57	          aa(list(dB), fun(dB, list(dB)), 
144.36/144.57	            combc(dB, list(dB), list(dB), cons(dB)), nil(dB)), var(i))),
144.36/144.57	    inference('demod', [status(thm)], ['4', '0'])).
144.36/144.57	tff('6', plain,
144.36/144.57	    (~ $true | ~ listsp(dB, it, nil(dB)) | ~ pp(aa(dB, bool, it, var(i)))),
144.36/144.57	    inference('sup-', [status(thm)], ['3', '5'])).
144.36/144.57	tff(fact_1_listsp_ONil, axiom,
144.36/144.57	  (![A:$tType,A1:fun(A,bool)]: listsp(A,A1,nil(A)))).
144.36/144.57	tff('7', plain, ![X1 : $tType, X2 : fun(X1, bool)]: listsp(X1, X2, nil(X1)),
144.36/144.57	    inference('cnf', [status(esa)], [fact_1_listsp_ONil])).
144.36/144.57	tff(fact_0_Var__IT, axiom, (![N2:nat]: pp(aa(dB,bool,it,var(N2))))).
144.36/144.57	tff('8', plain, ![X0 : nat]: pp(aa(dB, bool, it, var(X0))),
144.36/144.57	    inference('cnf', [status(esa)], [fact_0_Var__IT])).
144.36/144.57	tff('9', plain, (~ $true | ~ $true | ~ $true),
144.36/144.57	    inference('demod', [status(thm)], ['6', '7', '8'])).
144.36/144.57	tff('10', plain, $false, inference('simplify', [status(thm)], ['9'])).
144.36/144.57	
144.36/144.57	% SZS output end Refutation
144.36/144.58	EOF
