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    : fo
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-ho \
0.00/0.01	  --no-avatar \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2 \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n082.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 07:16:23 CST 2018
1.96/2.18	% done 1377 iterations in 1.968s
1.96/2.18	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
1.96/2.18	% SZS output start Refutation
1.96/2.18	tff(fact_2__096e_A_092_060turnstile_062_Aa_091u_Pi_093_A_058_AT_H_H_096, axiom,
1.96/2.18	  (pp(aa(type,bool,
1.96/2.18	         aa(dB,fun1(type,bool),typing(e),
1.96/2.18	            aa(nat,dB,
1.96/2.18	               aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i)),
1.96/2.18	         t2)))).
1.96/2.18	tff('0', plain,
1.96/2.18	    pp(
1.96/2.18	      aa(type, bool, 
1.96/2.18	        aa(dB, fun1(type, bool), typing(e), 
1.96/2.18	          aa(nat, dB, 
1.96/2.18	            aa(dB, fun1(nat, dB), aa(dB, fun1(dB, fun1(nat, dB)), subst, a), 
1.96/2.18	              u), i)), t2)),
1.96/2.18	    inference('cnf', [status(esa)],
1.96/2.18	              [fact_2__096e_A_092_060turnstile_062_Aa_091u_Pi_093_A_058_AT_H_H_096])).
1.96/2.18	tff(fact_7_App, axiom,
1.96/2.18	  (![Ta:dB,Ua:type,Ta1:type,S1:dB,Env:fun1(nat,type)]:
1.96/2.18	     (pp(aa(type,bool,aa(dB,fun1(type,bool),typing(Env),S1),
1.96/2.18	            aa(type,type,aa(type,fun1(type,type),fun,Ta1),Ua))) =>
1.96/2.18	      (pp(aa(type,bool,aa(dB,fun1(type,bool),typing(Env),Ta),Ta1)) =>
1.96/2.18	       pp(aa(type,bool,
1.96/2.18	             aa(dB,fun1(type,bool),typing(Env),
1.96/2.18	                aa(dB,dB,aa(dB,fun1(dB,dB),app,S1),Ta)),
1.96/2.18	             Ua)))))).
1.96/2.18	tff('1', plain,
1.96/2.18	    ![X0 : fun1(nat, type), X1 : dB, X2 : type, X3 : dB, X4 : type]:
1.96/2.18	      (~ pp(aa(type, bool, aa(dB, fun1(type, bool), typing(X0), X1), X2))
1.96/2.18	       | pp(
1.96/2.18	           aa(type, bool, 
1.96/2.18	             aa(dB, fun1(type, bool), typing(X0), 
1.96/2.18	               aa(dB, dB, aa(dB, fun1(dB, dB), app, X3), X1)), X4))
1.96/2.18	       | ~ pp(
1.96/2.18	             aa(type, bool, aa(dB, fun1(type, bool), typing(X0), X3), 
1.96/2.18	               aa(type, type, aa(type, fun1(type, type), fun, X2), X4)))),
1.96/2.18	    inference('cnf', [status(esa)], [fact_7_App])).
1.96/2.18	tff('2', plain,
1.96/2.18	    ![X0 : type, X1 : dB]:
1.96/2.18	      (~ $true
1.96/2.18	       | ~ pp(
1.96/2.18	             aa(type, bool, aa(dB, fun1(type, bool), typing(e), X1), 
1.96/2.18	               aa(type, type, aa(type, fun1(type, type), fun, t2), X0)))
1.96/2.18	       | pp(
1.96/2.18	           aa(type, bool, 
1.96/2.18	             aa(dB, fun1(type, bool), typing(e), 
1.96/2.18	               aa(dB, dB, aa(dB, fun1(dB, dB), app, X1), 
1.96/2.18	                 aa(nat, dB, 
1.96/2.18	                   aa(dB, fun1(nat, dB), 
1.96/2.18	                     aa(dB, fun1(dB, fun1(nat, dB)), subst, a), u), i))), X0))),
1.96/2.18	    inference('sup-', [status(thm)], ['0', '1'])).
1.96/2.18	tff('3', plain,
1.96/2.18	    ![X0 : type, X1 : dB]:
1.96/2.18	      (pp(
1.96/2.18	         aa(type, bool, 
1.96/2.18	           aa(dB, fun1(type, bool), typing(e), 
1.96/2.18	             aa(dB, dB, aa(dB, fun1(dB, dB), app, X1), 
1.96/2.18	               aa(nat, dB, 
1.96/2.18	                 aa(dB, fun1(nat, dB), 
1.96/2.18	                   aa(dB, fun1(dB, fun1(nat, dB)), subst, a), u), i))), X0))
1.96/2.18	       | ~ pp(
1.96/2.18	             aa(type, bool, aa(dB, fun1(type, bool), typing(e), X1), 
1.96/2.18	               aa(type, type, aa(type, fun1(type, type), fun, t2), X0)))),
1.96/2.18	    inference('simplify', [status(thm)], ['2'])).
1.96/2.18	tff(help_COMBC_1_1_U, axiom,
1.96/2.18	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun1(A,fun1(B,C))]:
1.96/2.18	     (aa(A,C,combc(A,B,C,P,Q),R) = aa(B,C,aa(A,fun1(B,C),P,R),Q)))).
1.96/2.18	tff('4', plain,
1.96/2.18	    ![X303 : $tType, X304 : $tType, X305 : $tType, 
1.96/2.18	      X306 : fun1(X305, fun1(X303, X304)), X307 : X305, X308 : X303]:
1.96/2.18	      aa(X305, X304, combc(X305, X303, X304, X306, X308), X307)
1.96/2.18	       = aa(X303, X304, aa(X305, fun1(X303, X304), X306, X307), X308),
1.96/2.18	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
1.96/2.18	tff('5', plain,
1.96/2.18	    ![X0 : type, X1 : dB]:
1.96/2.18	      (pp(
1.96/2.18	         aa(dB, bool, combc(dB, type, bool, typing(e), X0), 
1.96/2.18	           aa(dB, dB, 
1.96/2.18	             combc(dB, dB, dB, app, 
1.96/2.18	               aa(dB, dB, 
1.96/2.18	                 combc(dB, nat, dB, combc(dB, dB, fun1(nat, dB), subst, u), 
1.96/2.18	                   i), a)), X1)))
1.96/2.18	       | ~ pp(
1.96/2.18	             aa(dB, bool, 
1.96/2.18	               combc(dB, type, bool, typing(e), 
1.96/2.18	                 aa(type, type, combc(type, type, type, fun, X0), t2)), X1))),
1.96/2.18	    inference('demod', [status(thm)], ['3', '4', '4', '4', '4', '4', '4'])).
1.96/2.18	tff(conj_0, conjecture,
1.96/2.18	  (pp(aa(type,bool,
1.96/2.18	         aa(dB,fun1(type,bool),typing(e),
1.96/2.18	            aa(dB,dB,aa(dB,fun1(dB,dB),app,u),
1.96/2.18	               aa(nat,dB,
1.96/2.18	                  aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),
1.96/2.18	                  i))),
1.96/2.18	         foldr(type,type,fun,ts,t))))).
1.96/2.18	tff(zf_stmt_0, negated_conjecture,
1.96/2.18	  (~
1.96/2.18	    pp(aa(type,bool,
1.96/2.18	          aa(dB,fun1(type,bool),typing(e),
1.96/2.18	             aa(dB,dB,aa(dB,fun1(dB,dB),app,u),
1.96/2.18	                aa(nat,dB,
1.96/2.18	                   aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),
1.96/2.18	                   i))),
1.96/2.18	          foldr(type,type,fun,ts,t))))).
1.96/2.18	tff('6', plain,
1.96/2.18	    ~ pp(
1.96/2.18	        aa(type, bool, 
1.96/2.18	          aa(dB, fun1(type, bool), typing(e), 
1.96/2.18	            aa(dB, dB, aa(dB, fun1(dB, dB), app, u), 
1.96/2.18	              aa(nat, dB, 
1.96/2.18	                aa(dB, fun1(nat, dB), 
1.96/2.18	                  aa(dB, fun1(dB, fun1(nat, dB)), subst, a), u), i))), 
1.96/2.18	          foldr(type, type, fun, ts, t))),
1.96/2.18	    inference('cnf', [status(esa)], [zf_stmt_0])).
1.96/2.18	tff('7', plain,
1.96/2.18	    ~ pp(
1.96/2.18	        aa(dB, bool, 
1.96/2.18	          combc(dB, type, bool, typing(e), foldr(type, type, fun, ts, t)), 
1.96/2.18	          aa(dB, dB, 
1.96/2.18	            combc(dB, dB, dB, app, 
1.96/2.18	              aa(dB, dB, 
1.96/2.18	                combc(dB, nat, dB, combc(dB, dB, fun1(nat, dB), subst, u), i), 
1.96/2.18	                a)), u))),
1.96/2.18	    inference('demod', [status(thm)], ['6', '4', '4', '4', '4'])).
1.96/2.18	tff('8', plain,
1.96/2.18	    (~ $true
1.96/2.18	     | ~ pp(
1.96/2.18	           aa(dB, bool, 
1.96/2.18	             combc(dB, type, bool, typing(e), 
1.96/2.18	               aa(type, type, 
1.96/2.18	                 combc(type, type, type, fun, foldr(type, type, fun, ts, t)), 
1.96/2.18	                 t2)), u))),
1.96/2.18	    inference('sup-', [status(thm)], ['5', '7'])).
1.96/2.18	tff(fact_10_T, axiom,
1.96/2.18	  (t1 =
1.96/2.18	   aa(type,type,aa(type,fun1(type,type),fun,t2),foldr(type,type,fun,ts,t)))).
1.96/2.18	tff('9', plain,
1.96/2.18	    t1
1.96/2.18	     = aa(type, type, aa(type, fun1(type, type), fun, t2), 
1.96/2.18	         foldr(type, type, fun, ts, t)),
1.96/2.18	    inference('cnf', [status(esa)], [fact_10_T])).
1.96/2.18	tff('10', plain,
1.96/2.18	    t1
1.96/2.18	     = aa(type, type, 
1.96/2.18	         combc(type, type, type, fun, foldr(type, type, fun, ts, t)), t2),
1.96/2.18	    inference('demod', [status(thm)], ['9', '4'])).
1.96/2.18	tff(fact_5_uT, axiom,
1.96/2.18	  (pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t1)))).
1.96/2.18	tff('11', plain,
1.96/2.18	    pp(aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), t1)),
1.96/2.18	    inference('cnf', [status(esa)], [fact_5_uT])).
1.96/2.18	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
1.96/2.18	tff('12', plain, ![X323 : bool]: (X323 = fFalse | X323 = fTrue),
1.96/2.18	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
1.96/2.18	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
1.96/2.18	tff('13', plain, ~ pp(fFalse),
1.96/2.18	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
1.96/2.18	tff('14', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
1.96/2.18	    inference('sup-', [status(thm)], ['12', '13'])).
1.96/2.18	tff('15', plain,
1.96/2.18	    (~ $true
1.96/2.18	     | aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), t1) = fTrue),
1.96/2.18	    inference('sup-', [status(thm)], ['11', '14'])).
1.96/2.18	tff('16', plain,
1.96/2.18	    aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), t1) = fTrue,
1.96/2.18	    inference('simplify', [status(thm)], ['15'])).
1.96/2.18	tff('17', plain,
1.96/2.18	    aa(dB, bool, combc(dB, type, bool, typing(e), t1), u) = fTrue,
1.96/2.18	    inference('demod', [status(thm)], ['16', '4'])).
1.96/2.18	tff(help_pp_2_1_U, axiom, (pp(fTrue))).
1.96/2.18	tff('18', plain, pp(fTrue), inference('cnf', [status(esa)], [help_pp_2_1_U])).
1.96/2.18	tff('19', plain, (~ $true | ~ $true),
1.96/2.18	    inference('demod', [status(thm)], ['8', '10', '17', '18'])).
1.96/2.18	tff('20', plain, $false, inference('simplify', [status(thm)], ['19'])).
1.96/2.18	
1.96/2.18	% SZS output end Refutation
1.96/2.18	EOF
