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    : purification_ext
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 ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
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   : n133.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 13:34:38 CST 2018
1.25/1.47	% done 877 iterations in 1.260s
1.25/1.47	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
1.25/1.47	% SZS output start Refutation
1.25/1.47	tff(fact_50_calculation, axiom,
1.25/1.47	  (plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),
1.25/1.47	             power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) =
1.25/1.47	   zero_zero(int))).
1.25/1.47	tff('0', plain,
1.25/1.47	    plus_plus(int, 
1.25/1.47	      power_power(int, v, number_number_of(nat, bit0(bit1(pls)))), 
1.25/1.47	      power_power(int, w, number_number_of(nat, bit0(bit1(pls)))))
1.25/1.47	     = zero_zero(int),
1.25/1.47	    inference('cnf', [status(esa)], [fact_50_calculation])).
1.25/1.47	tff(fact_37_Pls__def, axiom, (pls = zero_zero(int))).
1.25/1.47	tff('1', plain, pls = zero_zero(int),
1.25/1.47	    inference('cnf', [status(esa)], [fact_37_Pls__def])).
1.25/1.47	tff(fact_74_Bit0__def, axiom, (![K1:int]: (bit0(K1) = plus_plus(int,K1,K1)))).
1.25/1.47	tff('2', plain, ![X148 : int]: bit0(X148) = plus_plus(int, X148, X148),
1.25/1.47	    inference('cnf', [status(esa)], [fact_74_Bit0__def])).
1.25/1.47	tff('3', plain,
1.25/1.47	    plus_plus(int, 
1.25/1.47	      power_power(int, v, 
1.25/1.47	        number_number_of(nat, 
1.25/1.47	          plus_plus(int, bit1(zero_zero(int)), bit1(zero_zero(int))))), 
1.25/1.47	      power_power(int, w, 
1.25/1.47	        number_number_of(nat, 
1.25/1.47	          plus_plus(int, bit1(zero_zero(int)), bit1(zero_zero(int))))))
1.25/1.47	     = zero_zero(int),
1.25/1.47	    inference('demod', [status(thm)], ['0', '1', '2', '1', '2'])).
1.25/1.47	tff(fact_83_sum__power2__eq__zero__iff, axiom,
1.25/1.47	  (![A:$tType]:
1.25/1.47	     (linordered_idom(A) =>
1.25/1.47	      (![Ya:A,Xa:A]:
1.25/1.47	         ((plus_plus(A,
1.25/1.47	                     power_power(A,Xa,number_number_of(nat,bit0(bit1(pls)))),
1.25/1.47	                     power_power(A,Ya,number_number_of(nat,bit0(bit1(pls))))) =
1.25/1.47	           zero_zero(A)) <=>
1.25/1.47	          ((Ya = zero_zero(A)) & (Xa = zero_zero(A)))))))).
1.25/1.47	tff('4', plain,
1.25/1.47	    ![X165 : $tType, X166 : X165, X168 : X165]:
1.25/1.47	      (plus_plus(X165, 
1.25/1.47	         power_power(X165, X168, number_number_of(nat, bit0(bit1(pls)))), 
1.25/1.47	         power_power(X165, X166, number_number_of(nat, bit0(bit1(pls)))))
1.25/1.47	        != zero_zero(X165)
1.25/1.47	       | X168 = zero_zero(X165)
1.25/1.47	       | ~ linordered_idom(X165)),
1.25/1.47	    inference('cnf', [status(esa)], [fact_83_sum__power2__eq__zero__iff])).
1.25/1.47	tff('5', plain,
1.25/1.47	    ![X165 : $tType, X166 : X165, X168 : X165]:
1.25/1.47	      (plus_plus(X165, 
1.25/1.47	         power_power(X165, X168, 
1.25/1.47	           number_number_of(nat, 
1.25/1.47	             plus_plus(int, bit1(zero_zero(int)), bit1(zero_zero(int))))), 
1.25/1.47	         power_power(X165, X166, 
1.25/1.47	           number_number_of(nat, 
1.25/1.47	             plus_plus(int, bit1(zero_zero(int)), bit1(zero_zero(int))))))
1.25/1.47	        != zero_zero(X165)
1.25/1.47	       | X168 = zero_zero(X165)
1.25/1.47	       | ~ linordered_idom(X165)),
1.25/1.47	    inference('demod', [status(thm)], ['4', '1', '2', '1', '2'])).
1.25/1.47	tff('6', plain,
1.25/1.47	    (zero_zero(int) != zero_zero(int)
1.25/1.47	     | ~ linordered_idom(int)
1.25/1.47	     | v = zero_zero(int)),
1.25/1.47	    inference('sup-', [status(thm)], ['3', '5'])).
1.25/1.47	tff(arity_Int_Oint___Rings_Olinordered__idom, axiom, (linordered_idom(int))).
1.25/1.47	tff('7', plain, linordered_idom(int),
1.25/1.47	    inference('cnf', [status(esa)],
1.25/1.47	              [arity_Int_Oint___Rings_Olinordered__idom])).
1.25/1.47	tff('8', plain,
1.25/1.47	    (zero_zero(int) != zero_zero(int) | ~ $true | v = zero_zero(int)),
1.25/1.47	    inference('demod', [status(thm)], ['6', '7'])).
1.25/1.47	tff('9', plain, v = zero_zero(int),
1.25/1.47	    inference('simplify', [status(thm)], ['8'])).
1.25/1.47	tff(fact_0__096v_A_126_061_A0_096, axiom, (v != zero_zero(int))).
1.25/1.47	tff('10', plain, v != zero_zero(int),
1.25/1.47	    inference('cnf', [status(esa)], [fact_0__096v_A_126_061_A0_096])).
1.25/1.47	tff('11', plain, $false,
1.25/1.47	    inference('simplify_reflect-', [status(thm)], ['9', '10'])).
1.25/1.47	
1.25/1.47	% SZS output end Refutation
1.25/1.47	EOF
