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    : fo
0.00/0.01	% Ordering    : kbo
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-ho \
0.00/0.01	  --no-avatar \
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	  --no-max-vars \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n101.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:55:53 CST 2018
0.00/0.23	% done 45 iterations in 0.023s
0.00/0.23	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.23	% SZS output start Refutation
0.00/0.23	tff(conj_1, conjecture, (![T:state]: (?[S:state]: (S != T)))).
0.00/0.23	tff(zf_stmt_0, negated_conjecture, (~(![T:state]: (?[S:state]: (S != T))))).
0.00/0.23	tff('0', plain, ![X282 : state]: X282 = sk_T1,
0.00/0.23	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.23	tff('1', plain, ![X0 : state, X1 : state]: X1 = X0,
0.00/0.23	    inference('sup+', [status(thm)], ['0', '0'])).
0.00/0.23	tff(conj_0, axiom, (?[S1:state,T:state]: (S1 != T))).
0.00/0.23	tff('2', plain, sk_S1 != sk_T, inference('cnf', [status(esa)], [conj_0])).
0.00/0.23	tff('3', plain, ![X0 : state]: sk_S1 != X0,
0.00/0.23	    inference('sup-', [status(thm)], ['1', '2'])).
0.00/0.23	tff('4', plain, $false, inference('simplify', [status(thm)], ['3'])).
0.00/0.23	
0.00/0.23	% SZS output end Refutation
0.00/0.23	EOF
