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    : supatvars_ext
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	  --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   : n073.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:05:38 CST 2018
13.10/13.32	% done 1668 iterations in 13.118s
13.10/13.32	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
13.10/13.32	% SZS output start Refutation
13.10/13.32	tff(fact_4_argT, axiom, (pp(aa(type,bool,typing(shift(type,e,i,t1),a),t)))).
13.10/13.32	tff('0', plain, pp(aa(type, bool, typing(shift(type, e, i, t1), a), t)),
13.10/13.32	    inference('cnf', [status(esa)], [fact_4_argT])).
13.10/13.32	tff(fact_8_subst__lemma, axiom,
13.10/13.32	  (![Ib:nat,Ua:type,Ub:dB,E:fun(nat,type),Ta1:type,Ta:dB,Eb:fun(nat,type)]:
13.10/13.32	     (pp(aa(type,bool,typing(Eb,Ta),Ta1)) =>
13.10/13.32	      (pp(aa(type,bool,typing(E,Ub),Ua)) =>
13.10/13.32	       ((Eb = shift(type,E,Ib,Ua)) =>
13.10/13.32	        pp(aa(type,bool,typing(E,subst(Ta,Ub,Ib)),Ta1))))))).
13.10/13.32	tff('1', plain,
13.10/13.32	    ![X4 : fun(nat, type), X5 : dB, X6 : type, X7 : dB, X8 : nat, X9 : type, 
13.10/13.32	      X10 : fun(nat, type)]:
13.10/13.32	      (~ pp(aa(type, bool, typing(X4, X5), X6))
13.10/13.32	       | pp(aa(type, bool, typing(X4, subst(X7, X5, X8)), X9))
13.10/13.32	       | ~ pp(aa(type, bool, typing(X10, X7), X9))
13.10/13.32	       | X10 != shift(type, X4, X8, X6)),
13.10/13.32	    inference('cnf', [status(esa)], [fact_8_subst__lemma])).
13.10/13.32	tff('2', plain,
13.10/13.32	    ![X4 : fun(nat, type), X5 : dB, X6 : type, X7 : dB, X8 : nat, X9 : type]:
13.10/13.32	      (~ pp(aa(type, bool, typing(shift(type, X4, X8, X6), X7), X9))
13.10/13.32	       | pp(aa(type, bool, typing(X4, subst(X7, X5, X8)), X9))
13.10/13.32	       | ~ pp(aa(type, bool, typing(X4, X5), X6))),
13.10/13.32	    inference('simplify', [status(thm)], ['1'])).
13.10/13.32	tff('3', plain,
13.10/13.32	    ![X0 : dB]:
13.10/13.32	      (~ $true
13.10/13.32	       | ~ pp(aa(type, bool, typing(e, X0), t1))
13.10/13.32	       | pp(aa(type, bool, typing(e, subst(a, X0, i)), t))),
13.10/13.32	    inference('sup-', [status(thm)], ['0', '2'])).
13.10/13.32	tff('4', plain,
13.10/13.32	    ![X0 : dB]:
13.10/13.32	      (pp(aa(type, bool, typing(e, subst(a, X0, i)), t))
13.10/13.32	       | ~ pp(aa(type, bool, typing(e, X0), t1))),
13.10/13.32	    inference('simplify', [status(thm)], ['3'])).
13.10/13.32	tff(conj_0, conjecture, (pp(aa(type,bool,typing(e,subst(a,u,i)),t)))).
13.10/13.32	tff(zf_stmt_0, negated_conjecture,
13.10/13.32	  (~pp(aa(type,bool,typing(e,subst(a,u,i)),t)))).
13.10/13.32	tff('5', plain, ~ pp(aa(type, bool, typing(e, subst(a, u, i)), t)),
13.10/13.32	    inference('cnf', [status(esa)], [zf_stmt_0])).
13.10/13.32	tff('6', plain, (~ $true | ~ pp(aa(type, bool, typing(e, u), t1))),
13.10/13.32	    inference('sup-', [status(thm)], ['4', '5'])).
13.10/13.32	tff(fact_0_uT, axiom, (pp(aa(type,bool,typing(e,u),t1)))).
13.10/13.32	tff('7', plain, pp(aa(type, bool, typing(e, u), t1)),
13.10/13.32	    inference('cnf', [status(esa)], [fact_0_uT])).
13.10/13.32	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
13.10/13.32	tff('8', plain, ![X342 : bool]: (X342 = fFalse | X342 = fTrue),
13.10/13.32	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
13.10/13.32	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
13.10/13.32	tff('9', plain, ~ pp(fFalse),
13.10/13.32	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
13.10/13.32	tff('10', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
13.10/13.32	    inference('sup-', [status(thm)], ['8', '9'])).
13.10/13.32	tff('11', plain, (~ $true | aa(type, bool, typing(e, u), t1) = fTrue),
13.10/13.32	    inference('sup-', [status(thm)], ['7', '10'])).
13.10/13.32	tff('12', plain, aa(type, bool, typing(e, u), t1) = fTrue,
13.10/13.32	    inference('simplify', [status(thm)], ['11'])).
13.10/13.32	tff(fact_3_uIT, axiom, (pp(aa(dB,bool,it,u)))).
13.10/13.32	tff('13', plain, pp(aa(dB, bool, it, u)),
13.10/13.32	    inference('cnf', [status(esa)], [fact_3_uIT])).
13.10/13.32	tff('14', plain, (~ $true | aa(dB, bool, it, u) = fTrue),
13.10/13.32	    inference('sup-', [status(thm)], ['13', '10'])).
13.10/13.32	tff('15', plain, aa(dB, bool, it, u) = fTrue,
13.10/13.32	    inference('simplify', [status(thm)], ['14'])).
13.10/13.32	tff('16', plain, aa(dB, bool, it, u) = aa(type, bool, typing(e, u), t1),
13.10/13.32	    inference('sup+', [status(thm)], ['12', '15'])).
13.10/13.32	tff(fact_12_varT, axiom,
13.10/13.32	  (pp(aa(type,bool,typing(shift(type,e,i,t1),var(n)),
13.10/13.32	         aa(type,type,aa(type,fun(type,type),fun1,t),
13.10/13.32	            foldr(type,type,fun1,ts,t2)))))).
13.10/13.32	tff('17', plain,
13.10/13.32	    pp(
13.10/13.32	      aa(type, bool, typing(shift(type, e, i, t1), var(n)), 
13.10/13.32	        aa(type, type, aa(type, fun(type, type), fun1, t), 
13.10/13.32	          foldr(type, type, fun1, ts, t2)))),
13.10/13.32	    inference('cnf', [status(esa)], [fact_12_varT])).
13.10/13.32	tff(fact_2_True, axiom, (n = i)).
13.10/13.32	tff('18', plain, n = i, inference('cnf', [status(esa)], [fact_2_True])).
13.10/13.32	tff('19', plain,
13.10/13.32	    pp(
13.10/13.32	      aa(type, bool, typing(shift(type, e, i, t1), var(i)), 
13.10/13.32	        aa(type, type, aa(type, fun(type, type), fun1, t), 
13.10/13.32	          foldr(type, type, fun1, ts, t2)))),
13.10/13.32	    inference('demod', [status(thm)], ['17', '18'])).
13.10/13.32	tff(fact_22_T, axiom,
13.10/13.32	  (t1 =
13.10/13.32	   aa(type,type,aa(type,fun(type,type),fun1,t),foldr(type,type,fun1,ts,t2)))).
13.10/13.32	tff('20', plain,
13.10/13.32	    t1
13.10/13.32	     = aa(type, type, aa(type, fun(type, type), fun1, t), 
13.10/13.32	         foldr(type, type, fun1, ts, t2)),
13.10/13.32	    inference('cnf', [status(esa)], [fact_22_T])).
13.10/13.32	tff('21', plain,
13.10/13.32	    pp(aa(type, bool, typing(shift(type, e, i, t1), var(i)), t1)),
13.10/13.32	    inference('demod', [status(thm)], ['19', '20'])).
13.10/13.32	tff('22', plain, ![X0 : bool]: (~ pp(X0) | X0 = aa(dB, bool, it, u)),
13.10/13.32	    inference('demod', [status(thm)], ['10', '15'])).
13.10/13.32	tff('23', plain,
13.10/13.32	    (~ $true
13.10/13.32	     | aa(type, bool, typing(shift(type, e, i, t1), var(i)), t1)
13.10/13.32	        = aa(dB, bool, it, u)),
13.10/13.32	    inference('sup-', [status(thm)], ['21', '22'])).
13.10/13.32	tff('24', plain,
13.10/13.32	    aa(type, bool, typing(shift(type, e, i, t1), var(i)), t1)
13.10/13.32	     = aa(dB, bool, it, u),
13.10/13.32	    inference('simplify', [status(thm)], ['23'])).
13.10/13.32	tff('25', plain,
13.10/13.32	    aa(type, bool, typing(shift(type, e, i, t1), var(i)), t1)
13.10/13.32	     = aa(type, bool, typing(e, u), t1),
13.10/13.32	    inference('demod', [status(thm)], ['16', '24'])).
13.10/13.32	tff(fact_27_shift__eq, axiom,
13.10/13.32	  (![A:$tType,Ta1:A,Eb:fun(nat,A),J1:nat,Ib:nat]:
13.10/13.32	     ((Ib = J1) => (aa(nat,A,shift(A,Eb,Ib,Ta1),J1) = Ta1)))).
13.10/13.32	tff('26', plain,
13.10/13.32	    ![X44 : $tType, X45 : X44, X46 : fun(nat, X44), X47 : nat, X48 : nat]:
13.10/13.32	      (aa(nat, X44, shift(X44, X46, X47, X45), X48) = X45 | X47 != X48),
13.10/13.32	    inference('cnf', [status(esa)], [fact_27_shift__eq])).
13.10/13.32	tff('27', plain,
13.10/13.32	    ![X44 : $tType, X45 : X44, X46 : fun(nat, X44), X48 : nat]:
13.10/13.32	      aa(nat, X44, shift(X44, X46, X48, X45), X48) = X45,
13.10/13.32	    inference('simplify', [status(thm)], ['26'])).
13.10/13.32	tff(fact_19_typing_OVar, axiom,
13.10/13.32	  (![Ta1:type,X:nat,Env:fun(nat,type)]:
13.10/13.32	     ((aa(nat,type,Env,X) = Ta1) => pp(aa(type,bool,typing(Env,var(X)),Ta1))))).
13.10/13.32	tff('28', plain,
13.10/13.32	    ![X33 : fun(nat, type), X34 : nat, X35 : type]:
13.10/13.32	      (pp(aa(type, bool, typing(X33, var(X34)), X35))
13.10/13.32	       | aa(nat, type, X33, X34) != X35),
13.10/13.32	    inference('cnf', [status(esa)], [fact_19_typing_OVar])).
13.10/13.32	tff('29', plain,
13.10/13.32	    ![X33 : fun(nat, type), X34 : nat]:
13.10/13.32	      pp(aa(type, bool, typing(X33, var(X34)), aa(nat, type, X33, X34))),
13.10/13.32	    inference('simplify', [status(thm)], ['28'])).
13.10/13.32	tff('30', plain,
13.10/13.32	    ![X0 : type, X1 : nat, X2 : fun(nat, type)]:
13.10/13.32	      pp(aa(type, bool, typing(shift(type, X2, X1, X0), var(X1)), X0)),
13.10/13.32	    inference('sup+', [status(thm)], ['27', '29'])).
13.10/13.32	tff('31', plain, (~ $true | ~ $true),
13.10/13.32	    inference('demod', [status(thm)], ['6', '25', '30'])).
13.10/13.32	tff('32', plain, $false, inference('simplify', [status(thm)], ['31'])).
13.10/13.32	
13.10/13.32	% SZS output end Refutation
13.10/13.32	EOF
