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_int
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 int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
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   : n144.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
3.59/3.79	% done 1503 iterations in 3.593s
3.59/3.79	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
3.59/3.79	% SZS output start Refutation
3.59/3.79	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
3.59/3.79	tff('0', plain, ![X342 : bool]: (X342 = fFalse | X342 = fTrue),
3.59/3.79	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
3.59/3.79	tff(conj_0, conjecture, (pp(aa(type,bool,typing(e,subst(a,u,i)),t)))).
3.59/3.79	tff(zf_stmt_0, negated_conjecture,
3.59/3.79	  (~pp(aa(type,bool,typing(e,subst(a,u,i)),t)))).
3.59/3.79	tff('1', plain, ~ pp(aa(type, bool, typing(e, subst(a, u, i)), t)),
3.59/3.79	    inference('cnf', [status(esa)], [zf_stmt_0])).
3.59/3.79	tff('2', plain,
3.59/3.79	    (~ pp(fTrue) | aa(type, bool, typing(e, subst(a, u, i)), t) = fFalse),
3.59/3.79	    inference('sup-', [status(thm)], ['0', '1'])).
3.59/3.79	tff(help_pp_2_1_U, axiom, (pp(fTrue))).
3.59/3.79	tff('3', plain, pp(fTrue), inference('cnf', [status(esa)], [help_pp_2_1_U])).
3.59/3.79	tff('4', plain,
3.59/3.79	    (~ $true | aa(type, bool, typing(e, subst(a, u, i)), t) = fFalse),
3.59/3.79	    inference('demod', [status(thm)], ['2', '3'])).
3.59/3.79	tff('5', plain, aa(type, bool, typing(e, subst(a, u, i)), t) = fFalse,
3.59/3.79	    inference('simplify', [status(thm)], ['4'])).
3.59/3.79	tff(fact_4_argT, axiom, (pp(aa(type,bool,typing(shift(type,e,i,t1),a),t)))).
3.59/3.79	tff('6', plain, pp(aa(type, bool, typing(shift(type, e, i, t1), a), t)),
3.59/3.79	    inference('cnf', [status(esa)], [fact_4_argT])).
3.59/3.79	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
3.59/3.79	tff('7', plain, ~ pp(fFalse),
3.59/3.79	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
3.59/3.79	tff('8', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
3.59/3.79	    inference('sup-', [status(thm)], ['0', '7'])).
3.59/3.79	tff('9', plain,
3.59/3.79	    (~ $true | aa(type, bool, typing(shift(type, e, i, t1), a), t) = fTrue),
3.59/3.79	    inference('sup-', [status(thm)], ['6', '8'])).
3.59/3.79	tff('10', plain, aa(type, bool, typing(shift(type, e, i, t1), a), t) = fTrue,
3.59/3.79	    inference('simplify', [status(thm)], ['9'])).
3.59/3.79	tff(fact_8_subst__lemma, axiom,
3.59/3.79	  (![Ib:nat,Ua:type,Ub:dB,E:fun(nat,type),Ta1:type,Ta:dB,Eb:fun(nat,type)]:
3.59/3.79	     (pp(aa(type,bool,typing(Eb,Ta),Ta1)) =>
3.59/3.79	      (pp(aa(type,bool,typing(E,Ub),Ua)) =>
3.59/3.79	       ((Eb = shift(type,E,Ib,Ua)) =>
3.59/3.79	        pp(aa(type,bool,typing(E,subst(Ta,Ub,Ib)),Ta1))))))).
3.59/3.79	tff('11', plain,
3.59/3.79	    ![X4 : fun(nat, type), X5 : dB, X6 : type, X7 : dB, X8 : nat, X9 : type, 
3.59/3.79	      X10 : fun(nat, type)]:
3.59/3.79	      (~ pp(aa(type, bool, typing(X4, X5), X6))
3.59/3.79	       | pp(aa(type, bool, typing(X4, subst(X7, X5, X8)), X9))
3.59/3.79	       | ~ pp(aa(type, bool, typing(X10, X7), X9))
3.59/3.79	       | X10 != shift(type, X4, X8, X6)),
3.59/3.79	    inference('cnf', [status(esa)], [fact_8_subst__lemma])).
3.59/3.79	tff('12', plain,
3.59/3.79	    ![X4 : fun(nat, type), X5 : dB, X6 : type, X7 : dB, X8 : nat, X9 : type]:
3.59/3.79	      (~ pp(aa(type, bool, typing(shift(type, X4, X8, X6), X7), X9))
3.59/3.79	       | pp(aa(type, bool, typing(X4, subst(X7, X5, X8)), X9))
3.59/3.79	       | ~ pp(aa(type, bool, typing(X4, X5), X6))),
3.59/3.79	    inference('simplify', [status(thm)], ['11'])).
3.59/3.79	tff('13', plain,
3.59/3.79	    ![X0 : dB]:
3.59/3.79	      (~ pp(fTrue)
3.59/3.79	       | ~ pp(aa(type, bool, typing(e, X0), t1))
3.59/3.79	       | pp(aa(type, bool, typing(e, subst(a, X0, i)), t))),
3.59/3.79	    inference('sup-', [status(thm)], ['10', '12'])).
3.59/3.79	tff('14', plain,
3.59/3.79	    ![X0 : dB]:
3.59/3.79	      (~ $true
3.59/3.79	       | ~ pp(aa(type, bool, typing(e, X0), t1))
3.59/3.79	       | pp(aa(type, bool, typing(e, subst(a, X0, i)), t))),
3.59/3.79	    inference('demod', [status(thm)], ['13', '3'])).
3.59/3.79	tff('15', plain,
3.59/3.79	    ![X0 : dB]:
3.59/3.79	      (pp(aa(type, bool, typing(e, subst(a, X0, i)), t))
3.59/3.79	       | ~ pp(aa(type, bool, typing(e, X0), t1))),
3.59/3.79	    inference('simplify', [status(thm)], ['14'])).
3.59/3.79	tff('16', plain, (pp(fFalse) | ~ pp(aa(type, bool, typing(e, u), t1))),
3.59/3.79	    inference('sup+', [status(thm)], ['5', '15'])).
3.59/3.79	tff(fact_0_uT, axiom, (pp(aa(type,bool,typing(e,u),t1)))).
3.59/3.79	tff('17', plain, pp(aa(type, bool, typing(e, u), t1)),
3.59/3.79	    inference('cnf', [status(esa)], [fact_0_uT])).
3.59/3.79	tff('18', plain, (~ $true | aa(type, bool, typing(e, u), t1) = fTrue),
3.59/3.79	    inference('sup-', [status(thm)], ['17', '8'])).
3.59/3.79	tff('19', plain, aa(type, bool, typing(e, u), t1) = fTrue,
3.59/3.79	    inference('simplify', [status(thm)], ['18'])).
3.59/3.79	tff('20', plain, (pp(fFalse) | ~ $true),
3.59/3.79	    inference('demod', [status(thm)], ['16', '19', '3'])).
3.59/3.79	tff('21', plain, pp(fFalse), inference('simplify', [status(thm)], ['20'])).
3.59/3.79	tff('22', plain, ~ $true, inference('sup-', [status(thm)], ['21', '7'])).
3.59/3.79	tff('23', plain, $false, inference('simplify', [status(thm)], ['22'])).
3.59/3.79	
3.59/3.79	% SZS output end Refutation
3.59/3.79	EOF
