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    : fo
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-ho \
0.00/0.00	  --no-avatar \
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	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n185.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:21:23 CST 2018
3.71/3.95	% done 1254 iterations in 3.750s
3.71/3.95	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
3.71/3.95	% SZS output start Refutation
3.71/3.95	tff(fact_5__096e_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_H_096, axiom,
3.71/3.95	  (typing(shift(type,e,i,t1),a,t2))).
3.71/3.95	tff('0', plain, typing(shift(type, e, i, t1), a, t2),
3.71/3.95	    inference('cnf', [status(esa)],
3.71/3.95	              [fact_5__096e_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_H_096])).
3.71/3.95	tff(fact_12_SI2, axiom,
3.71/3.95	  (![Ub1:dB,T_b:type,Ib:nat,Eb:fun(nat,type)]:
3.71/3.95	     (typing(shift(type,Eb,Ib,t1),a,T_b) =>
3.71/3.95	      (pp(aa(dB,bool,it,Ub1)) =>
3.71/3.95	       (typing(Eb,Ub1,t1) =>
3.71/3.95	        pp(aa(dB,bool,it,
3.71/3.95	              aa(nat,dB,
3.71/3.95	                 aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),Ub1),Ib)))))))).
3.71/3.95	tff('1', plain,
3.71/3.95	    ![X19 : dB, X20 : nat, X21 : fun(nat, type), X22 : type]:
3.71/3.95	      (~ pp(aa(dB, bool, it, X19))
3.71/3.95	       | pp(
3.71/3.95	           aa(dB, bool, it, 
3.71/3.95	             aa(nat, dB, 
3.71/3.95	               aa(dB, fun(nat, dB), aa(dB, fun(dB, fun(nat, dB)), subst, a), 
3.71/3.95	                 X19), X20)))
3.71/3.95	       | ~ typing(shift(type, X21, X20, t1), a, X22)
3.71/3.95	       | ~ typing(X21, X19, t1)),
3.71/3.95	    inference('cnf', [status(esa)], [fact_12_SI2])).
3.71/3.95	tff(help_COMBC_1_1_U, axiom,
3.71/3.95	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun(A,fun(B,C))]:
3.71/3.95	     (aa(A,C,combc(A,B,C,P,Q),R) = aa(B,C,aa(A,fun(B,C),P,R),Q)))).
3.71/3.95	tff('2', plain,
3.71/3.95	    ![X284 : $tType, X285 : $tType, X286 : $tType, 
3.71/3.95	      X287 : fun(X286, fun(X284, X285)), X288 : X286, X289 : X284]:
3.71/3.95	      aa(X286, X285, combc(X286, X284, X285, X287, X289), X288)
3.71/3.95	       = aa(X284, X285, aa(X286, fun(X284, X285), X287, X288), X289),
3.71/3.95	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
3.71/3.95	tff('3', plain,
3.71/3.95	    ![X19 : dB, X20 : nat, X21 : fun(nat, type), X22 : type]:
3.71/3.95	      (~ pp(aa(dB, bool, it, X19))
3.71/3.95	       | pp(
3.71/3.95	           aa(dB, bool, it, 
3.71/3.95	             aa(dB, dB, 
3.71/3.95	               combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X19), 
3.71/3.95	                 X20), a)))
3.71/3.95	       | ~ typing(shift(type, X21, X20, t1), a, X22)
3.71/3.95	       | ~ typing(X21, X19, t1)),
3.71/3.95	    inference('demod', [status(thm)], ['1', '2', '2'])).
3.71/3.95	tff('4', plain,
3.71/3.95	    ![X0 : dB]:
3.71/3.95	      (~ $true
3.71/3.95	       | ~ typing(e, X0, t1)
3.71/3.95	       | pp(
3.71/3.95	           aa(dB, bool, it, 
3.71/3.95	             aa(dB, dB, 
3.71/3.95	               combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X0), i), 
3.71/3.95	               a)))
3.71/3.95	       | ~ pp(aa(dB, bool, it, X0))),
3.71/3.95	    inference('sup-', [status(thm)], ['0', '3'])).
3.71/3.95	tff('5', plain,
3.71/3.95	    ![X0 : dB]:
3.71/3.95	      (~ pp(aa(dB, bool, it, X0))
3.71/3.95	       | pp(
3.71/3.95	           aa(dB, bool, it, 
3.71/3.95	             aa(dB, dB, 
3.71/3.95	               combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, X0), i), 
3.71/3.95	               a)))
3.71/3.95	       | ~ typing(e, X0, t1)),
3.71/3.95	    inference('simplify', [status(thm)], ['4'])).
3.71/3.95	tff(conj_0, conjecture,
3.71/3.95	  (pp(aa(dB,bool,it,
3.71/3.95	         aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))))).
3.71/3.95	tff(zf_stmt_0, negated_conjecture,
3.71/3.95	  (~
3.71/3.95	    pp(aa(dB,bool,it,
3.71/3.95	          aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))))).
3.71/3.95	tff('6', plain,
3.71/3.95	    ~ pp(
3.71/3.95	        aa(dB, bool, it, 
3.71/3.95	          aa(nat, dB, 
3.71/3.95	            aa(dB, fun(nat, dB), aa(dB, fun(dB, fun(nat, dB)), subst, a), u), 
3.71/3.95	            i))),
3.71/3.95	    inference('cnf', [status(esa)], [zf_stmt_0])).
3.71/3.95	tff('7', plain,
3.71/3.95	    ~ pp(
3.71/3.95	        aa(dB, bool, it, 
3.71/3.95	          aa(dB, dB, 
3.71/3.95	            combc(dB, nat, dB, combc(dB, dB, fun(nat, dB), subst, u), i), a))),
3.71/3.95	    inference('demod', [status(thm)], ['6', '2', '2'])).
3.71/3.95	tff('8', plain, (~ $true | ~ typing(e, u, t1) | ~ pp(aa(dB, bool, it, u))),
3.71/3.95	    inference('sup-', [status(thm)], ['5', '7'])).
3.71/3.95	tff(fact_3_uT, axiom, (typing(e,u,t1))).
3.71/3.95	tff('9', plain, typing(e, u, t1),
3.71/3.95	    inference('cnf', [status(esa)], [fact_3_uT])).
3.71/3.95	tff(fact_2_uIT, axiom, (pp(aa(dB,bool,it,u)))).
3.71/3.95	tff('10', plain, pp(aa(dB, bool, it, u)),
3.71/3.95	    inference('cnf', [status(esa)], [fact_2_uIT])).
3.71/3.95	tff('11', plain, (~ $true | ~ $true | ~ $true),
3.71/3.95	    inference('demod', [status(thm)], ['8', '9', '10'])).
3.71/3.95	tff('12', plain, $false, inference('simplify', [status(thm)], ['11'])).
3.71/3.95	
3.71/3.95	% SZS output end Refutation
3.71/3.96	EOF
