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    : 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.19	% Computer   : n164.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 09:52:08 CST 2018
0.00/0.35	% done 218 iterations in 0.154s
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_25_even__mult__two__ex, axiom,
0.00/0.35	  (![Nb:nat]:
0.00/0.35	     (even_odd_even(nat,Nb) <=>
0.00/0.35	      (?[M3:nat]:
0.00/0.35	         (Nb = times_times(nat,number_number_of(nat,bit0(bit1(pls))),M3)))))).
0.00/0.35	tff('0', plain,
0.00/0.35	    ![X45 : nat]:
0.00/0.35	      (X45
0.00/0.35	        = times_times(nat, number_number_of(nat, bit0(bit1(pls))), 
0.00/0.35	            sk_M3(X45))
0.00/0.35	       | ~ even_odd_even(nat, X45)),
0.00/0.35	    inference('cnf', [status(esa)], [fact_25_even__mult__two__ex])).
0.00/0.35	tff(fact_36_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_36_Pls__def])).
0.00/0.35	tff('2', plain,
0.00/0.35	    ![X45 : nat]:
0.00/0.35	      (X45
0.00/0.35	        = times_times(nat, 
0.00/0.35	            number_number_of(nat, bit0(bit1(zero_zero(int)))), sk_M3(X45))
0.00/0.35	       | ~ even_odd_even(nat, X45)),
0.00/0.35	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.35	tff(conj_0, conjecture,
0.00/0.35	  (?[M:nat]: (na = times_times(nat,number_number_of(nat,bit0(bit1(pls))),M)))).
0.00/0.35	tff(zf_stmt_0, negated_conjecture,
0.00/0.35	  (~
0.00/0.35	    (?[M:nat]:
0.00/0.35	       (na = times_times(nat,number_number_of(nat,bit0(bit1(pls))),M))))).
0.00/0.35	tff('3', plain,
0.00/0.35	    ![X248 : nat]:
0.00/0.35	      na != times_times(nat, number_number_of(nat, bit0(bit1(pls))), X248),
0.00/0.35	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.35	tff('4', plain,
0.00/0.35	    ![X248 : nat]:
0.00/0.35	      na
0.00/0.35	       != times_times(nat, 
0.00/0.35	            number_number_of(nat, bit0(bit1(zero_zero(int)))), X248),
0.00/0.35	    inference('demod', [status(thm)], ['3', '1'])).
0.00/0.35	tff('5', plain, ![X0 : nat]: (na != X0 | ~ even_odd_even(nat, X0)),
0.00/0.35	    inference('sup-', [status(thm)], ['2', '4'])).
0.00/0.35	tff('6', plain, ~ even_odd_even(nat, na),
0.00/0.35	    inference('simplify', [status(thm)], ['5'])).
0.00/0.35	tff(fact_0_e, axiom, (even_odd_even(nat,na))).
0.00/0.35	tff('7', plain, even_odd_even(nat, na),
0.00/0.35	    inference('cnf', [status(esa)], [fact_0_e])).
0.00/0.35	tff('8', plain, ~ $true, inference('demod', [status(thm)], ['6', '7'])).
0.00/0.35	tff('9', plain, $false, inference('simplify', [status(thm)], ['8'])).
0.00/0.35	
0.00/0.35	% SZS output end Refutation
0.00/0.36	EOF
