0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : fo
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-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.19	% Computer   : n071.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 06:34:53 CST 2018
0.00/0.21	% done 24 iterations in 0.007s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(clause_1__clause_2, conjecture, ((~e(exist)) | (~f(exist)))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture, (~((~e(exist)) | (~f(exist))))).
0.00/0.21	tff('0', plain, e(exist), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff(clause_15, axiom, (![X1:unreal]: (e(X1) => c(X1)))).
0.00/0.21	tff('1', plain, ![X16 : unreal]: (c(X16) | ~ e(X16)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_15])).
0.00/0.21	tff('2', plain, (~ $true | c(exist)),
0.00/0.21	    inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain, c(exist), inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff(clause_3, axiom, (![X1:unreal]: (c(X1) => s2least(X1)))).
0.00/0.21	tff('4', plain, ![X0 : unreal]: (s2least(X0) | ~ c(X0)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_3])).
0.00/0.21	tff('5', plain, (~ $true | s2least(exist)),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.21	tff('6', plain, s2least(exist), inference('simplify', [status(thm)], ['5'])).
0.00/0.21	tff(clause_6, axiom, (![X1:unreal]: (s2least(X1) => s(X1,u1r1(X1))))).
0.00/0.21	tff('7', plain, ![X3 : unreal]: (s(X3, u1r1(X3)) | ~ s2least(X3)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_6])).
0.00/0.21	tff(clause_11, axiom,
0.00/0.21	  (![X2:real,X3:real,X1:unreal]:
0.00/0.21	     ((s(X1,X2) & s(X1,X3) & s1most(X1)) => equalish(X3,X2)))).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X10 : real, X11 : real, X12 : unreal]:
0.00/0.21	      (equalish(X10, X11) | ~ s(X12, X11) | ~ s(X12, X10) | ~ s1most(X12)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_11])).
0.00/0.21	tff('9', plain,
0.00/0.21	    ![X0 : unreal, X1 : real]:
0.00/0.21	      (~ $true
0.00/0.21	       | ~ s2least(X0)
0.00/0.21	       | ~ s1most(X0)
0.00/0.21	       | ~ s(X0, X1)
0.00/0.21	       | equalish(X1, u1r1(X0))),
0.00/0.21	    inference('sup-', [status(thm)], ['7', '8'])).
0.00/0.21	tff('10', plain,
0.00/0.21	    ![X0 : unreal, X1 : real]:
0.00/0.21	      (equalish(X1, u1r1(X0)) | ~ s(X0, X1) | ~ s1most(X0) | ~ s2least(X0)),
0.00/0.21	    inference('simplify', [status(thm)], ['9'])).
0.00/0.21	tff(clause_5, axiom,
0.00/0.21	  (![X1:unreal]: (~(equalish(u1r2(X1),u1r1(X1)) & s2least(X1))))).
0.00/0.21	tff('11', plain,
0.00/0.21	    ![X2 : unreal]: (~ equalish(u1r2(X2), u1r1(X2)) | ~ s2least(X2)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_5])).
0.00/0.21	tff('12', plain,
0.00/0.21	    ![X0 : unreal]:
0.00/0.21	      (~ $true
0.00/0.21	       | ~ s2least(X0)
0.00/0.21	       | ~ s1most(X0)
0.00/0.21	       | ~ s(X0, u1r2(X0))
0.00/0.21	       | ~ s2least(X0)),
0.00/0.21	    inference('sup-', [status(thm)], ['10', '11'])).
0.00/0.21	tff('13', plain,
0.00/0.21	    ![X0 : unreal]: (~ s(X0, u1r2(X0)) | ~ s1most(X0) | ~ s2least(X0)),
0.00/0.21	    inference('simplify', [status(thm)], ['12'])).
0.00/0.21	tff(clause_7, axiom, (![X1:unreal]: (s2least(X1) => s(X1,u1r2(X1))))).
0.00/0.21	tff('14', plain, ![X4 : unreal]: (s(X4, u1r2(X4)) | ~ s2least(X4)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_7])).
0.00/0.21	tff('15', plain, ![X0 : unreal]: (~ s2least(X0) | ~ s1most(X0)),
0.00/0.21	    inference('clc', [status(thm)], ['13', '14'])).
0.00/0.21	tff('16', plain, (~ $true | ~ s1most(exist)),
0.00/0.21	    inference('sup-', [status(thm)], ['6', '15'])).
0.00/0.21	tff('17', plain, f(exist), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff(clause_16, axiom, (![X1:unreal]: (f(X1) => d(X1)))).
0.00/0.21	tff('18', plain, ![X17 : unreal]: (d(X17) | ~ f(X17)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_16])).
0.00/0.21	tff('19', plain, (~ $true | d(exist)),
0.00/0.21	    inference('sup-', [status(thm)], ['17', '18'])).
0.00/0.21	tff('20', plain, d(exist), inference('simplify', [status(thm)], ['19'])).
0.00/0.21	tff(clause_9, axiom, (![X1:unreal]: (d(X1) => s1most(X1)))).
0.00/0.21	tff('21', plain, ![X8 : unreal]: (s1most(X8) | ~ d(X8)),
0.00/0.21	    inference('cnf', [status(esa)], [clause_9])).
0.00/0.21	tff('22', plain, (~ $true | s1most(exist)),
0.00/0.21	    inference('sup-', [status(thm)], ['20', '21'])).
0.00/0.21	tff('23', plain, s1most(exist), inference('simplify', [status(thm)], ['22'])).
0.00/0.21	tff('24', plain, (~ $true | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['16', '23'])).
0.00/0.21	tff('25', plain, $false, inference('simplify', [status(thm)], ['24'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
