0.00/0.01	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : purification_int
0.00/0.01	% Ordering    : rpo6
0.00/0.01	% 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-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
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	  --ho-purify int \
0.00/0.01	  --ho-no-ext-pos \
0.00/0.01	  --ho-no-ext-neg \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.21	% Computer   : n050.star.cs.uiowa.edu
0.00/0.21	% Model      : x86_64 x86_64
0.00/0.21	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.21	% Memory     : 32218.625MB
0.00/0.21	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.21	% CPULimit   : 300
0.00/0.21	% DateTime   : Fri Feb  2 06:59:24 CST 2018
0.00/0.33	% done 161 iterations in 0.117s
0.00/0.33	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.33	% SZS output start Refutation
0.00/0.33	tff(fact_10_argsT, axiom,
0.00/0.33	  (pp(aa(list(type),bool,typings(shift(type,e,i,t2),as),ts)))).
0.00/0.33	tff('0', plain,
0.00/0.33	    pp(aa(list(type), bool, typings(shift(type, e, i, t2), as), ts)),
0.00/0.33	    inference('cnf', [status(esa)], [fact_10_argsT])).
0.00/0.33	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
0.00/0.33	tff('1', plain, ![X357 : bool]: (X357 = fFalse | X357 = fTrue),
0.00/0.33	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
0.00/0.33	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
0.00/0.33	tff('2', plain, ~ pp(fFalse),
0.00/0.33	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
0.00/0.33	tff('3', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
0.00/0.33	    inference('sup-', [status(thm)], ['1', '2'])).
0.00/0.33	tff('4', plain,
0.00/0.33	    (~ $true
0.00/0.33	     | aa(list(type), bool, typings(shift(type, e, i, t2), as), ts) = fTrue),
0.00/0.33	    inference('sup-', [status(thm)], ['0', '3'])).
0.00/0.33	tff('5', plain,
0.00/0.33	    aa(list(type), bool, typings(shift(type, e, i, t2), as), ts) = fTrue,
0.00/0.33	    inference('simplify', [status(thm)], ['4'])).
0.00/0.33	tff(fact_1_uT, axiom,
0.00/0.33	  (pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t2)))).
0.00/0.33	tff('6', plain,
0.00/0.33	    pp(aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), t2)),
0.00/0.33	    inference('cnf', [status(esa)], [fact_1_uT])).
0.00/0.33	tff('7', plain,
0.00/0.33	    (~ $true
0.00/0.33	     | aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), t2) = fTrue),
0.00/0.33	    inference('sup-', [status(thm)], ['6', '3'])).
0.00/0.33	tff('8', plain,
0.00/0.33	    aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), t2) = fTrue,
0.00/0.33	    inference('simplify', [status(thm)], ['7'])).
0.00/0.33	tff('9', plain,
0.00/0.33	    aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), t2)
0.00/0.33	     = aa(list(type), bool, typings(shift(type, e, i, t2), as), ts),
0.00/0.33	    inference('sup+', [status(thm)], ['5', '8'])).
0.00/0.33	tff(help_COMBC_1_1_U, axiom,
0.00/0.33	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun1(A,fun1(B,C))]:
0.00/0.33	     (aa(A,C,combc(A,B,C,P,Q),R) = aa(B,C,aa(A,fun1(B,C),P,R),Q)))).
0.00/0.33	tff('10', plain,
0.00/0.33	    ![X337 : $tType, X338 : $tType, X339 : $tType, 
0.00/0.33	      X340 : fun1(X339, fun1(X337, X338)), X341 : X339, X342 : X337]:
0.00/0.33	      aa(X339, X338, combc(X339, X337, X338, X340, X342), X341)
0.00/0.33	       = aa(X337, X338, aa(X339, fun1(X337, X338), X340, X341), X342),
0.00/0.33	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
0.00/0.33	tff('11', plain,
0.00/0.33	    aa(dB, bool, combc(dB, type, bool, typing(e), t2), u)
0.00/0.33	     = aa(list(type), bool, typings(shift(type, e, i, t2), as), ts),
0.00/0.33	    inference('demod', [status(thm)], ['9', '10'])).
0.00/0.33	tff(help_pp_2_1_U, axiom, (pp(fTrue))).
0.00/0.33	tff('12', plain, pp(fTrue), inference('cnf', [status(esa)], [help_pp_2_1_U])).
0.00/0.33	tff('13', plain, ![X0 : bool]: (pp(X0) | X0 = fFalse),
0.00/0.33	    inference('sup+', [status(thm)], ['1', '12'])).
0.00/0.33	tff(conj_0, conjecture,
0.00/0.33	  (pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),
0.00/0.33	         aa(type,type,aa(type,fun1(type,type),fun,t1),
0.00/0.33	            foldr(type,type,fun,ts,t)))))).
0.00/0.33	tff(zf_stmt_0, negated_conjecture,
0.00/0.33	  (~
0.00/0.33	    pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),
0.00/0.33	          aa(type,type,aa(type,fun1(type,type),fun,t1),
0.00/0.33	             foldr(type,type,fun,ts,t)))))).
0.00/0.33	tff('14', plain,
0.00/0.33	    ~ pp(
0.00/0.33	        aa(type, bool, aa(dB, fun1(type, bool), typing(e), u), 
0.00/0.33	          aa(type, type, aa(type, fun1(type, type), fun, t1), 
0.00/0.33	            foldr(type, type, fun, ts, t)))),
0.00/0.33	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.33	tff(fact_2_T, axiom,
0.00/0.33	  (t2 =
0.00/0.33	   aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))).
0.00/0.33	tff('15', plain,
0.00/0.33	    t2
0.00/0.33	     = aa(type, type, aa(type, fun1(type, type), fun, t1), 
0.00/0.33	         foldr(type, type, fun, ts, t)),
0.00/0.33	    inference('cnf', [status(esa)], [fact_2_T])).
0.00/0.33	tff('16', plain,
0.00/0.33	    t2
0.00/0.33	     = aa(type, type, 
0.00/0.33	         combc(type, type, type, fun, foldr(type, type, fun, ts, t)), t1),
0.00/0.33	    inference('demod', [status(thm)], ['15', '10'])).
0.00/0.33	tff('17', plain, ~ pp(aa(dB, bool, combc(dB, type, bool, typing(e), t2), u)),
0.00/0.33	    inference('demod', [status(thm)], ['14', '10', '16', '10'])).
0.00/0.33	tff('18', plain,
0.00/0.33	    (~ $true | aa(dB, bool, combc(dB, type, bool, typing(e), t2), u) = fFalse),
0.00/0.33	    inference('sup-', [status(thm)], ['13', '17'])).
0.00/0.33	tff('19', plain,
0.00/0.33	    aa(dB, bool, combc(dB, type, bool, typing(e), t2), u) = fFalse,
0.00/0.33	    inference('simplify', [status(thm)], ['18'])).
0.00/0.33	tff('20', plain,
0.00/0.33	    aa(list(type), bool, typings(shift(type, e, i, t2), as), ts) = fFalse,
0.00/0.33	    inference('sup+', [status(thm)], ['11', '19'])).
0.00/0.33	tff('21', plain, pp(fFalse), inference('demod', [status(thm)], ['0', '20'])).
0.00/0.33	tff('22', plain, ~ $true, inference('sup-', [status(thm)], ['21', '2'])).
0.00/0.33	tff('23', plain, $false, inference('simplify', [status(thm)], ['22'])).
0.00/0.33	
0.00/0.33	% SZS output end Refutation
0.00/0.33	EOF
