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_ext
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --ho-purify ext \
0.00/0.01	  --ho-ext-axiom \
0.00/0.01	  --restrict-hidden-sup-at-vars \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n093.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 14:29:40 CST 2018
1.94/2.16	% done 1081 iterations in 1.958s
1.94/2.16	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
1.94/2.16	% SZS output start Refutation
1.94/2.16	tff(fact_26_comm__semiring__1__class_Onormalizing__semiring__rules_I19_J, axiom,
1.94/2.16	  (![A:$tType]:
1.94/2.16	     (comm_semiring_1(A) =>
1.94/2.16	      (![Ry:A,Rx:A,Lx:A]:
1.94/2.16	         (times_times(A,Lx,times_times(A,Rx,Ry)) =
1.94/2.16	          times_times(A,Rx,times_times(A,Lx,Ry))))))).
1.94/2.16	tff('0', plain,
1.94/2.16	    ![X72 : $tType, X73 : X72, X74 : X72, X75 : X72]:
1.94/2.16	      (times_times(X72, X74, times_times(X72, X73, X75))
1.94/2.16	        = times_times(X72, X73, times_times(X72, X74, X75))
1.94/2.16	       | ~ comm_semiring_1(X72)),
1.94/2.16	    inference('cnf', [status(esa)],
1.94/2.16	              [fact_26_comm__semiring__1__class_Onormalizing__semiring__rules_I19_J])).
1.94/2.16	tff(conj_0, conjecture,
1.94/2.16	  (power_power(complex,
1.94/2.16	               fFT_Mirabelle_root(times_times(nat,
1.94/2.16	                                              number_number_of(nat,
1.94/2.16	                                                               bit0(bit1(pls))),
1.94/2.16	                                              m)),
1.94/2.16	               times_times(nat,i,
1.94/2.16	                           times_times(nat,
1.94/2.16	                                       number_number_of(nat,bit0(bit1(pls))),
1.94/2.16	                                       j))) =
1.94/2.16	   power_power(complex,
1.94/2.16	               fFT_Mirabelle_root(times_times(nat,
1.94/2.16	                                              number_number_of(nat,
1.94/2.16	                                                               bit0(bit1(pls))),
1.94/2.16	                                              m)),
1.94/2.16	               times_times(nat,number_number_of(nat,bit0(bit1(pls))),
1.94/2.16	                           times_times(nat,i,j))))).
1.94/2.16	tff(zf_stmt_0, negated_conjecture,
1.94/2.16	  (power_power(complex,
1.94/2.16	               fFT_Mirabelle_root(times_times(nat,
1.94/2.16	                                              number_number_of(nat,
1.94/2.16	                                                               bit0(bit1(pls))),
1.94/2.16	                                              m)),
1.94/2.16	               times_times(nat,i,
1.94/2.16	                           times_times(nat,
1.94/2.16	                                       number_number_of(nat,bit0(bit1(pls))),
1.94/2.16	                                       j))) !=
1.94/2.16	   power_power(complex,
1.94/2.16	               fFT_Mirabelle_root(times_times(nat,
1.94/2.17	                                              number_number_of(nat,
1.94/2.17	                                                               bit0(bit1(pls))),
1.94/2.17	                                              m)),
1.94/2.17	               times_times(nat,number_number_of(nat,bit0(bit1(pls))),
1.94/2.17	                           times_times(nat,i,j))))).
1.94/2.17	tff('1', plain,
1.94/2.17	    power_power(complex, 
1.94/2.17	      fFT_Mirabelle_root(
1.94/2.17	        times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.94/2.17	      times_times(nat, i, 
1.94/2.17	        times_times(nat, number_number_of(nat, bit0(bit1(pls))), j)))
1.94/2.17	     != power_power(complex, 
1.94/2.17	          fFT_Mirabelle_root(
1.94/2.17	            times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.94/2.17	          times_times(nat, number_number_of(nat, bit0(bit1(pls))), 
1.94/2.17	            times_times(nat, i, j))),
1.94/2.17	    inference('cnf', [status(esa)], [zf_stmt_0])).
1.94/2.17	tff('2', plain,
1.94/2.17	    (power_power(complex, 
1.94/2.17	       fFT_Mirabelle_root(
1.94/2.17	         times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.94/2.17	       times_times(nat, i, 
1.94/2.17	         times_times(nat, number_number_of(nat, bit0(bit1(pls))), j)))
1.94/2.17	      != power_power(complex, 
1.94/2.17	           fFT_Mirabelle_root(
1.94/2.17	             times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.94/2.17	           times_times(nat, i, 
1.94/2.17	             times_times(nat, number_number_of(nat, bit0(bit1(pls))), j)))
1.94/2.17	     | ~ comm_semiring_1(nat)),
1.94/2.17	    inference('sup-', [status(thm)], ['0', '1'])).
1.94/2.17	tff(arity_Nat_Onat___Rings_Ocomm__semiring__1, axiom, (comm_semiring_1(nat))).
1.94/2.17	tff('3', plain, comm_semiring_1(nat),
1.94/2.17	    inference('cnf', [status(esa)],
1.94/2.17	              [arity_Nat_Onat___Rings_Ocomm__semiring__1])).
1.94/2.17	tff('4', plain,
1.94/2.17	    (power_power(complex, 
1.94/2.17	       fFT_Mirabelle_root(
1.94/2.17	         times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.94/2.17	       times_times(nat, i, 
1.94/2.17	         times_times(nat, number_number_of(nat, bit0(bit1(pls))), j)))
1.94/2.17	      != power_power(complex, 
1.94/2.17	           fFT_Mirabelle_root(
1.94/2.17	             times_times(nat, number_number_of(nat, bit0(bit1(pls))), m)), 
1.94/2.17	           times_times(nat, i, 
1.94/2.17	             times_times(nat, number_number_of(nat, bit0(bit1(pls))), j)))
1.94/2.17	     | ~ $true),
1.94/2.17	    inference('demod', [status(thm)], ['2', '3'])).
1.94/2.17	tff('5', plain, $false, inference('simplify', [status(thm)], ['4'])).
1.94/2.17	
1.94/2.17	% SZS output end Refutation
1.94/2.17	EOF
