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   : n159.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:08:23 CST 2018
2.50/2.73	% done 1119 iterations in 2.530s
2.50/2.73	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
2.50/2.73	% SZS output start Refutation
2.50/2.73	tff(fact_2_Cons_I1_J, axiom,
2.50/2.73	  ((?[X11:type]:
2.50/2.73	      pp(aa(type,bool,
2.50/2.73	            aa(dB,fun(type,bool),
2.50/2.73	               aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
2.50/2.73	                  aa(type,fun(nat,type),
2.50/2.73	                     aa(nat,fun(type,fun(nat,type)),
2.50/2.73	                        aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
2.50/2.73	                           shift(type),e),
2.50/2.73	                        i),
2.50/2.73	                     t)),
2.50/2.73	               b),
2.50/2.73	            X11))) & 
2.50/2.73	   (![E1:fun(nat,type),T3:type,U3:dB,I1:nat]:
2.50/2.73	      (pp(aa(type,bool,
2.50/2.73	             aa(dB,fun(type,bool),
2.50/2.73	                aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
2.50/2.73	                   aa(type,fun(nat,type),
2.50/2.73	                      aa(nat,fun(type,fun(nat,type)),
2.50/2.73	                         aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
2.50/2.73	                            shift(type),E1),
2.50/2.73	                         I1),
2.50/2.73	                      t)),
2.50/2.73	                b),
2.50/2.73	             T3)) =>
2.50/2.73	       (pp(aa(dB,bool,it,U3)) =>
2.50/2.73	        (pp(aa(type,bool,
2.50/2.73	               aa(dB,fun(type,bool),
2.50/2.73	                  aa(fun(nat,type),fun(dB,fun(type,bool)),typing,E1),U3),
2.50/2.73	               t)) =>
2.50/2.73	         pp(aa(dB,bool,it,
2.50/2.73	               aa(nat,dB,
2.50/2.73	                  aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),U3),I1))))))))).
2.50/2.73	tff('0', plain,
2.50/2.73	    pp(
2.50/2.73	      aa(type, bool, 
2.50/2.73	        aa(dB, fun(type, bool), 
2.50/2.73	          aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
2.50/2.73	            aa(type, fun(nat, type), 
2.50/2.73	              aa(nat, fun(type, fun(nat, type)), 
2.50/2.73	                aa(fun(nat, type), fun(nat, fun(type, fun(nat, type))), 
2.50/2.73	                  shift(type), e), i), t)), b), sk_X11)),
2.50/2.73	    inference('cnf', [status(esa)], [fact_2_Cons_I1_J])).
2.50/2.73	tff(conj_0, axiom,
2.50/2.73	  (![U:type]:
2.50/2.73	     (pp(aa(type,bool,
2.50/2.73	            aa(dB,fun(type,bool),
2.50/2.73	               aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
2.50/2.73	                  aa(type,fun(nat,type),
2.50/2.73	                     aa(nat,fun(type,fun(nat,type)),
2.50/2.73	                        aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
2.50/2.73	                           shift(type),e),
2.50/2.73	                        i),
2.50/2.73	                     t)),
2.50/2.73	               b),
2.50/2.73	            U)) =>
2.50/2.73	      thesis))).
2.50/2.73	tff('1', plain,
2.50/2.73	    ![X347 : type]:
2.50/2.73	      (thesis
2.50/2.73	       | ~ pp(
2.50/2.73	             aa(type, bool, 
2.50/2.73	               aa(dB, fun(type, bool), 
2.50/2.73	                 aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
2.50/2.73	                   aa(type, fun(nat, type), 
2.50/2.73	                     aa(nat, fun(type, fun(nat, type)), 
2.50/2.73	                       aa(fun(nat, type), 
2.50/2.73	                         fun(nat, fun(type, fun(nat, type))), shift(type), e), 
2.50/2.73	                       i), t)), b), X347))),
2.50/2.73	    inference('cnf', [status(esa)], [conj_0])).
2.50/2.73	tff(conj_1, conjecture, (thesis)).
2.50/2.73	tff(zf_stmt_0, negated_conjecture, (~thesis)).
2.50/2.73	tff('2', plain, ~ thesis, inference('cnf', [status(esa)], [zf_stmt_0])).
2.50/2.73	tff('3', plain,
2.50/2.73	    ![X347 : type]:
2.50/2.73	      ~ pp(
2.50/2.73	          aa(type, bool, 
2.50/2.73	            aa(dB, fun(type, bool), 
2.50/2.73	              aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
2.50/2.73	                aa(type, fun(nat, type), 
2.50/2.73	                  aa(nat, fun(type, fun(nat, type)), 
2.50/2.73	                    aa(fun(nat, type), fun(nat, fun(type, fun(nat, type))), 
2.50/2.73	                      shift(type), e), i), t)), b), X347)),
2.50/2.73	    inference('clc', [status(thm)], ['1', '2'])).
2.50/2.73	tff('4', plain, ~ $true, inference('sup-', [status(thm)], ['0', '3'])).
2.50/2.73	tff('5', plain, $false, inference('simplify', [status(thm)], ['4'])).
2.50/2.73	
2.50/2.73	% SZS output end Refutation
2.50/2.73	EOF
