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_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	  --sup-at-vars \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-ext-axiom \
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   : n071.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 14:29:40 CST 2018
1.73/1.96	% done 1174 iterations in 1.756s
1.73/1.96	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
1.73/1.96	% SZS output start Refutation
1.73/1.96	tff(conj_0, conjecture,
1.73/1.96	  (power_power(complex,
1.73/1.96	               fFT_Mirabelle_root(times_times(nat,
1.73/1.96	                                              number_number_of(nat,
1.73/1.96	                                                               bit0(bit1(pls))),
1.73/1.96	                                              m)),
1.73/1.96	               times_times(nat,i,
1.73/1.96	                           times_times(nat,
1.73/1.96	                                       number_number_of(nat,bit0(bit1(pls))),
1.73/1.96	                                       j))) =
1.73/1.96	   power_power(complex,
1.73/1.96	               fFT_Mirabelle_root(times_times(nat,
1.73/1.96	                                              number_number_of(nat,
1.73/1.96	                                                               bit0(bit1(pls))),
1.73/1.96	                                              m)),
1.73/1.96	               times_times(nat,number_number_of(nat,bit0(bit1(pls))),
1.73/1.96	                           times_times(nat,i,j))))).
1.73/1.96	tff(zf_stmt_0, negated_conjecture,
1.73/1.96	  (power_power(complex,
1.73/1.96	               fFT_Mirabelle_root(times_times(nat,
1.73/1.96	                                              number_number_of(nat,
1.73/1.96	                                                               bit0(bit1(pls))),
1.73/1.96	                                              m)),
1.73/1.96	               times_times(nat,i,
1.73/1.96	                           times_times(nat,
1.73/1.96	                                       number_number_of(nat,bit0(bit1(pls))),
1.73/1.96	                                       j))) !=
1.73/1.96	   power_power(complex,
1.73/1.96	               fFT_Mirabelle_root(times_times(nat,
1.73/1.96	                                              number_number_of(nat,
1.73/1.96	                                                               bit0(bit1(pls))),
1.73/1.96	                                              m)),
1.73/1.96	               times_times(nat,number_number_of(nat,bit0(bit1(pls))),
1.73/1.96	                           times_times(nat,i,j))))).
1.73/1.96	tff('0', plain,
1.73/1.96	    power_power(complex, 
1.73/1.96	      fFT_Mirabelle_root(
1.73/1.96	        times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.73/1.96	      times_times(nat, i, 
1.73/1.96	        times_times(nat, number_number_of(nat, bit0(bit1(pls))), j)))
1.73/1.96	     != power_power(complex, 
1.73/1.96	          fFT_Mirabelle_root(
1.73/1.96	            times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.73/1.96	          times_times(nat, number_number_of(nat, bit0(bit1(pls))), 
1.73/1.96	            times_times(nat, i, j))),
1.73/1.96	    inference('cnf', [status(esa)], [zf_stmt_0])).
1.73/1.96	tff(arity_Int_Oint___Rings_Ocomm__semiring__1, axiom, (comm_semiring_1(int))).
1.73/1.96	tff('1', plain, comm_semiring_1(int),
1.73/1.96	    inference('cnf', [status(esa)],
1.73/1.96	              [arity_Int_Oint___Rings_Ocomm__semiring__1])).
1.73/1.96	tff(fact_27_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J, axiom,
1.73/1.96	  (![A:$tType]:
1.73/1.96	     (comm_semiring_1(A) =>
1.73/1.96	      (![B:A,A1:A]: (times_times(A,A1,B) = times_times(A,B,A1)))))).
1.73/1.96	tff('2', plain,
1.73/1.96	    ![X76 : $tType, X77 : X76, X78 : X76]:
1.73/1.96	      (times_times(X76, X78, X77) = times_times(X76, X77, X78)
1.73/1.96	       | ~ comm_semiring_1(X76)),
1.73/1.96	    inference('cnf', [status(esa)],
1.73/1.96	              [fact_27_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J])).
1.73/1.96	tff('3', plain,
1.73/1.96	    ![X0 : int, X1 : int]:
1.73/1.96	      (~ $true | times_times(int, X1, X0) = times_times(int, X0, X1)),
1.73/1.96	    inference('sup-', [status(thm)], ['1', '2'])).
1.73/1.96	tff('4', plain,
1.73/1.96	    ![X0 : int, X1 : int]:
1.73/1.96	      times_times(int, X1, X0) = times_times(int, X0, X1),
1.73/1.96	    inference('simplify', [status(thm)], ['3'])).
1.73/1.96	tff(fact_14_mult__Pls, axiom, (![W1:int]: (times_times(int,pls,W1) = pls))).
1.73/1.96	tff('5', plain, ![X29 : int]: times_times(int, pls, X29) = pls,
1.73/1.96	    inference('cnf', [status(esa)], [fact_14_mult__Pls])).
1.73/1.96	tff(fact_57_mult__Bit1, axiom,
1.73/1.96	  (![L:int,K:int]:
1.73/1.96	     (times_times(int,bit1(K),L) =
1.73/1.96	      plus_plus(int,bit0(times_times(int,K,L)),L)))).
1.73/1.96	tff('6', plain,
1.73/1.96	    ![X158 : int, X159 : int]:
1.73/1.96	      times_times(int, bit1(X158), X159)
1.73/1.96	       = plus_plus(int, bit0(times_times(int, X158, X159)), X159),
1.73/1.96	    inference('cnf', [status(esa)], [fact_57_mult__Bit1])).
1.73/1.96	tff(fact_83_Bit0__def, axiom, (![K:int]: (bit0(K) = plus_plus(int,K,K)))).
1.73/1.96	tff('7', plain, ![X241 : int]: bit0(X241) = plus_plus(int, X241, X241),
1.73/1.96	    inference('cnf', [status(esa)], [fact_83_Bit0__def])).
1.73/1.96	tff('8', plain,
1.73/1.96	    ![X158 : int, X159 : int]:
1.73/1.96	      times_times(int, bit1(X158), X159)
1.73/1.96	       = plus_plus(int, 
1.73/1.96	           plus_plus(int, times_times(int, X158, X159), 
1.73/1.96	             times_times(int, X158, X159)), X159),
1.73/1.96	    inference('demod', [status(thm)], ['6', '7'])).
1.73/1.96	tff('9', plain,
1.73/1.96	    ![X0 : int]:
1.73/1.96	      times_times(int, bit1(pls), X0)
1.73/1.96	       = plus_plus(int, plus_plus(int, pls, times_times(int, pls, X0)), X0),
1.73/1.96	    inference('sup+', [status(thm)], ['5', '8'])).
1.73/1.96	tff(fact_81_add__Pls, axiom, (![K:int]: (plus_plus(int,pls,K) = K))).
1.73/1.96	tff('10', plain, ![X239 : int]: plus_plus(int, pls, X239) = X239,
1.73/1.96	    inference('cnf', [status(esa)], [fact_81_add__Pls])).
1.73/1.96	tff('11', plain, ![X0 : int]: times_times(int, bit1(pls), X0) = X0,
1.73/1.96	    inference('demod', [status(thm)], ['9', '5', '10', '10'])).
1.73/1.96	tff(fact_15_mult__Bit0, axiom,
1.73/1.96	  (![L:int,K:int]: (times_times(int,bit0(K),L) = bit0(times_times(int,K,L))))).
1.73/1.96	tff('12', plain,
1.73/1.96	    ![X30 : int, X31 : int]:
1.73/1.96	      times_times(int, bit0(X30), X31) = bit0(times_times(int, X30, X31)),
1.73/1.96	    inference('cnf', [status(esa)], [fact_15_mult__Bit0])).
1.73/1.96	tff('13', plain,
1.73/1.96	    ![X30 : int, X31 : int]:
1.73/1.96	      times_times(int, bit0(X30), X31)
1.73/1.96	       = plus_plus(int, times_times(int, X30, X31), 
1.73/1.96	           times_times(int, X30, X31)),
1.73/1.96	    inference('demod', [status(thm)], ['12', '7'])).
1.73/1.96	tff('14', plain,
1.73/1.96	    ![X0 : int]:
1.73/1.96	      times_times(int, bit0(bit1(pls)), X0)
1.73/1.96	       = plus_plus(int, times_times(int, bit1(pls), X0), X0),
1.73/1.96	    inference('sup+', [status(thm)], ['11', '13'])).
1.73/1.96	tff('15', plain,
1.73/1.96	    ![X0 : int]:
1.73/1.96	      times_times(int, plus_plus(int, bit1(pls), bit1(pls)), X0)
1.73/1.96	       = plus_plus(int, X0, X0),
1.73/1.96	    inference('demod', [status(thm)], ['14', '7', '11'])).
1.73/1.96	tff('16', plain,
1.73/1.96	    ![X0 : int]:
1.73/1.96	      bit0(X0) = times_times(int, plus_plus(int, bit1(pls), bit1(pls)), X0),
1.73/1.96	    inference('sup+', [status(thm)], ['15', '7'])).
1.73/1.96	tff('17', plain,
1.73/1.96	    ![X0 : int]:
1.73/1.96	      bit0(X0) = times_times(int, X0, plus_plus(int, bit1(pls), bit1(pls))),
1.73/1.96	    inference('sup+', [status(thm)], ['4', '16'])).
1.73/1.96	tff('18', plain,
1.73/1.96	    power_power(complex, 
1.73/1.96	      fFT_Mirabelle_root(
1.73/1.96	        times_times(nat, 
1.73/1.96	          number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), m)), 
1.73/1.96	      times_times(nat, i, 
1.73/1.96	        times_times(nat, 
1.73/1.96	          number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), j)))
1.73/1.96	     != power_power(complex, 
1.73/1.96	          fFT_Mirabelle_root(
1.73/1.96	            times_times(nat, 
1.73/1.96	              number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), m)), 
1.73/1.96	          times_times(nat, 
1.73/1.96	            number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), 
1.73/1.96	            times_times(nat, i, j))),
1.73/1.96	    inference('demod', [status(thm)],
1.73/1.96	              ['0', '17', '11', '17', '11', '17', '11', '17', '11'])).
1.73/1.96	tff(arity_Nat_Onat___Rings_Ocomm__semiring__1, axiom, (comm_semiring_1(nat))).
1.73/1.96	tff('19', plain, comm_semiring_1(nat),
1.73/1.96	    inference('cnf', [status(esa)],
1.73/1.96	              [arity_Nat_Onat___Rings_Ocomm__semiring__1])).
1.73/1.96	tff(fact_26_comm__semiring__1__class_Onormalizing__semiring__rules_I19_J, axiom,
1.73/1.96	  (![A:$tType]:
1.73/1.96	     (comm_semiring_1(A) =>
1.73/1.96	      (![Ry:A,Rx:A,Lx:A]:
1.73/1.96	         (times_times(A,Lx,times_times(A,Rx,Ry)) =
1.73/1.96	          times_times(A,Rx,times_times(A,Lx,Ry))))))).
1.73/1.96	tff('20', plain,
1.73/1.96	    ![X72 : $tType, X73 : X72, X74 : X72, X75 : X72]:
1.73/1.96	      (times_times(X72, X74, times_times(X72, X73, X75))
1.73/1.96	        = times_times(X72, X73, times_times(X72, X74, X75))
1.73/1.96	       | ~ comm_semiring_1(X72)),
1.73/1.96	    inference('cnf', [status(esa)],
1.73/1.96	              [fact_26_comm__semiring__1__class_Onormalizing__semiring__rules_I19_J])).
1.73/1.96	tff('21', plain,
1.73/1.96	    ![X0 : nat, X1 : nat, X2 : nat]:
1.73/1.96	      (~ $true
1.73/1.96	       | times_times(nat, X2, times_times(nat, X1, X0))
1.73/1.96	          = times_times(nat, X1, times_times(nat, X2, X0))),
1.73/1.96	    inference('sup-', [status(thm)], ['19', '20'])).
1.73/1.96	tff('22', plain,
1.73/1.96	    ![X0 : nat, X1 : nat, X2 : nat]:
1.73/1.96	      times_times(nat, X2, times_times(nat, X1, X0))
1.73/1.96	       = times_times(nat, X1, times_times(nat, X2, X0)),
1.73/1.96	    inference('simplify', [status(thm)], ['21'])).
1.73/1.96	tff('23', plain,
1.73/1.96	    power_power(complex, 
1.73/1.96	      fFT_Mirabelle_root(
1.73/1.96	        times_times(nat, 
1.73/1.96	          number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), m)), 
1.73/1.96	      times_times(nat, 
1.73/1.96	        number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), 
1.73/1.96	        times_times(nat, i, j)))
1.73/1.96	     != power_power(complex, 
1.73/1.96	          fFT_Mirabelle_root(
1.73/1.96	            times_times(nat, 
1.73/1.96	              number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), m)), 
1.73/1.96	          times_times(nat, 
1.73/1.96	            number_number_of(nat, plus_plus(int, bit1(pls), bit1(pls))), 
1.73/1.96	            times_times(nat, i, j))),
1.73/1.96	    inference('demod', [status(thm)], ['18', '22'])).
1.73/1.96	tff('24', plain, $false, inference('simplify', [status(thm)], ['23'])).
1.73/1.96	
1.73/1.96	% SZS output end Refutation
1.73/1.96	EOF
