0.00/0.01	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : purification_int
0.00/0.01	% Ordering    : kbo
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.20	% Computer   : n155.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 07:08:23 CST 2018
2.35/2.58	% done 1113 iterations in 2.379s
2.35/2.58	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
2.35/2.58	% SZS output start Refutation
2.35/2.58	tff(fact_2_Cons_I1_J, axiom,
2.35/2.58	  ((?[X11:type]:
2.35/2.58	      pp(aa(type,bool,
2.35/2.58	            aa(dB,fun(type,bool),
2.35/2.58	               aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
2.35/2.58	                  aa(type,fun(nat,type),
2.35/2.58	                     aa(nat,fun(type,fun(nat,type)),
2.35/2.58	                        aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
2.35/2.58	                           shift(type),e),
2.35/2.58	                        i),
2.35/2.58	                     t)),
2.35/2.58	               b),
2.35/2.58	            X11))) & 
2.35/2.58	   (![E1:fun(nat,type),T3:type,U3:dB,I1:nat]:
2.35/2.58	      (pp(aa(type,bool,
2.35/2.58	             aa(dB,fun(type,bool),
2.35/2.58	                aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
2.35/2.58	                   aa(type,fun(nat,type),
2.35/2.58	                      aa(nat,fun(type,fun(nat,type)),
2.35/2.58	                         aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
2.35/2.58	                            shift(type),E1),
2.35/2.58	                         I1),
2.35/2.58	                      t)),
2.35/2.58	                b),
2.35/2.58	             T3)) =>
2.35/2.58	       (pp(aa(dB,bool,it,U3)) =>
2.35/2.58	        (pp(aa(type,bool,
2.35/2.58	               aa(dB,fun(type,bool),
2.35/2.58	                  aa(fun(nat,type),fun(dB,fun(type,bool)),typing,E1),U3),
2.35/2.58	               t)) =>
2.35/2.58	         pp(aa(dB,bool,it,
2.35/2.58	               aa(nat,dB,
2.35/2.58	                  aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),U3),I1))))))))).
2.35/2.58	tff('0', plain,
2.35/2.58	    pp(
2.35/2.58	      aa(type, bool, 
2.35/2.58	        aa(dB, fun(type, bool), 
2.35/2.58	          aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
2.35/2.58	            aa(type, fun(nat, type), 
2.35/2.58	              aa(nat, fun(type, fun(nat, type)), 
2.35/2.58	                aa(fun(nat, type), fun(nat, fun(type, fun(nat, type))), 
2.35/2.58	                  shift(type), e), i), t)), b), sk_X11)),
2.35/2.58	    inference('cnf', [status(esa)], [fact_2_Cons_I1_J])).
2.35/2.58	tff(conj_0, axiom,
2.35/2.58	  (![U:type]:
2.35/2.58	     (pp(aa(type,bool,
2.35/2.58	            aa(dB,fun(type,bool),
2.35/2.58	               aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
2.35/2.58	                  aa(type,fun(nat,type),
2.35/2.58	                     aa(nat,fun(type,fun(nat,type)),
2.35/2.58	                        aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
2.35/2.58	                           shift(type),e),
2.35/2.58	                        i),
2.35/2.58	                     t)),
2.35/2.58	               b),
2.35/2.58	            U)) =>
2.35/2.58	      thesis))).
2.35/2.58	tff('1', plain,
2.35/2.58	    ![X347 : type]:
2.35/2.58	      (thesis
2.35/2.58	       | ~ pp(
2.35/2.58	             aa(type, bool, 
2.35/2.58	               aa(dB, fun(type, bool), 
2.35/2.58	                 aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
2.35/2.58	                   aa(type, fun(nat, type), 
2.35/2.58	                     aa(nat, fun(type, fun(nat, type)), 
2.35/2.58	                       aa(fun(nat, type), 
2.35/2.58	                         fun(nat, fun(type, fun(nat, type))), shift(type), e), 
2.35/2.58	                       i), t)), b), X347))),
2.35/2.58	    inference('cnf', [status(esa)], [conj_0])).
2.35/2.58	tff(conj_1, conjecture, (thesis)).
2.35/2.58	tff(zf_stmt_0, negated_conjecture, (~thesis)).
2.35/2.58	tff('2', plain, ~ thesis, inference('cnf', [status(esa)], [zf_stmt_0])).
2.35/2.58	tff('3', plain,
2.35/2.58	    ![X347 : type]:
2.35/2.58	      ~ pp(
2.35/2.58	          aa(type, bool, 
2.35/2.58	            aa(dB, fun(type, bool), 
2.35/2.58	              aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
2.35/2.58	                aa(type, fun(nat, type), 
2.35/2.58	                  aa(nat, fun(type, fun(nat, type)), 
2.35/2.58	                    aa(fun(nat, type), fun(nat, fun(type, fun(nat, type))), 
2.35/2.58	                      shift(type), e), i), t)), b), X347)),
2.35/2.58	    inference('clc', [status(thm)], ['1', '2'])).
2.35/2.58	tff('4', plain, ~ $true, inference('sup-', [status(thm)], ['0', '3'])).
2.35/2.58	tff('5', plain, $false, inference('simplify', [status(thm)], ['4'])).
2.35/2.58	
2.35/2.58	% SZS output end Refutation
2.35/2.59	EOF
