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_ext
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	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-ext-axiom \
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   : n091.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:18:23 CST 2018
2.19/2.45	% done 1070 iterations in 2.249s
2.19/2.45	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
2.19/2.45	% SZS output start Refutation
2.19/2.45	tff(conj_0, conjecture,
2.19/2.45	  (listsp(dB,it,
2.19/2.45	          map(dB,dB,
2.19/2.45	              aa(nat,fun(dB,dB),
2.19/2.45	                 aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),
2.19/2.45	                    aa(dB,fun(dB,fun(nat,dB)),
2.19/2.45	                       aa(fun(dB,fun(dB,fun(nat,dB))),
2.19/2.45	                          fun(dB,fun(dB,fun(nat,dB))),
2.19/2.45	                          combc(dB,dB,fun(nat,dB)),subst),
2.19/2.45	                       u)),
2.19/2.45	                 i),
2.19/2.45	              nil(dB))))).
2.19/2.45	tff(zf_stmt_0, negated_conjecture,
2.19/2.45	  (~
2.19/2.45	    listsp(dB,it,
2.19/2.45	           map(dB,dB,
2.19/2.45	               aa(nat,fun(dB,dB),
2.19/2.45	                  aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),
2.19/2.45	                     combc(dB,nat,dB),
2.19/2.45	                     aa(dB,fun(dB,fun(nat,dB)),
2.19/2.45	                        aa(fun(dB,fun(dB,fun(nat,dB))),
2.19/2.45	                           fun(dB,fun(dB,fun(nat,dB))),
2.19/2.45	                           combc(dB,dB,fun(nat,dB)),subst),
2.19/2.45	                        u)),
2.19/2.45	                  i),
2.19/2.45	               nil(dB))))).
2.19/2.45	tff('0', plain,
2.19/2.45	    ~ listsp(dB, it, 
2.19/2.45	        map(dB, dB, 
2.19/2.45	          aa(nat, fun(dB, dB), 
2.19/2.45	            aa(fun(dB, fun(nat, dB)), fun(nat, fun(dB, dB)), 
2.19/2.45	              combc(dB, nat, dB), 
2.19/2.45	              aa(dB, fun(dB, fun(nat, dB)), 
2.19/2.45	                aa(fun(dB, fun(dB, fun(nat, dB))), 
2.19/2.45	                  fun(dB, fun(dB, fun(nat, dB))), 
2.19/2.45	                  combc(dB, dB, fun(nat, dB)), subst), u)), i), nil(dB))),
2.19/2.45	    inference('cnf', [status(esa)], [zf_stmt_0])).
2.19/2.45	tff(fact_6_map_Osimps_I1_J, axiom,
2.19/2.45	  (![B:$tType,A:$tType,F:fun(B,A)]: (map(B,A,F,nil(B)) = nil(A)))).
2.19/2.45	tff('1', plain,
2.19/2.45	    ![X7 : $tType, X8 : $tType, X9 : fun(X8, X7)]:
2.19/2.45	      map(X8, X7, X9, nil(X8)) = nil(X7),
2.19/2.45	    inference('cnf', [status(esa)], [fact_6_map_Osimps_I1_J])).
2.19/2.45	tff(fact_4_listsp_ONil, axiom,
2.19/2.45	  (![A:$tType,A2:fun(A,bool)]: listsp(A,A2,nil(A)))).
2.19/2.45	tff('2', plain, ![X0 : $tType, X1 : fun(X0, bool)]: listsp(X0, X1, nil(X0)),
2.19/2.45	    inference('cnf', [status(esa)], [fact_4_listsp_ONil])).
2.19/2.45	tff('3', plain, ~ $true, inference('demod', [status(thm)], ['0', '1', '2'])).
2.19/2.45	tff('4', plain, $false, inference('simplify', [status(thm)], ['3'])).
2.19/2.45	
2.19/2.45	% SZS output end Refutation
2.19/2.45	EOF
