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    : fo
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-ho \
0.00/0.00	  --no-avatar \
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	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n042.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:14:09 CST 2018
1.90/2.10	% done 1064 iterations in 1.904s
1.90/2.10	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
1.90/2.10	% SZS output start Refutation
1.90/2.10	tff(conj_0, conjecture,
1.90/2.10	  (listsp(dB,it,
1.90/2.10	          map(dB,dB,
1.90/2.10	              aa(nat,fun(dB,dB),
1.90/2.10	                 aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),
1.90/2.10	                    aa(dB,fun(dB,fun(nat,dB)),
1.90/2.10	                       aa(fun(dB,fun(dB,fun(nat,dB))),
1.90/2.10	                          fun(dB,fun(dB,fun(nat,dB))),
1.90/2.10	                          combc(dB,dB,fun(nat,dB)),subst),
1.90/2.10	                       u)),
1.90/2.10	                 i),
1.90/2.10	              nil(dB))))).
1.90/2.10	tff(zf_stmt_0, negated_conjecture,
1.90/2.10	  (~
1.90/2.10	    listsp(dB,it,
1.90/2.10	           map(dB,dB,
1.90/2.10	               aa(nat,fun(dB,dB),
1.90/2.10	                  aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),
1.90/2.10	                     combc(dB,nat,dB),
1.90/2.10	                     aa(dB,fun(dB,fun(nat,dB)),
1.90/2.10	                        aa(fun(dB,fun(dB,fun(nat,dB))),
1.90/2.10	                           fun(dB,fun(dB,fun(nat,dB))),
1.90/2.10	                           combc(dB,dB,fun(nat,dB)),subst),
1.90/2.10	                        u)),
1.90/2.10	                  i),
1.90/2.10	               nil(dB))))).
1.90/2.10	tff('0', plain,
1.90/2.10	    ~ listsp(dB, it, 
1.90/2.10	        map(dB, dB, 
1.90/2.10	          aa(nat, fun(dB, dB), 
1.90/2.10	            aa(fun(dB, fun(nat, dB)), fun(nat, fun(dB, dB)), 
1.90/2.10	              combc(dB, nat, dB), 
1.90/2.10	              aa(dB, fun(dB, fun(nat, dB)), 
1.90/2.10	                aa(fun(dB, fun(dB, fun(nat, dB))), 
1.90/2.10	                  fun(dB, fun(dB, fun(nat, dB))), 
1.90/2.10	                  combc(dB, dB, fun(nat, dB)), subst), u)), i), nil(dB))),
1.90/2.10	    inference('cnf', [status(esa)], [zf_stmt_0])).
1.90/2.10	tff(fact_6_map_Osimps_I1_J, axiom,
1.90/2.10	  (![B:$tType,A:$tType,F:fun(B,A)]: (map(B,A,F,nil(B)) = nil(A)))).
1.90/2.10	tff('1', plain,
1.90/2.10	    ![X7 : $tType, X8 : $tType, X9 : fun(X8, X7)]:
1.90/2.10	      map(X8, X7, X9, nil(X8)) = nil(X7),
1.90/2.10	    inference('cnf', [status(esa)], [fact_6_map_Osimps_I1_J])).
1.90/2.10	tff(fact_4_listsp_ONil, axiom,
1.90/2.10	  (![A:$tType,A2:fun(A,bool)]: listsp(A,A2,nil(A)))).
1.90/2.10	tff('2', plain, ![X0 : $tType, X1 : fun(X0, bool)]: listsp(X0, X1, nil(X0)),
1.90/2.10	    inference('cnf', [status(esa)], [fact_4_listsp_ONil])).
1.90/2.10	tff('3', plain, ~ $true, inference('demod', [status(thm)], ['0', '1', '2'])).
1.90/2.10	tff('4', plain, $false, inference('simplify', [status(thm)], ['3'])).
1.90/2.10	
1.90/2.10	% SZS output end Refutation
1.93/2.10	EOF
