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_int
0.00/0.00	% Ordering    : rpo6
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	  --ho-purify int \
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.20	% Computer   : n071.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:50:23 CST 2018
0.00/0.25	% done 65 iterations in 0.047s
0.00/0.25	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.25	% SZS output start Refutation
0.00/0.25	tff(fact_1__096_126_AQuadRes_A_I4_A_K_Am_A_L_A1_J_A_N1_A_061_061_062_ALegendre_A_N1_A_I4_A_K_Am_A_L_A1_J_A_126_061_A1_096, axiom,
0.00/0.25	  ((~
0.00/0.25	     quadRes(plus_plus(int,
0.00/0.25	                       times_times(int,
0.00/0.25	                                   number_number_of(int,bit0(bit0(bit1(pls)))),
0.00/0.25	                                   m),
0.00/0.25	                       one_one(int)),
0.00/0.25	             number_number_of(int,min))) =>
0.00/0.25	   (legendre(number_number_of(int,min),
0.00/0.25	             plus_plus(int,
0.00/0.25	                       times_times(int,
0.00/0.25	                                   number_number_of(int,bit0(bit0(bit1(pls)))),
0.00/0.25	                                   m),
0.00/0.25	                       one_one(int))) !=
0.00/0.25	    one_one(int)))).
0.00/0.25	tff('0', plain,
0.00/0.25	    (legendre(number_number_of(int, min), 
0.00/0.25	       plus_plus(int, 
0.00/0.25	         times_times(int, number_number_of(int, bit0(bit0(bit1(pls)))), m), 
0.00/0.25	         one_one(int)))
0.00/0.25	      != one_one(int)
0.00/0.25	     | quadRes(
0.00/0.25	         plus_plus(int, 
0.00/0.25	           times_times(int, number_number_of(int, bit0(bit0(bit1(pls)))), m), 
0.00/0.25	           one_one(int)), number_number_of(int, min))),
0.00/0.25	    inference('cnf', [status(esa)],
0.00/0.25	              [fact_1__096_126_AQuadRes_A_I4_A_K_Am_A_L_A1_J_A_N1_A_061_061_062_ALegendre_A_N1_A_I4_A_K_Am_A_L_A1_J_A_126_061_A1_096])).
0.00/0.25	tff(fact_0__096Legendre_A_N1_A_I4_A_K_Am_A_L_A1_J_A_061_A1_096, axiom,
0.00/0.25	  (legendre(number_number_of(int,min),
0.00/0.25	            plus_plus(int,
0.00/0.25	                      times_times(int,
0.00/0.25	                                  number_number_of(int,bit0(bit0(bit1(pls)))),
0.00/0.25	                                  m),
0.00/0.25	                      one_one(int))) =
0.00/0.25	   one_one(int))).
0.00/0.25	tff('1', plain,
0.00/0.25	    legendre(number_number_of(int, min), 
0.00/0.25	      plus_plus(int, 
0.00/0.25	        times_times(int, number_number_of(int, bit0(bit0(bit1(pls)))), m), 
0.00/0.25	        one_one(int)))
0.00/0.25	     = one_one(int),
0.00/0.25	    inference('cnf', [status(esa)],
0.00/0.25	              [fact_0__096Legendre_A_N1_A_I4_A_K_Am_A_L_A1_J_A_061_A1_096])).
0.00/0.25	tff('2', plain,
0.00/0.25	    (one_one(int) != one_one(int)
0.00/0.25	     | quadRes(
0.00/0.25	         plus_plus(int, 
0.00/0.25	           times_times(int, number_number_of(int, bit0(bit0(bit1(pls)))), m), 
0.00/0.25	           one_one(int)), number_number_of(int, min))),
0.00/0.25	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.25	tff('3', plain,
0.00/0.25	    quadRes(
0.00/0.25	      plus_plus(int, 
0.00/0.25	        times_times(int, number_number_of(int, bit0(bit0(bit1(pls)))), m), 
0.00/0.25	        one_one(int)), number_number_of(int, min)),
0.00/0.25	    inference('simplify', [status(thm)], ['2'])).
0.00/0.25	tff(fact_37_number__of__is__id, axiom,
0.00/0.25	  (![K:int]: (number_number_of(int,K) = K))).
0.00/0.25	tff('4', plain, ![X69 : int]: number_number_of(int, X69) = X69,
0.00/0.25	    inference('cnf', [status(esa)], [fact_37_number__of__is__id])).
0.00/0.25	tff('5', plain,
0.00/0.25	    quadRes(
0.00/0.25	      plus_plus(int, times_times(int, bit0(bit0(bit1(pls))), m), 
0.00/0.25	        one_one(int)), min),
0.00/0.25	    inference('demod', [status(thm)], ['3', '4', '4'])).
0.00/0.25	tff(fact_50_Bit1__def, axiom,
0.00/0.25	  (![K:int]: (bit1(K) = plus_plus(int,plus_plus(int,one_one(int),K),K)))).
0.00/0.25	tff('6', plain,
0.00/0.25	    ![X94 : int]:
0.00/0.25	      bit1(X94) = plus_plus(int, plus_plus(int, one_one(int), X94), X94),
0.00/0.25	    inference('cnf', [status(esa)], [fact_50_Bit1__def])).
0.00/0.25	tff(fact_38_add__Pls__right, axiom, (![K:int]: (plus_plus(int,K,pls) = K))).
0.00/0.25	tff('7', plain, ![X70 : int]: plus_plus(int, X70, pls) = X70,
0.00/0.25	    inference('cnf', [status(esa)], [fact_38_add__Pls__right])).
0.00/0.25	tff(fact_40_Bit0__def, axiom, (![K:int]: (bit0(K) = plus_plus(int,K,K)))).
0.00/0.25	tff('8', plain, ![X72 : int]: bit0(X72) = plus_plus(int, X72, X72),
0.00/0.25	    inference('cnf', [status(esa)], [fact_40_Bit0__def])).
0.00/0.25	tff('9', plain,
0.00/0.25	    quadRes(
0.00/0.25	      plus_plus(int, 
0.00/0.25	        times_times(int, 
0.00/0.25	          plus_plus(int, plus_plus(int, one_one(int), one_one(int)), 
0.00/0.25	            plus_plus(int, one_one(int), one_one(int))), m), one_one(int)), 
0.00/0.25	      min),
0.00/0.25	    inference('demod', [status(thm)], ['5', '6', '7', '7', '8', '8'])).
0.00/0.25	tff(conj_0, conjecture,
0.00/0.25	  (quadRes(plus_plus(int,
0.00/0.25	                     times_times(int,
0.00/0.25	                                 number_number_of(int,bit0(bit0(bit1(pls)))),
0.00/0.25	                                 m),
0.00/0.25	                     one_one(int)),
0.00/0.25	           number_number_of(int,min)))).
0.00/0.25	tff(zf_stmt_0, negated_conjecture,
0.00/0.25	  (~
0.00/0.25	    quadRes(plus_plus(int,
0.00/0.25	                      times_times(int,
0.00/0.25	                                  number_number_of(int,bit0(bit0(bit1(pls)))),
0.00/0.25	                                  m),
0.00/0.25	                      one_one(int)),
0.00/0.25	            number_number_of(int,min)))).
0.00/0.25	tff('10', plain,
0.00/0.25	    ~ quadRes(
0.00/0.25	        plus_plus(int, 
0.00/0.25	          times_times(int, number_number_of(int, bit0(bit0(bit1(pls)))), m), 
0.00/0.25	          one_one(int)), number_number_of(int, min)),
0.00/0.25	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.25	tff('11', plain,
0.00/0.25	    ~ quadRes(
0.00/0.25	        plus_plus(int, 
0.00/0.25	          times_times(int, 
0.00/0.25	            plus_plus(int, plus_plus(int, one_one(int), one_one(int)), 
0.00/0.25	              plus_plus(int, one_one(int), one_one(int))), m), one_one(int)), 
0.00/0.25	        min),
0.00/0.25	    inference('demod', [status(thm)],
0.00/0.25	              ['10', '6', '7', '7', '8', '8', '4', '4'])).
0.00/0.25	tff('12', plain, ~ $true, inference('sup-', [status(thm)], ['9', '11'])).
0.00/0.25	tff('13', plain, $false, inference('simplify', [status(thm)], ['12'])).
0.00/0.25	
0.00/0.25	% SZS output end Refutation
0.00/0.25	EOF
