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    : supatvars_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	  --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.20	% Computer   : n105.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:33:54 CST 2018
0.00/0.35	% done 314 iterations in 0.148s
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_0_n1pos, axiom,
0.00/0.35	  (hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),
0.00/0.35	                       hAPP_int_int(plus_plus_int(one_one_int),
0.00/0.35	                                    hAPP_nat_int(semiri1621563631at_int,n)))))).
0.00/0.35	tff('0', plain,
0.00/0.35	    hBOOL(
0.00/0.35	      hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int, zero_zero_int), 
0.00/0.35	        hAPP_int_int(plus_plus_int(one_one_int), 
0.00/0.35	          hAPP_nat_int(semiri1621563631at_int, n)))),
0.00/0.35	    inference('cnf', [status(esa)], [fact_0_n1pos])).
0.00/0.35	tff(fact_98_Pls__def, axiom, (pls = zero_zero_int)).
0.00/0.35	tff('1', plain, pls = zero_zero_int,
0.00/0.35	    inference('cnf', [status(esa)], [fact_98_Pls__def])).
0.00/0.35	tff('2', plain,
0.00/0.35	    hBOOL(
0.00/0.35	      hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int, pls), 
0.00/0.35	        hAPP_int_int(plus_plus_int(one_one_int), 
0.00/0.35	          hAPP_nat_int(semiri1621563631at_int, n)))),
0.00/0.35	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.35	tff(fact_67_zadd__commute, axiom,
0.00/0.35	  (![Z_2:int,W:int]:
0.00/0.35	     (hAPP_int_int(plus_plus_int(Z_2),W) = hAPP_int_int(plus_plus_int(W),Z_2)))).
0.00/0.35	tff('3', plain,
0.00/0.35	    ![X94 : int, X95 : int]:
0.00/0.35	      hAPP_int_int(plus_plus_int(X95), X94)
0.00/0.35	       = hAPP_int_int(plus_plus_int(X94), X95),
0.00/0.35	    inference('cnf', [status(esa)], [fact_67_zadd__commute])).
0.00/0.35	tff(fact_573_succ__def, axiom,
0.00/0.35	  (![K:int]: (succ(K) = hAPP_int_int(plus_plus_int(K),one_one_int)))).
0.00/0.35	tff('4', plain,
0.00/0.35	    ![X1160 : int]:
0.00/0.35	      succ(X1160) = hAPP_int_int(plus_plus_int(X1160), one_one_int),
0.00/0.35	    inference('cnf', [status(esa)], [fact_573_succ__def])).
0.00/0.35	tff('5', plain,
0.00/0.35	    ![X0 : int]: succ(X0) = hAPP_int_int(plus_plus_int(one_one_int), X0),
0.00/0.35	    inference('sup+', [status(thm)], ['3', '4'])).
0.00/0.35	tff('6', plain,
0.00/0.35	    hBOOL(
0.00/0.35	      hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int, pls), 
0.00/0.35	        succ(hAPP_nat_int(semiri1621563631at_int, n)))),
0.00/0.35	    inference('demod', [status(thm)], ['2', '5'])).
0.00/0.35	tff(conj_0, conjecture,
0.00/0.35	  (hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),
0.00/0.35	                                             hAPP_nat_int(semiri1621563631at_int,
0.00/0.35	                                                          n))),
0.00/0.35	                number_number_of_nat(bit0(bit1(pls)))) !=
0.00/0.35	   zero_zero_int)).
0.00/0.35	tff(zf_stmt_0, negated_conjecture,
0.00/0.35	  (hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),
0.00/0.35	                                             hAPP_nat_int(semiri1621563631at_int,
0.00/0.35	                                                          n))),
0.00/0.35	                number_number_of_nat(bit0(bit1(pls)))) =
0.00/0.35	   zero_zero_int)).
0.00/0.35	tff('7', plain,
0.00/0.35	    hAPP_nat_int(
0.00/0.35	      power_power_int(
0.00/0.35	        hAPP_int_int(plus_plus_int(one_one_int), 
0.00/0.35	          hAPP_nat_int(semiri1621563631at_int, n))), 
0.00/0.35	      number_number_of_nat(bit0(bit1(pls))))
0.00/0.35	     = zero_zero_int,
0.00/0.35	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.35	tff(fact_25_semiring__norm_I110_J, axiom,
0.00/0.35	  (one_one_int = number_number_of_int(bit1(pls)))).
0.00/0.35	tff('8', plain, one_one_int = number_number_of_int(bit1(pls)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_25_semiring__norm_I110_J])).
0.00/0.35	tff(fact_176_number__of__is__id, axiom,
0.00/0.35	  (![K:int]: (number_number_of_int(K) = K))).
0.00/0.35	tff('9', plain, ![X255 : int]: number_number_of_int(X255) = X255,
0.00/0.35	    inference('cnf', [status(esa)], [fact_176_number__of__is__id])).
0.00/0.35	tff('10', plain, one_one_int = bit1(pls),
0.00/0.35	    inference('demod', [status(thm)], ['8', '9'])).
0.00/0.35	tff('11', plain,
0.00/0.35	    hAPP_nat_int(
0.00/0.35	      power_power_int(succ(hAPP_nat_int(semiri1621563631at_int, n))), 
0.00/0.35	      number_number_of_nat(bit0(one_one_int)))
0.00/0.35	     = pls,
0.00/0.35	    inference('demod', [status(thm)], ['7', '5', '10', '1'])).
0.00/0.35	tff(fact_10_zero__eq__power2, axiom,
0.00/0.35	  (![A_24:int]:
0.00/0.35	     ((hAPP_nat_int(power_power_int(A_24),
0.00/0.35	                    number_number_of_nat(bit0(bit1(pls)))) =
0.00/0.35	       zero_zero_int) <=>
0.00/0.35	      (A_24 = zero_zero_int)))).
0.00/0.35	tff('12', plain,
0.00/0.35	    ![X6 : int]:
0.00/0.35	      (X6 = zero_zero_int
0.00/0.35	       | hAPP_nat_int(power_power_int(X6), 
0.00/0.35	           number_number_of_nat(bit0(bit1(pls))))
0.00/0.35	          != zero_zero_int),
0.00/0.35	    inference('cnf', [status(esa)], [fact_10_zero__eq__power2])).
0.00/0.35	tff('13', plain,
0.00/0.35	    ![X6 : int]:
0.00/0.35	      (X6 = pls
0.00/0.35	       | hAPP_nat_int(power_power_int(X6), 
0.00/0.35	           number_number_of_nat(bit0(one_one_int)))
0.00/0.35	          != pls),
0.00/0.35	    inference('demod', [status(thm)], ['12', '1', '10', '1'])).
0.00/0.35	tff('14', plain,
0.00/0.35	    (pls != pls | succ(hAPP_nat_int(semiri1621563631at_int, n)) = pls),
0.00/0.35	    inference('sup-', [status(thm)], ['11', '13'])).
0.00/0.35	tff('15', plain, succ(hAPP_nat_int(semiri1621563631at_int, n)) = pls,
0.00/0.35	    inference('simplify', [status(thm)], ['14'])).
0.00/0.35	tff('16', plain,
0.00/0.35	    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int, pls), pls)),
0.00/0.35	    inference('demod', [status(thm)], ['6', '15'])).
0.00/0.35	tff(fact_48_rel__simps_I2_J, axiom,
0.00/0.35	  (~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)))).
0.00/0.35	tff('17', plain,
0.00/0.35	    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int, pls), pls)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_48_rel__simps_I2_J])).
0.00/0.35	tff('18', plain, ~ $true, inference('sup-', [status(thm)], ['16', '17'])).
0.00/0.35	tff('19', plain, $false, inference('simplify', [status(thm)], ['18'])).
0.00/0.35	
0.00/0.35	% SZS output end Refutation
0.00/0.36	EOF
