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_int
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	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
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   : n145.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 10:09:38 CST 2018
0.45/0.64	% done 347 iterations in 0.447s
0.45/0.64	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.45/0.64	% SZS output start Refutation
0.45/0.64	tff(fact_2_Nil_I3_J, axiom,
0.45/0.64	  (pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),a1),
0.45/0.64	         huffma1516701463abet_F(a,nil(huffma1450048681e_tree(a))))))).
0.45/0.64	tff('0', plain,
0.45/0.64	    pp(
0.45/0.64	      aa(fun(a, bool), bool, aa(a, fun(fun(a, bool), bool), member(a), a1), 
0.45/0.64	        huffma1516701463abet_F(a, nil(huffma1450048681e_tree(a))))),
0.45/0.64	    inference('cnf', [status(esa)], [fact_2_Nil_I3_J])).
0.45/0.64	tff(fact_27_alphabet_092_060_094isub_062F_Osimps_I1_J, axiom,
0.45/0.64	  (![B:$tType]:
0.45/0.64	     (huffma1516701463abet_F(B,nil(huffma1450048681e_tree(B))) =
0.45/0.64	      bot_bot(fun(B,bool))))).
0.45/0.64	tff('1', plain,
0.45/0.64	    ![X99 : $tType]:
0.45/0.64	      huffma1516701463abet_F(X99, nil(huffma1450048681e_tree(X99)))
0.45/0.64	       = bot_bot(fun(X99, bool)),
0.45/0.64	    inference('cnf', [status(esa)],
0.45/0.64	              [fact_27_alphabet_092_060_094isub_062F_Osimps_I1_J])).
0.45/0.64	tff('2', plain,
0.45/0.64	    pp(
0.45/0.64	      aa(fun(a, bool), bool, aa(a, fun(fun(a, bool), bool), member(a), a1), 
0.45/0.64	        bot_bot(fun(a, bool)))),
0.45/0.64	    inference('demod', [status(thm)], ['0', '1'])).
0.45/0.64	tff(help_fFalse_1_1_T, axiom, (![P:bool]: ((P = fFalse) | (P = fTrue)))).
0.45/0.64	tff('3', plain, ![X368 : bool]: (X368 = fFalse | X368 = fTrue),
0.45/0.64	    inference('cnf', [status(esa)], [help_fFalse_1_1_T])).
0.45/0.64	tff(help_pp_1_1_U, axiom, (~pp(fFalse))).
0.45/0.64	tff('4', plain, ~ pp(fFalse),
0.45/0.64	    inference('cnf', [status(esa)], [help_pp_1_1_U])).
0.45/0.64	tff('5', plain, ![X0 : bool]: (~ pp(X0) | X0 = fTrue),
0.45/0.64	    inference('sup-', [status(thm)], ['3', '4'])).
0.45/0.64	tff('6', plain,
0.45/0.64	    (~ $true
0.45/0.64	     | aa(fun(a, bool), bool, aa(a, fun(fun(a, bool), bool), member(a), a1), 
0.45/0.64	         bot_bot(fun(a, bool)))
0.45/0.64	        = fTrue),
0.45/0.64	    inference('sup-', [status(thm)], ['2', '5'])).
0.45/0.64	tff('7', plain,
0.45/0.64	    aa(fun(a, bool), bool, aa(a, fun(fun(a, bool), bool), member(a), a1), 
0.45/0.64	      bot_bot(fun(a, bool)))
0.45/0.64	     = fTrue,
0.45/0.64	    inference('simplify', [status(thm)], ['6'])).
0.45/0.64	tff(help_COMBC_1_1_U, axiom,
0.45/0.64	  (![A:$tType,C:$tType,B:$tType,R:A,Q:B,P:fun(A,fun(B,C))]:
0.45/0.64	     (aa(A,C,combc(A,B,C,P,Q),R) = aa(B,C,aa(A,fun(B,C),P,R),Q)))).
0.45/0.64	tff('8', plain,
0.45/0.64	    ![X346 : $tType, X347 : $tType, X348 : $tType, 
0.45/0.64	      X349 : fun(X348, fun(X346, X347)), X350 : X348, X351 : X346]:
0.45/0.64	      aa(X348, X347, combc(X348, X346, X347, X349, X351), X350)
0.45/0.64	       = aa(X346, X347, aa(X348, fun(X346, X347), X349, X350), X351),
0.45/0.64	    inference('cnf', [status(esa)], [help_COMBC_1_1_U])).
0.45/0.64	tff('9', plain,
0.45/0.64	    aa(a, bool, 
0.45/0.64	      combc(a, fun(a, bool), bool, member(a), bot_bot(fun(a, bool))), a1)
0.45/0.64	     = fTrue,
0.45/0.64	    inference('demod', [status(thm)], ['7', '8'])).
0.45/0.64	tff(fact_33_emptyE, axiom,
0.45/0.64	  (![B:$tType,Aa:B]:
0.45/0.64	     (~
0.45/0.64	       pp(aa(fun(B,bool),bool,aa(B,fun(fun(B,bool),bool),member(B),Aa),
0.45/0.64	             bot_bot(fun(B,bool))))))).
0.45/0.64	tff('10', plain,
0.45/0.64	    ![X116 : $tType, X117 : X116]:
0.45/0.64	      ~ pp(
0.45/0.64	          aa(fun(X116, bool), bool, 
0.45/0.64	            aa(X116, fun(fun(X116, bool), bool), member(X116), X117), 
0.45/0.64	            bot_bot(fun(X116, bool)))),
0.45/0.64	    inference('cnf', [status(esa)], [fact_33_emptyE])).
0.45/0.64	tff('11', plain,
0.45/0.64	    ![X116 : $tType, X117 : X116]:
0.45/0.64	      ~ pp(
0.45/0.64	          aa(X116, bool, 
0.45/0.64	            combc(X116, fun(X116, bool), bool, member(X116), 
0.45/0.64	              bot_bot(fun(X116, bool))), X117)),
0.45/0.64	    inference('demod', [status(thm)], ['10', '8'])).
0.45/0.64	tff('12', plain, ~ pp(fTrue), inference('sup-', [status(thm)], ['9', '11'])).
0.45/0.64	tff(help_pp_2_1_U, axiom, (pp(fTrue))).
0.45/0.64	tff('13', plain, pp(fTrue), inference('cnf', [status(esa)], [help_pp_2_1_U])).
0.45/0.64	tff('14', plain, ~ $true, inference('demod', [status(thm)], ['12', '13'])).
0.45/0.64	tff('15', plain, $false, inference('simplify', [status(thm)], ['14'])).
0.45/0.64	
0.45/0.64	% SZS output end Refutation
0.45/0.65	EOF
