0.00/0.01	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : purification_int
0.00/0.01	% Ordering    : rpo6
0.00/0.01	% 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 int \
0.00/0.01	  --ho-no-ext-pos \
0.00/0.01	  --ho-no-ext-neg \
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   : n068.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 09:50:08 CST 2018
0.59/0.84	% done 1048 iterations in 0.629s
0.59/0.84	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.59/0.84	% SZS output start Refutation
0.59/0.84	tff(conj_0, conjecture,
0.59/0.84	  (~
0.59/0.84	    (((p != zero_zero(poly(a))) => (suc(degree(a,p)) = zero_zero(nat))) <=>
0.59/0.84	     (p != zero_zero(poly(a)))))).
0.59/0.84	tff(zf_stmt_0, negated_conjecture,
0.59/0.84	  (((p != zero_zero(poly(a))) => (suc(degree(a,p)) = zero_zero(nat))) <=>
0.59/0.84	   (p != zero_zero(poly(a))))).
0.59/0.84	tff('0', plain,
0.59/0.84	    (p = zero_zero(poly(a))
0.59/0.84	     | suc(degree(a, p)) = zero_zero(nat)
0.59/0.84	     | p = zero_zero(poly(a))),
0.59/0.84	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.59/0.84	tff('1', plain,
0.59/0.84	    (suc(degree(a, p)) = zero_zero(nat) | p = zero_zero(poly(a))),
0.59/0.84	    inference('simplify', [status(thm)], ['0'])).
0.59/0.84	tff('2', plain, (p != zero_zero(poly(a)) | p != zero_zero(poly(a))),
0.59/0.84	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.59/0.84	tff('3', plain, p != zero_zero(poly(a)),
0.59/0.84	    inference('simplify', [status(thm)], ['2'])).
0.59/0.84	tff('4', plain, suc(degree(a, p)) = zero_zero(nat),
0.59/0.84	    inference('simplify_reflect-', [status(thm)], ['1', '3'])).
0.59/0.84	tff(fact_3_Zero__not__Suc, axiom, (![M1:nat]: (zero_zero(nat) != suc(M1)))).
0.59/0.84	tff('5', plain, ![X7 : nat]: zero_zero(nat) != suc(X7),
0.59/0.84	    inference('cnf', [status(esa)], [fact_3_Zero__not__Suc])).
0.59/0.84	tff('6', plain, zero_zero(nat) != zero_zero(nat),
0.59/0.84	    inference('sup-', [status(thm)], ['4', '5'])).
0.59/0.84	tff('7', plain, $false, inference('simplify', [status(thm)], ['6'])).
0.59/0.84	
0.59/0.84	% SZS output end Refutation
0.59/0.84	EOF
