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.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 ext \
0.00/0.01	  --ho-ext-axiom \
0.00/0.01	  --restrict-hidden-sup-at-vars \
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.19	% Computer   : n031.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:17:23 CST 2018
3.36/3.54	% done 1109 iterations in 3.343s
3.36/3.54	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
3.36/3.54	% SZS output start Refutation
3.36/3.54	tff(fact_2_Cons_I1_J, axiom,
3.36/3.54	  ((?[X11:type]:
3.36/3.54	      pp(aa(type,bool,
3.36/3.54	            aa(dB,fun(type,bool),
3.36/3.54	               aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
3.36/3.54	                  aa(type,fun(nat,type),
3.36/3.54	                     aa(nat,fun(type,fun(nat,type)),
3.36/3.54	                        aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
3.36/3.54	                           shift(type),e),
3.36/3.54	                        i),
3.36/3.54	                     t)),
3.36/3.54	               a),
3.36/3.54	            X11))) & 
3.36/3.54	   (![E1:fun(nat,type),T4:type,U4:dB,I1:nat]:
3.36/3.54	      (pp(aa(type,bool,
3.36/3.54	             aa(dB,fun(type,bool),
3.36/3.54	                aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
3.36/3.54	                   aa(type,fun(nat,type),
3.36/3.54	                      aa(nat,fun(type,fun(nat,type)),
3.36/3.54	                         aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
3.36/3.54	                            shift(type),E1),
3.36/3.54	                         I1),
3.36/3.54	                      t)),
3.36/3.54	                a),
3.36/3.54	             T4)) =>
3.36/3.54	       (pp(aa(dB,bool,it,U4)) =>
3.36/3.54	        (pp(aa(type,bool,
3.36/3.54	               aa(dB,fun(type,bool),
3.36/3.54	                  aa(fun(nat,type),fun(dB,fun(type,bool)),typing,E1),U4),
3.36/3.54	               t)) =>
3.36/3.54	         pp(aa(dB,bool,it,
3.36/3.54	               aa(nat,dB,
3.36/3.54	                  aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),U4),I1))))))))).
3.36/3.54	tff('0', plain,
3.36/3.54	    pp(
3.36/3.54	      aa(type, bool, 
3.36/3.54	        aa(dB, fun(type, bool), 
3.36/3.54	          aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
3.36/3.54	            aa(type, fun(nat, type), 
3.36/3.54	              aa(nat, fun(type, fun(nat, type)), 
3.36/3.54	                aa(fun(nat, type), fun(nat, fun(type, fun(nat, type))), 
3.36/3.54	                  shift(type), e), i), t)), a), sk_X11)),
3.36/3.54	    inference('cnf', [status(esa)], [fact_2_Cons_I1_J])).
3.36/3.54	tff(conj_0, axiom,
3.36/3.54	  (![U:type]:
3.36/3.54	     (pp(aa(type,bool,
3.36/3.54	            aa(dB,fun(type,bool),
3.36/3.54	               aa(fun(nat,type),fun(dB,fun(type,bool)),typing,
3.36/3.54	                  aa(type,fun(nat,type),
3.36/3.54	                     aa(nat,fun(type,fun(nat,type)),
3.36/3.54	                        aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),
3.36/3.54	                           shift(type),e),
3.36/3.54	                        i),
3.36/3.54	                     t)),
3.36/3.54	               a),
3.36/3.54	            U)) =>
3.36/3.54	      thesis))).
3.36/3.54	tff('1', plain,
3.36/3.54	    ![X362 : type]:
3.36/3.54	      (thesis
3.36/3.54	       | ~ pp(
3.36/3.54	             aa(type, bool, 
3.36/3.54	               aa(dB, fun(type, bool), 
3.36/3.54	                 aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
3.36/3.54	                   aa(type, fun(nat, type), 
3.36/3.54	                     aa(nat, fun(type, fun(nat, type)), 
3.36/3.54	                       aa(fun(nat, type), 
3.36/3.54	                         fun(nat, fun(type, fun(nat, type))), shift(type), e), 
3.36/3.54	                       i), t)), a), X362))),
3.36/3.54	    inference('cnf', [status(esa)], [conj_0])).
3.36/3.54	tff(conj_1, conjecture, (thesis)).
3.36/3.54	tff(zf_stmt_0, negated_conjecture, (~thesis)).
3.36/3.54	tff('2', plain, ~ thesis, inference('cnf', [status(esa)], [zf_stmt_0])).
3.36/3.54	tff('3', plain,
3.36/3.54	    ![X362 : type]:
3.36/3.54	      ~ pp(
3.36/3.54	          aa(type, bool, 
3.36/3.54	            aa(dB, fun(type, bool), 
3.36/3.54	              aa(fun(nat, type), fun(dB, fun(type, bool)), typing, 
3.36/3.54	                aa(type, fun(nat, type), 
3.36/3.54	                  aa(nat, fun(type, fun(nat, type)), 
3.36/3.54	                    aa(fun(nat, type), fun(nat, fun(type, fun(nat, type))), 
3.36/3.54	                      shift(type), e), i), t)), a), X362)),
3.36/3.54	    inference('clc', [status(thm)], ['1', '2'])).
3.36/3.54	tff('4', plain, ~ $true, inference('sup-', [status(thm)], ['0', '3'])).
3.36/3.54	tff('5', plain, $false, inference('simplify', [status(thm)], ['4'])).
3.36/3.54	
3.36/3.54	% SZS output end Refutation
3.36/3.55	EOF
