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    : purification_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	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
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.20	% Computer   : n099.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:10:09 CST 2018
3.32/3.49	% done 1429 iterations in 3.286s
3.32/3.49	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
3.32/3.49	% SZS output start Refutation
3.32/3.49	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
3.32/3.49	tff('0', plain, ![X333 : bool]: (X333 = fFalse | X333 = fTrue),
3.32/3.49	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
3.32/3.49	tff(help_pp_2_1_U, axiom, (pp(fTrue))).
3.32/3.49	tff('1', plain, pp(fTrue), inference('cnf', [status(esa)], [help_pp_2_1_U])).
3.32/3.49	tff('2', plain, ![X0 : bool]: (pp(X0) | X0 = fFalse),
3.32/3.49	    inference('sup+', [status(thm)], ['0', '1'])).
3.32/3.49	tff(conj_0, conjecture,
3.32/3.49	  (pp(aa(list(type),bool,
3.32/3.49	         typings(e,
3.32/3.49	                 map(dB,dB,
3.32/3.49	                     combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),
3.32/3.49	         ts)))).
3.32/3.49	tff(zf_stmt_0, negated_conjecture,
3.32/3.49	  (~
3.32/3.49	    pp(aa(list(type),bool,
3.32/3.49	          typings(e,
3.32/3.49	                  map(dB,dB,
3.32/3.49	                      combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),
3.32/3.49	          ts)))).
3.32/3.49	tff('3', plain,
3.32/3.49	    ~ pp(
3.32/3.49	        aa(list(type), bool, 
3.32/3.49	          typings(e, 
3.32/3.49	            map(dB, dB, 
3.32/3.49	              combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, u), i), 
3.32/3.49	              as)), ts)),
3.32/3.49	    inference('cnf', [status(esa)], [zf_stmt_0])).
3.32/3.49	tff('4', plain,
3.32/3.49	    (~ $true
3.32/3.49	     | aa(list(type), bool, 
3.32/3.49	         typings(e, 
3.32/3.49	           map(dB, dB, 
3.32/3.49	             combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, u), i), 
3.32/3.49	             as)), ts)
3.32/3.49	        = fFalse),
3.32/3.49	    inference('sup-', [status(thm)], ['2', '3'])).
3.32/3.49	tff('5', plain,
3.32/3.49	    aa(list(type), bool, 
3.32/3.49	      typings(e, 
3.32/3.49	        map(dB, dB, 
3.32/3.49	          combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, u), i), as)), 
3.32/3.49	      ts)
3.32/3.49	     = fFalse,
3.32/3.49	    inference('simplify', [status(thm)], ['4'])).
3.32/3.49	tff(fact_4_argsT, axiom,
3.32/3.49	  (pp(aa(list(type),bool,typings(shift(type,e,i,t),as),ts)))).
3.32/3.49	tff('6', plain,
3.32/3.49	    pp(aa(list(type), bool, typings(shift(type, e, i, t), as), ts)),
3.32/3.49	    inference('cnf', [status(esa)], [fact_4_argsT])).
3.32/3.49	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
3.32/3.49	tff('7', plain, ~ pp(fFalse),
3.32/3.49	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
3.32/3.49	tff('8', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
3.32/3.49	    inference('sup-', [status(thm)], ['0', '7'])).
3.32/3.49	tff('9', plain,
3.32/3.49	    (~ $true
3.32/3.49	     | aa(list(type), bool, typings(shift(type, e, i, t), as), ts) = fTrue),
3.32/3.49	    inference('sup-', [status(thm)], ['6', '8'])).
3.32/3.49	tff('10', plain,
3.32/3.49	    aa(list(type), bool, typings(shift(type, e, i, t), as), ts) = fTrue,
3.32/3.49	    inference('simplify', [status(thm)], ['9'])).
3.32/3.49	tff(fact_6_substs__lemma, axiom,
3.32/3.49	  (![Tsa:list(type),Ts:list(dB),Ib:nat,Ta1:type,Ub:dB,Eb:fun(nat,type)]:
3.32/3.49	     (pp(aa(type,bool,aa(dB,fun(type,bool),typing(Eb),Ub),Ta1)) =>
3.32/3.49	      (pp(aa(list(type),bool,typings(shift(type,Eb,Ib,Ta1),Ts),Tsa)) =>
3.32/3.49	       pp(aa(list(type),bool,
3.32/3.49	             typings(Eb,
3.32/3.49	                     map(dB,dB,
3.32/3.49	                         combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,Ub),Ib),
3.32/3.49	                         Ts)),
3.32/3.49	             Tsa)))))).
3.32/3.49	tff('11', plain,
3.32/3.49	    ![X2 : fun(nat, type), X3 : nat, X4 : type, X5 : list(dB), 
3.32/3.49	      X6 : list(type), X7 : dB]:
3.32/3.49	      (~ pp(aa(list(type), bool, typings(shift(type, X2, X3, X4), X5), X6))
3.32/3.49	       | pp(
3.32/3.49	           aa(list(type), bool, 
3.32/3.49	             typings(X2, 
3.32/3.49	               map(dB, dB, 
3.32/3.49	                 combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X7), 
3.32/3.49	                   X3), X5)), X6))
3.32/3.49	       | ~ pp(aa(type, bool, aa(dB, fun(type, bool), typing(X2), X7), X4))),
3.32/3.49	    inference('cnf', [status(esa)], [fact_6_substs__lemma])).
3.32/3.49	tff('12', plain,
3.32/3.49	    ![X0 : dB]:
3.32/3.49	      (~ pp(fTrue)
3.32/3.49	       | ~ pp(aa(type, bool, aa(dB, fun(type, bool), typing(e), X0), t))
3.32/3.49	       | pp(
3.32/3.49	           aa(list(type), bool, 
3.32/3.49	             typings(e, 
3.32/3.49	               map(dB, dB, 
3.32/3.49	                 combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X0), 
3.32/3.49	                   i), as)), ts))),
3.32/3.49	    inference('sup-', [status(thm)], ['10', '11'])).
3.32/3.49	tff('13', plain,
3.32/3.49	    ![X0 : dB]:
3.32/3.49	      (~ $true
3.32/3.49	       | ~ pp(aa(type, bool, aa(dB, fun(type, bool), typing(e), X0), t))
3.32/3.49	       | pp(
3.32/3.49	           aa(list(type), bool, 
3.32/3.49	             typings(e, 
3.32/3.49	               map(dB, dB, 
3.32/3.49	                 combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X0), 
3.32/3.49	                   i), as)), ts))),
3.32/3.49	    inference('demod', [status(thm)], ['12', '1'])).
3.32/3.49	tff('14', plain,
3.32/3.49	    ![X0 : dB]:
3.32/3.49	      (pp(
3.32/3.49	         aa(list(type), bool, 
3.32/3.49	           typings(e, 
3.32/3.49	             map(dB, dB, 
3.32/3.49	               combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X0), i), 
3.32/3.49	               as)), ts))
3.32/3.49	       | ~ pp(aa(type, bool, aa(dB, fun(type, bool), typing(e), X0), t))),
3.32/3.49	    inference('simplify', [status(thm)], ['13'])).
3.32/3.49	tff(help_COMBC_1_1_U, axiom,
3.32/3.49	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun(A,fun(B,C))]:
3.32/3.49	     (aa(A,C,combc(A,B,C,P,Q),R) = aa(B,C,aa(A,fun(B,C),P,R),Q)))).
3.32/3.49	tff('15', plain,
3.32/3.49	    ![X313 : $tType, X314 : $tType, X315 : $tType, 
3.32/3.49	      X316 : fun(X315, fun(X313, X314)), X317 : X315, X318 : X313]:
3.32/3.49	      aa(X315, X314, combc(X315, X313, X314, X316, X318), X317)
3.32/3.49	       = aa(X313, X314, aa(X315, fun(X313, X314), X316, X317), X318),
3.32/3.49	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
3.32/3.49	tff('16', plain,
3.32/3.49	    ![X0 : dB]:
3.32/3.49	      (pp(
3.32/3.49	         aa(list(type), bool, 
3.32/3.49	           typings(e, 
3.32/3.49	             map(dB, dB, 
3.32/3.49	               combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X0), i), 
3.32/3.49	               as)), ts))
3.32/3.49	       | ~ pp(aa(dB, bool, combc(dB, type, bool, typing(e), t), X0))),
3.32/3.49	    inference('demod', [status(thm)], ['14', '15'])).
3.32/3.49	tff('17', plain,
3.32/3.49	    (pp(fFalse) | ~ pp(aa(dB, bool, combc(dB, type, bool, typing(e), t), u))),
3.32/3.49	    inference('sup+', [status(thm)], ['5', '16'])).
3.32/3.49	tff(fact_0_uT, axiom,
3.32/3.49	  (pp(aa(type,bool,aa(dB,fun(type,bool),typing(e),u),t)))).
3.32/3.49	tff('18', plain,
3.32/3.49	    pp(aa(type, bool, aa(dB, fun(type, bool), typing(e), u), t)),
3.32/3.49	    inference('cnf', [status(esa)], [fact_0_uT])).
3.32/3.49	tff('19', plain,
3.32/3.49	    (~ $true
3.32/3.49	     | aa(type, bool, aa(dB, fun(type, bool), typing(e), u), t) = fTrue),
3.32/3.49	    inference('sup-', [status(thm)], ['18', '8'])).
3.32/3.49	tff('20', plain,
3.32/3.49	    aa(type, bool, aa(dB, fun(type, bool), typing(e), u), t) = fTrue,
3.32/3.49	    inference('simplify', [status(thm)], ['19'])).
3.32/3.49	tff('21', plain,
3.32/3.49	    aa(dB, bool, combc(dB, type, bool, typing(e), t), u) = fTrue,
3.32/3.49	    inference('demod', [status(thm)], ['20', '15'])).
3.32/3.49	tff('22', plain, (pp(fFalse) | ~ $true),
3.32/3.49	    inference('demod', [status(thm)], ['17', '21', '1'])).
3.32/3.49	tff('23', plain, pp(fFalse), inference('simplify', [status(thm)], ['22'])).
3.32/3.49	tff('24', plain, ~ $true, inference('sup-', [status(thm)], ['23', '7'])).
3.32/3.49	tff('25', plain, $false, inference('simplify', [status(thm)], ['24'])).
3.32/3.49	
3.32/3.49	% SZS output end Refutation
3.32/3.50	EOF
