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.19	% Computer   : n113.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:27:53 CST 2018
1.30/1.50	% done 505 iterations in 1.302s
1.30/1.50	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
1.30/1.50	% SZS output start Refutation
1.30/1.50	tff(fact_10_apps__preserves__beta, axiom,
1.30/1.50	  (![Ss1:list(dB),S:dB,Ra:dB]:
1.30/1.50	     (pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,Ra),S)) =>
1.30/1.50	      pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,Ra,Ss1)),
1.30/1.50	            foldl(dB,dB,app,S,Ss1)))))).
1.30/1.50	tff('0', plain,
1.30/1.50	    ![X23 : dB, X24 : list(dB), X25 : dB]:
1.30/1.50	      (pp(
1.30/1.50	         aa(dB, bool, 
1.30/1.50	           aa(dB, fun(dB, bool), beta, foldl(dB, dB, app, X23, X24)), 
1.30/1.50	           foldl(dB, dB, app, X25, X24)))
1.30/1.50	       | ~ pp(aa(dB, bool, aa(dB, fun(dB, bool), beta, X23), X25))),
1.30/1.50	    inference('cnf', [status(esa)], [fact_10_apps__preserves__beta])).
1.30/1.50	tff(help_COMBC_1_1_U, axiom,
1.30/1.50	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun(A,fun(B,C))]:
1.30/1.50	     (aa(A,C,combc(A,B,C,P,Q),R) = aa(B,C,aa(A,fun(B,C),P,R),Q)))).
1.30/1.50	tff('1', plain,
1.30/1.50	    ![X361 : $tType, X362 : $tType, X363 : $tType, 
1.30/1.50	      X364 : fun(X363, fun(X361, X362)), X365 : X363, X366 : X361]:
1.30/1.50	      aa(X363, X362, combc(X363, X361, X362, X364, X366), X365)
1.30/1.50	       = aa(X361, X362, aa(X363, fun(X361, X362), X364, X365), X366),
1.30/1.50	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
1.30/1.50	tff('2', plain,
1.30/1.50	    ![X23 : dB, X24 : list(dB), X25 : dB]:
1.30/1.50	      (pp(
1.30/1.50	         aa(dB, bool, 
1.30/1.50	           combc(dB, dB, bool, beta, foldl(dB, dB, app, X25, X24)), 
1.30/1.50	           foldl(dB, dB, app, X23, X24)))
1.30/1.50	       | ~ pp(aa(dB, bool, combc(dB, dB, bool, beta, X25), X23))),
1.30/1.50	    inference('demod', [status(thm)], ['0', '1', '1'])).
1.30/1.50	tff(conj_0, conjecture,
1.30/1.50	  (pp(aa(dB,bool,
1.30/1.50	         aa(dB,fun(dB,bool),beta,
1.30/1.50	            foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),
1.30/1.50	         foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))))).
1.30/1.50	tff(zf_stmt_0, negated_conjecture,
1.30/1.50	  (~
1.30/1.50	    pp(aa(dB,bool,
1.30/1.50	          aa(dB,fun(dB,bool),beta,
1.30/1.50	             foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),
1.30/1.50	          foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))))).
1.30/1.50	tff('3', plain,
1.30/1.50	    ~ pp(
1.30/1.50	        aa(dB, bool, 
1.30/1.50	          aa(dB, fun(dB, bool), beta, 
1.30/1.50	            foldl(dB, dB, app, 
1.30/1.50	              aa(dB, dB, aa(dB, fun(dB, dB), app, abs(r)), a), as)), 
1.30/1.50	          foldl(dB, dB, app, subst(r, a, zero_zero(nat)), as))),
1.30/1.50	    inference('cnf', [status(esa)], [zf_stmt_0])).
1.30/1.50	tff('4', plain,
1.30/1.50	    ~ pp(
1.30/1.50	        aa(dB, bool, 
1.30/1.50	          combc(dB, dB, bool, beta, 
1.30/1.50	            foldl(dB, dB, app, subst(r, a, zero_zero(nat)), as)), 
1.30/1.50	          foldl(dB, dB, app, aa(dB, dB, combc(dB, dB, dB, app, a), abs(r)), 
1.30/1.50	            as))),
1.30/1.50	    inference('demod', [status(thm)], ['3', '1', '1'])).
1.30/1.50	tff('5', plain,
1.30/1.50	    (~ $true
1.30/1.50	     | ~ pp(
1.30/1.50	           aa(dB, bool, 
1.30/1.50	             combc(dB, dB, bool, beta, subst(r, a, zero_zero(nat))), 
1.30/1.50	             aa(dB, dB, combc(dB, dB, dB, app, a), abs(r))))),
1.30/1.50	    inference('sup-', [status(thm)], ['2', '4'])).
1.30/1.50	tff(fact_3_beta, axiom,
1.30/1.50	  (![T:dB,S2:dB]:
1.30/1.50	     pp(aa(dB,bool,
1.30/1.50	           aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(S2)),T)),
1.30/1.50	           subst(S2,T,zero_zero(nat)))))).
1.30/1.50	tff('6', plain,
1.30/1.50	    ![X0 : dB, X1 : dB]:
1.30/1.50	      pp(
1.30/1.50	        aa(dB, bool, 
1.30/1.50	          aa(dB, fun(dB, bool), beta, 
1.30/1.50	            aa(dB, dB, aa(dB, fun(dB, dB), app, abs(X0)), X1)), 
1.30/1.50	          subst(X0, X1, zero_zero(nat)))),
1.30/1.50	    inference('cnf', [status(esa)], [fact_3_beta])).
1.30/1.50	tff('7', plain,
1.30/1.50	    ![X0 : dB, X1 : dB]:
1.30/1.50	      pp(
1.30/1.50	        aa(dB, bool, 
1.30/1.50	          combc(dB, dB, bool, beta, subst(X0, X1, zero_zero(nat))), 
1.30/1.50	          aa(dB, dB, combc(dB, dB, dB, app, X1), abs(X0)))),
1.30/1.50	    inference('demod', [status(thm)], ['6', '1', '1'])).
1.30/1.50	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
1.30/1.50	tff('8', plain, ![X373 : bool]: (X373 = fFalse | X373 = fTrue),
1.30/1.50	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
1.30/1.50	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
1.30/1.50	tff('9', plain, ~ pp(fFalse),
1.30/1.50	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
1.30/1.50	tff('10', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
1.30/1.50	    inference('sup-', [status(thm)], ['8', '9'])).
1.30/1.50	tff('11', plain,
1.30/1.50	    ![X0 : dB, X1 : dB]:
1.30/1.50	      (~ $true
1.30/1.50	       | aa(dB, bool, 
1.30/1.50	           combc(dB, dB, bool, beta, subst(X0, X1, zero_zero(nat))), 
1.30/1.50	           aa(dB, dB, combc(dB, dB, dB, app, X1), abs(X0)))
1.30/1.50	          = fTrue),
1.30/1.50	    inference('sup-', [status(thm)], ['7', '10'])).
1.30/1.50	tff('12', plain,
1.30/1.50	    ![X0 : dB, X1 : dB]:
1.30/1.50	      aa(dB, bool, combc(dB, dB, bool, beta, subst(X0, X1, zero_zero(nat))), 
1.30/1.50	        aa(dB, dB, combc(dB, dB, dB, app, X1), abs(X0)))
1.30/1.50	       = fTrue,
1.30/1.50	    inference('simplify', [status(thm)], ['11'])).
1.30/1.50	tff(help_pp_2_1_U, axiom, (pp(fTrue))).
1.30/1.50	tff('13', plain, pp(fTrue), inference('cnf', [status(esa)], [help_pp_2_1_U])).
1.30/1.50	tff('14', plain, (~ $true | ~ $true),
1.30/1.50	    inference('demod', [status(thm)], ['5', '12', '13'])).
1.30/1.50	tff('15', plain, $false, inference('simplify', [status(thm)], ['14'])).
1.30/1.50	
1.30/1.50	% SZS output end Refutation
1.30/1.50	EOF
