0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : app
0.00/0.00	% Variant    : fo
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-ho \
0.00/0.00	  --no-avatar \
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	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n154.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:38 CST 2018
2.13/2.37	% done 1048 iterations in 2.167s
2.13/2.37	% SZS status Theorem for 'stdin'
2.13/2.37	% SZS output start Refutation
2.13/2.37	tff(zf_stmt_166, conjecture,
2.13/2.37	  (~
2.13/2.37	    (((p != zero_zero(poly(a))) =>
2.13/2.37	      (app_encode_app(nat,nat,suc,app_encode_app(poly(a),nat,degree(a),p)) =
2.13/2.37	       zero_zero(nat))) <=>
2.13/2.37	     (p != zero_zero(poly(a)))))).
2.13/2.37	tff(zf_stmt_0, negated_conjecture,
2.13/2.37	  (((p != zero_zero(poly(a))) =>
2.13/2.37	    (app_encode_app(nat,nat,suc,app_encode_app(poly(a),nat,degree(a),p)) =
2.13/2.37	     zero_zero(nat))) <=>
2.13/2.37	   (p != zero_zero(poly(a))))).
2.13/2.37	tff('0', plain,
2.13/2.37	    (p = zero_zero(poly(a))
2.13/2.37	     | app_encode_app(nat, nat, suc, 
2.13/2.37	         app_encode_app(poly(a), nat, degree(a), p))
2.13/2.37	        = zero_zero(nat)
2.13/2.37	     | p = zero_zero(poly(a))),
2.13/2.37	    inference('cnf', [status(esa)], [zf_stmt_0])).
2.13/2.37	tff('1', plain,
2.13/2.37	    (app_encode_app(nat, nat, suc, 
2.13/2.37	       app_encode_app(poly(a), nat, degree(a), p))
2.13/2.37	      = zero_zero(nat)
2.13/2.37	     | p = zero_zero(poly(a))),
2.13/2.37	    inference('simplify', [status(thm)], ['0'])).
2.13/2.37	tff('2', plain, (p != zero_zero(poly(a)) | p != zero_zero(poly(a))),
2.13/2.37	    inference('cnf', [status(esa)], [zf_stmt_0])).
2.13/2.37	tff('3', plain, p != zero_zero(poly(a)),
2.13/2.37	    inference('simplify', [status(thm)], ['2'])).
2.13/2.37	tff('4', plain,
2.13/2.37	    app_encode_app(nat, nat, suc, app_encode_app(poly(a), nat, degree(a), p))
2.13/2.37	     = zero_zero(nat),
2.13/2.37	    inference('simplify_reflect-', [status(thm)], ['1', '3'])).
2.13/2.37	tff(zf_stmt_45, axiom,
2.13/2.37	  (![M1:nat]: (zero_zero(nat) != app_encode_app(nat,nat,suc,M1)))).
2.13/2.37	tff('5', plain,
2.13/2.37	    ![X7 : nat]: zero_zero(nat) != app_encode_app(nat, nat, suc, X7),
2.13/2.37	    inference('cnf', [status(esa)], [zf_stmt_45])).
2.13/2.37	tff('6', plain, zero_zero(nat) != zero_zero(nat),
2.13/2.37	    inference('sup-', [status(thm)], ['4', '5'])).
2.13/2.37	tff('7', plain, $false, inference('simplify', [status(thm)], ['6'])).
2.13/2.37	
2.13/2.37	% SZS output end Refutation
2.13/2.37	EOF
