0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_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	  --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   : n105.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 06:54:23 CST 2018
0.00/0.43	% done 224 iterations in 0.234s
0.00/0.43	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.43	% SZS output start Refutation
0.00/0.44	tff(help_pp_2_1_U, axiom, (pp(fTrue))).
0.00/0.44	tff('0', plain, pp(fTrue), inference('cnf', [status(esa)], [help_pp_2_1_U])).
0.00/0.44	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
0.00/0.44	tff('1', plain, ![X410 : bool]: (X410 = fFalse | X410 = fTrue),
0.00/0.44	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
0.00/0.44	tff('2', plain, ![X0 : bool]: (pp(X0) | X0 = fFalse),
0.00/0.44	    inference('sup+', [status(thm)], ['1', '0'])).
0.00/0.44	tff(conj_0, conjecture,
0.00/0.44	  (pp(aa(type,bool,
0.00/0.44	         typing(shift(type,e,i,t1),
0.00/0.44	                foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),
0.00/0.44	         t)))).
0.00/0.44	tff(zf_stmt_0, negated_conjecture,
0.00/0.44	  (~
0.00/0.44	    pp(aa(type,bool,
0.00/0.44	          typing(shift(type,e,i,t1),
0.00/0.44	                 foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),
0.00/0.44	          t)))).
0.00/0.44	tff('3', plain,
0.00/0.44	    ~ pp(
0.00/0.44	        aa(type, bool, 
0.00/0.44	          typing(shift(type, e, i, t1), 
0.00/0.44	            foldl(dB, dB, app, 
0.00/0.44	              aa(dB, dB, aa(dB, fun(dB, dB), app, var(n)), a), as)), t)),
0.00/0.44	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.44	tff(fact_1_True, axiom, (n = i)).
0.00/0.44	tff('4', plain, n = i, inference('cnf', [status(esa)], [fact_1_True])).
0.00/0.44	tff('5', plain,
0.00/0.44	    ~ pp(
0.00/0.44	        aa(type, bool, 
0.00/0.44	          typing(shift(type, e, n, t1), 
0.00/0.44	            foldl(dB, dB, app, 
0.00/0.44	              aa(dB, dB, aa(dB, fun(dB, dB), app, var(n)), a), as)), t)),
0.00/0.44	    inference('demod', [status(thm)], ['3', '4'])).
0.00/0.44	tff('6', plain,
0.00/0.44	    (~ $true
0.00/0.44	     | aa(type, bool, 
0.00/0.44	         typing(shift(type, e, n, t1), 
0.00/0.44	           foldl(dB, dB, app, 
0.00/0.44	             aa(dB, dB, aa(dB, fun(dB, dB), app, var(n)), a), as)), t)
0.00/0.44	        = fFalse),
0.00/0.44	    inference('sup-', [status(thm)], ['2', '5'])).
0.00/0.44	tff('7', plain,
0.00/0.44	    aa(type, bool, 
0.00/0.44	      typing(shift(type, e, n, t1), 
0.00/0.44	        foldl(dB, dB, app, aa(dB, dB, aa(dB, fun(dB, dB), app, var(n)), a), 
0.00/0.44	          as)), t)
0.00/0.44	     = fFalse,
0.00/0.44	    inference('simplify', [status(thm)], ['6'])).
0.00/0.44	tff(fact_46_insert__Nil, axiom,
0.00/0.44	  (![A:$tType,X1:A]:
0.00/0.44	     (insert(A,X1,nil(A)) =
0.00/0.44	      aa(list(A),list(A),aa(A,fun(list(A),list(A)),cons(A),X1),nil(A))))).
0.00/0.44	tff('8', plain,
0.00/0.44	    ![X151 : $tType, X152 : X151]:
0.00/0.44	      insert(X151, X152, nil(X151))
0.00/0.44	       = aa(list(X151), list(X151), 
0.00/0.44	           aa(X151, fun(list(X151), list(X151)), cons(X151), X152), 
0.00/0.44	           nil(X151)),
0.00/0.44	    inference('cnf', [status(esa)], [fact_46_insert__Nil])).
0.00/0.44	tff(fact_22_foldl__Cons, axiom,
0.00/0.44	  (![A:$tType,B:$tType,Xs:list(B),X:B,Aa:A,F:fun(A,fun(B,A))]:
0.00/0.44	     (foldl(A,B,F,Aa,
0.00/0.44	            aa(list(B),list(B),aa(B,fun(list(B),list(B)),cons(B),X),Xs)) =
0.00/0.44	      foldl(A,B,F,aa(B,A,aa(A,fun(B,A),F,Aa),X),Xs)))).
0.00/0.44	tff('9', plain,
0.00/0.44	    ![X48 : $tType, X49 : $tType, X50 : fun(X48, fun(X49, X48)), X51 : X48, 
0.00/0.44	      X52 : X49, X53 : list(X49)]:
0.00/0.44	      foldl(X48, X49, X50, X51, 
0.00/0.44	        aa(list(X49), list(X49), 
0.00/0.44	          aa(X49, fun(list(X49), list(X49)), cons(X49), X52), X53))
0.00/0.44	       = foldl(X48, X49, X50, 
0.00/0.44	           aa(X49, X48, aa(X48, fun(X49, X48), X50, X51), X52), X53),
0.00/0.44	    inference('cnf', [status(esa)], [fact_22_foldl__Cons])).
0.00/0.44	tff('10', plain,
0.00/0.44	    ![X0 : $tType, X1 : X0, X2 : $tType, X3 : X2, X4 : fun(X2, fun(X0, X2))]:
0.00/0.44	      foldl(X2, X0, X4, X3, insert(X0, X1, nil(X0)))
0.00/0.44	       = foldl(X2, X0, X4, aa(X0, X2, aa(X2, fun(X0, X2), X4, X3), X1), 
0.00/0.44	           nil(X0)),
0.00/0.44	    inference('sup+', [status(thm)], ['8', '9'])).
0.00/0.44	tff(fact_35_foldl__Nil, axiom,
0.00/0.44	  (![B:$tType,A:$tType,Aa:A,F:fun(A,fun(B,A))]: (foldl(A,B,F,Aa,nil(B)) = Aa))).
0.00/0.44	tff('11', plain,
0.00/0.44	    ![X106 : $tType, X107 : X106, X108 : $tType, 
0.00/0.44	      X109 : fun(X106, fun(X108, X106))]:
0.00/0.44	      foldl(X106, X108, X109, X107, nil(X108)) = X107,
0.00/0.44	    inference('cnf', [status(esa)], [fact_35_foldl__Nil])).
0.00/0.44	tff('12', plain,
0.00/0.44	    ![X0 : $tType, X1 : X0, X2 : $tType, X3 : X2, X4 : fun(X2, fun(X0, X2))]:
0.00/0.44	      foldl(X2, X0, X4, X3, insert(X0, X1, nil(X0)))
0.00/0.44	       = aa(X0, X2, aa(X2, fun(X0, X2), X4, X3), X1),
0.00/0.44	    inference('demod', [status(thm)], ['10', '11'])).
0.00/0.44	tff('13', plain,
0.00/0.44	    aa(type, bool, 
0.00/0.44	      typing(shift(type, e, n, t1), 
0.00/0.44	        foldl(dB, dB, app, 
0.00/0.44	          foldl(dB, dB, app, var(n), insert(dB, a, nil(dB))), as)), t)
0.00/0.44	     = fFalse,
0.00/0.44	    inference('demod', [status(thm)], ['7', '12'])).
0.00/0.44	tff(fact_2_Cons, axiom,
0.00/0.44	  (rs = aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as))).
0.00/0.44	tff('14', plain,
0.00/0.44	    rs
0.00/0.44	     = aa(list(dB), list(dB), aa(dB, fun(list(dB), list(dB)), cons(dB), a), 
0.00/0.44	         as),
0.00/0.44	    inference('cnf', [status(esa)], [fact_2_Cons])).
0.00/0.44	tff('15', plain,
0.00/0.44	    ![X0 : $tType, X1 : X0, X2 : fun(X0, fun(dB, X0))]:
0.00/0.44	      foldl(X0, dB, X2, X1, rs)
0.00/0.44	       = foldl(X0, dB, X2, aa(dB, X0, aa(X0, fun(dB, X0), X2, X1), a), as),
0.00/0.44	    inference('sup+', [status(thm)], ['14', '9'])).
0.00/0.44	tff('16', plain,
0.00/0.44	    ![X0 : $tType, X1 : X0, X2 : fun(X0, fun(dB, X0))]:
0.00/0.44	      foldl(X0, dB, X2, X1, rs)
0.00/0.44	       = foldl(X0, dB, X2, foldl(X0, dB, X2, X1, insert(dB, a, nil(dB))), as),
0.00/0.44	    inference('sup+', [status(thm)], ['12', '15'])).
0.00/0.44	tff('17', plain,
0.00/0.44	    aa(type, bool, 
0.00/0.44	      typing(shift(type, e, n, t1), foldl(dB, dB, app, var(n), rs)), t)
0.00/0.44	     = fFalse,
0.00/0.44	    inference('demod', [status(thm)], ['13', '16'])).
0.00/0.44	tff(fact_4_nT, axiom,
0.00/0.44	  (pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(n),rs)),t)))).
0.00/0.44	tff('18', plain,
0.00/0.44	    pp(
0.00/0.44	      aa(type, bool, 
0.00/0.44	        typing(shift(type, e, i, t1), foldl(dB, dB, app, var(n), rs)), t)),
0.00/0.44	    inference('cnf', [status(esa)], [fact_4_nT])).
0.00/0.44	tff('19', plain,
0.00/0.44	    pp(
0.00/0.44	      aa(type, bool, 
0.00/0.44	        typing(shift(type, e, n, t1), foldl(dB, dB, app, var(n), rs)), t)),
0.00/0.44	    inference('demod', [status(thm)], ['18', '4'])).
0.00/0.44	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
0.00/0.44	tff('20', plain, ~ pp(fFalse),
0.00/0.44	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
0.00/0.44	tff('21', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
0.00/0.44	    inference('sup-', [status(thm)], ['1', '20'])).
0.00/0.44	tff('22', plain,
0.00/0.44	    (~ $true
0.00/0.44	     | aa(type, bool, 
0.00/0.44	         typing(shift(type, e, n, t1), foldl(dB, dB, app, var(n), rs)), t)
0.00/0.44	        = fTrue),
0.00/0.44	    inference('sup-', [status(thm)], ['19', '21'])).
0.00/0.44	tff('23', plain,
0.00/0.44	    aa(type, bool, 
0.00/0.44	      typing(shift(type, e, n, t1), foldl(dB, dB, app, var(n), rs)), t)
0.00/0.44	     = fTrue,
0.00/0.44	    inference('simplify', [status(thm)], ['22'])).
0.00/0.44	tff('24', plain, fFalse = fTrue,
0.00/0.44	    inference('sup+', [status(thm)], ['17', '23'])).
0.00/0.44	tff('25', plain, pp(fFalse), inference('demod', [status(thm)], ['0', '24'])).
0.00/0.44	tff('26', plain, ~ $true, inference('sup-', [status(thm)], ['25', '20'])).
0.00/0.44	tff('27', plain, $false, inference('simplify', [status(thm)], ['26'])).
0.00/0.44	
0.00/0.44	% SZS output end Refutation
0.00/0.44	EOF
