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   : n109.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.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 09:00:23 CST 2018
0.00/0.31	% done 100 iterations in 0.105s
0.00/0.31	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.31	% SZS output start Refutation
0.00/0.31	tff(fact_1__096lbounds_Aas_A_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096, axiom,
0.00/0.31	  ((lbounds(as) = nil(product_prod(int,list(int)))) =>
0.00/0.31	   (?[X4:int]:
0.00/0.31	      (![Xa2:atom]:
0.00/0.31	         (member(atom,Xa2,set(atom,as)) =>
0.00/0.31	          pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,Xa2),
0.00/0.31	                aa(list(int),list(int),
0.00/0.31	                   aa(int,fun(list(int),list(int)),cons(int),X4),xs)))))))).
0.00/0.31	tff('0', plain,
0.00/0.31	    ![X1 : atom]:
0.00/0.31	      (~ member(atom, X1, set(atom, as))
0.00/0.31	       | pp(
0.00/0.31	           aa(list(int), bool, aa(atom, fun(list(int), bool), i_Z, X1), 
0.00/0.31	             aa(list(int), list(int), 
0.00/0.31	               aa(int, fun(list(int), list(int)), cons(int), sk_X41), xs)))
0.00/0.31	       | lbounds(as) != nil(product_prod(int, list(int)))),
0.00/0.31	    inference('cnf', [status(esa)],
0.00/0.31	              [fact_1__096lbounds_Aas_A_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096])).
0.00/0.31	tff(conj_0, conjecture,
0.00/0.31	  (?[X:int]:
0.00/0.31	     (![Xa:atom]:
0.00/0.31	        (member(atom,Xa,set(atom,as)) =>
0.00/0.31	         pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,Xa),
0.00/0.31	               aa(list(int),list(int),
0.00/0.31	                  aa(int,fun(list(int),list(int)),cons(int),X),xs))))))).
0.00/0.31	tff(zf_stmt_0, negated_conjecture,
0.00/0.31	  (~
0.00/0.31	    (?[X:int]:
0.00/0.31	       (![Xa:atom]:
0.00/0.31	          (member(atom,Xa,set(atom,as)) =>
0.00/0.31	           pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,Xa),
0.00/0.31	                 aa(list(int),list(int),
0.00/0.31	                    aa(int,fun(list(int),list(int)),cons(int),X),xs)))))))).
0.00/0.31	tff('1', plain,
0.00/0.31	    ![X367 : int]:
0.00/0.31	      ~ pp(
0.00/0.31	          aa(list(int), bool, 
0.00/0.31	            aa(atom, fun(list(int), bool), i_Z, sk_Xa(X367)), 
0.00/0.31	            aa(list(int), list(int), 
0.00/0.31	              aa(int, fun(list(int), list(int)), cons(int), X367), xs))),
0.00/0.31	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.31	tff('2', plain,
0.00/0.31	    (~ $true
0.00/0.31	     | lbounds(as) != nil(product_prod(int, list(int)))
0.00/0.31	     | ~ member(atom, sk_Xa(sk_X41), set(atom, as))),
0.00/0.31	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.31	tff('3', plain, ![X367 : int]: member(atom, sk_Xa(X367), set(atom, as)),
0.00/0.31	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.31	tff('4', plain,
0.00/0.31	    (~ $true | lbounds(as) != nil(product_prod(int, list(int))) | ~ $true),
0.00/0.31	    inference('demod', [status(thm)], ['2', '3'])).
0.00/0.31	tff('5', plain, lbounds(as) != nil(product_prod(int, list(int))),
0.00/0.31	    inference('simplify', [status(thm)], ['4'])).
0.00/0.31	tff(fact_0__096lbounds_Aas_A_126_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096, axiom,
0.00/0.31	  ((lbounds(as) != nil(product_prod(int,list(int)))) =>
0.00/0.31	   (?[X4:int]:
0.00/0.31	      (![Xa2:atom]:
0.00/0.31	         (member(atom,Xa2,set(atom,as)) =>
0.00/0.31	          pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,Xa2),
0.00/0.31	                aa(list(int),list(int),
0.00/0.31	                   aa(int,fun(list(int),list(int)),cons(int),X4),xs)))))))).
0.00/0.31	tff('6', plain,
0.00/0.31	    ![X0 : atom]:
0.00/0.31	      (~ member(atom, X0, set(atom, as))
0.00/0.31	       | pp(
0.00/0.31	           aa(list(int), bool, aa(atom, fun(list(int), bool), i_Z, X0), 
0.00/0.31	             aa(list(int), list(int), 
0.00/0.31	               aa(int, fun(list(int), list(int)), cons(int), sk_X4), xs)))
0.00/0.31	       | lbounds(as) = nil(product_prod(int, list(int)))),
0.00/0.31	    inference('cnf', [status(esa)],
0.00/0.31	              [fact_0__096lbounds_Aas_A_126_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096])).
0.00/0.31	tff('7', plain,
0.00/0.31	    (~ $true
0.00/0.31	     | lbounds(as) = nil(product_prod(int, list(int)))
0.00/0.31	     | ~ member(atom, sk_Xa(sk_X4), set(atom, as))),
0.00/0.31	    inference('sup-', [status(thm)], ['6', '1'])).
0.00/0.31	tff('8', plain,
0.00/0.31	    (~ $true | lbounds(as) = nil(product_prod(int, list(int))) | ~ $true),
0.00/0.31	    inference('demod', [status(thm)], ['7', '3'])).
0.00/0.31	tff('9', plain, lbounds(as) = nil(product_prod(int, list(int))),
0.00/0.31	    inference('simplify', [status(thm)], ['8'])).
0.00/0.31	tff('10', plain, lbounds(as) != lbounds(as),
0.00/0.31	    inference('demod', [status(thm)], ['5', '9'])).
0.00/0.31	tff('11', plain, $false, inference('simplify', [status(thm)], ['10'])).
0.00/0.31	
0.00/0.31	% SZS output end Refutation
0.00/0.31	EOF
