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.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.19	% Computer   : n077.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 07:42:08 CST 2018
0.00/0.35	% done 265 iterations in 0.155s
0.00/0.35	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.35	% SZS output start Refutation
0.00/0.35	tff(fact_13_rel__simps_I27_J, axiom,
0.00/0.35	  (![K3:int]: (ord_less_eq(int,bit0(K3),pls) <=> ord_less_eq(int,K3,pls)))).
0.00/0.35	tff('0', plain,
0.00/0.35	    ![X21 : int]:
0.00/0.35	      (ord_less_eq(int, bit0(X21), pls) | ~ ord_less_eq(int, X21, pls)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_13_rel__simps_I27_J])).
0.00/0.35	tff(fact_26_rel__simps_I34_J, axiom,
0.00/0.35	  (![L:int,K3:int]:
0.00/0.35	     (ord_less_eq(int,bit1(K3),bit1(L)) <=> ord_less_eq(int,K3,L)))).
0.00/0.35	tff('1', plain,
0.00/0.35	    ![X49 : int, X50 : int]:
0.00/0.35	      (ord_less_eq(int, bit1(X50), bit1(X49)) | ~ ord_less_eq(int, X50, X49)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_26_rel__simps_I34_J])).
0.00/0.35	tff(conj_0, conjecture,
0.00/0.35	  (ord_less_eq(int,
0.00/0.35	               plus_plus(int,
0.00/0.35	                         times_times(int,
0.00/0.35	                                     number_number_of(int,
0.00/0.35	                                                      bit0(bit0(bit1(pls)))),
0.00/0.35	                                     m),
0.00/0.35	                         one_one(int)),
0.00/0.35	               one_one(int)))).
0.00/0.35	tff(zf_stmt_0, negated_conjecture,
0.00/0.35	  (~
0.00/0.35	    ord_less_eq(int,
0.00/0.35	                plus_plus(int,
0.00/0.35	                          times_times(int,
0.00/0.35	                                      number_number_of(int,
0.00/0.35	                                                       bit0(bit0(bit1(pls)))),
0.00/0.35	                                      m),
0.00/0.35	                          one_one(int)),
0.00/0.35	                one_one(int)))).
0.00/0.35	tff('2', plain,
0.00/0.35	    ~ ord_less_eq(int, 
0.00/0.35	        plus_plus(int, 
0.00/0.35	          times_times(int, number_number_of(int, bit0(bit0(bit1(pls)))), m), 
0.00/0.35	          one_one(int)), one_one(int)),
0.00/0.35	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.35	tff(fact_45_number__of__is__id, axiom,
0.00/0.35	  (![K:int]: (number_number_of(int,K) = K))).
0.00/0.35	tff('3', plain, ![X98 : int]: number_number_of(int, X98) = X98,
0.00/0.35	    inference('cnf', [status(esa)], [fact_45_number__of__is__id])).
0.00/0.35	tff(fact_30_mult__Bit0, axiom,
0.00/0.35	  (![L1:int,K:int]:
0.00/0.35	     (times_times(int,bit0(K),L1) = bit0(times_times(int,K,L1))))).
0.00/0.35	tff('4', plain,
0.00/0.35	    ![X55 : int, X56 : int]:
0.00/0.35	      times_times(int, bit0(X55), X56) = bit0(times_times(int, X55, X56)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_30_mult__Bit0])).
0.00/0.35	tff(fact_70_one__is__num__one, axiom,
0.00/0.35	  (one_one(int) = number_number_of(int,bit1(pls)))).
0.00/0.35	tff('5', plain, one_one(int) = number_number_of(int, bit1(pls)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_70_one__is__num__one])).
0.00/0.35	tff('6', plain, one_one(int) = bit1(pls),
0.00/0.35	    inference('demod', [status(thm)], ['5', '3'])).
0.00/0.35	tff(fact_10_add__Bit0__Bit1, axiom,
0.00/0.35	  (![L1:int,K:int]:
0.00/0.35	     (plus_plus(int,bit0(K),bit1(L1)) = bit1(plus_plus(int,K,L1))))).
0.00/0.35	tff('7', plain,
0.00/0.35	    ![X14 : int, X15 : int]:
0.00/0.35	      plus_plus(int, bit0(X14), bit1(X15)) = bit1(plus_plus(int, X14, X15)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_10_add__Bit0__Bit1])).
0.00/0.35	tff(fact_52_add__Pls__right, axiom, (![K:int]: (plus_plus(int,K,pls) = K))).
0.00/0.35	tff('8', plain, ![X109 : int]: plus_plus(int, X109, pls) = X109,
0.00/0.35	    inference('cnf', [status(esa)], [fact_52_add__Pls__right])).
0.00/0.35	tff('9', plain,
0.00/0.35	    ~ ord_less_eq(int, bit1(bit0(times_times(int, bit1(pls), m))), bit1(pls)),
0.00/0.35	    inference('demod', [status(thm)],
0.00/0.35	              ['2', '3', '4', '4', '6', '7', '8', '6'])).
0.00/0.35	tff(fact_29_mult__Pls, axiom, (![W:int]: (times_times(int,pls,W) = pls))).
0.00/0.35	tff('10', plain, ![X54 : int]: times_times(int, pls, X54) = pls,
0.00/0.35	    inference('cnf', [status(esa)], [fact_29_mult__Pls])).
0.00/0.35	tff(fact_8_mult__Bit1, axiom,
0.00/0.35	  (![L1:int,K:int]:
0.00/0.35	     (times_times(int,bit1(K),L1) =
0.00/0.35	      plus_plus(int,bit0(times_times(int,K,L1)),L1)))).
0.00/0.35	tff('11', plain,
0.00/0.35	    ![X11 : int, X12 : int]:
0.00/0.35	      times_times(int, bit1(X11), X12)
0.00/0.35	       = plus_plus(int, bit0(times_times(int, X11, X12)), X12),
0.00/0.35	    inference('cnf', [status(esa)], [fact_8_mult__Bit1])).
0.00/0.35	tff('12', plain,
0.00/0.35	    ![X0 : int]:
0.00/0.35	      times_times(int, bit1(pls), X0) = plus_plus(int, bit0(pls), X0),
0.00/0.35	    inference('sup+', [status(thm)], ['10', '11'])).
0.00/0.35	tff(fact_25_Bit0__Pls, axiom, (bit0(pls) = pls)).
0.00/0.35	tff('13', plain, bit0(pls) = pls,
0.00/0.35	    inference('cnf', [status(esa)], [fact_25_Bit0__Pls])).
0.00/0.35	tff(fact_53_add__Pls, axiom, (![K:int]: (plus_plus(int,pls,K) = K))).
0.00/0.35	tff('14', plain, ![X110 : int]: plus_plus(int, pls, X110) = X110,
0.00/0.35	    inference('cnf', [status(esa)], [fact_53_add__Pls])).
0.00/0.35	tff('15', plain, ![X0 : int]: times_times(int, bit1(pls), X0) = X0,
0.00/0.35	    inference('demod', [status(thm)], ['12', '13', '14'])).
0.00/0.35	tff('16', plain, ~ ord_less_eq(int, bit1(bit0(m)), bit1(pls)),
0.00/0.35	    inference('demod', [status(thm)], ['9', '15'])).
0.00/0.35	tff('17', plain, (~ $true | ~ ord_less_eq(int, bit0(m), pls)),
0.00/0.35	    inference('sup-', [status(thm)], ['1', '16'])).
0.00/0.35	tff('18', plain, ~ ord_less_eq(int, bit0(m), pls),
0.00/0.35	    inference('simplify', [status(thm)], ['17'])).
0.00/0.35	tff('19', plain, (~ $true | ~ ord_less_eq(int, m, pls)),
0.00/0.35	    inference('sup-', [status(thm)], ['0', '18'])).
0.00/0.35	tff(fact_0__096m_A_060_061_A0_096, axiom,
0.00/0.35	  (ord_less_eq(int,m,zero_zero(int)))).
0.00/0.35	tff('20', plain, ord_less_eq(int, m, zero_zero(int)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_0__096m_A_060_061_A0_096])).
0.00/0.35	tff(fact_43_Pls__def, axiom, (pls = zero_zero(int))).
0.00/0.35	tff('21', plain, pls = zero_zero(int),
0.00/0.35	    inference('cnf', [status(esa)], [fact_43_Pls__def])).
0.00/0.35	tff('22', plain, ord_less_eq(int, m, pls),
0.00/0.35	    inference('demod', [status(thm)], ['20', '21'])).
0.00/0.35	tff('23', plain, (~ $true | ~ $true),
0.00/0.35	    inference('demod', [status(thm)], ['19', '22'])).
0.00/0.35	tff('24', plain, $false, inference('simplify', [status(thm)], ['23'])).
0.00/0.35	
0.00/0.35	% SZS output end Refutation
0.00/0.35	EOF
