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.19	% Computer   : n088.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:54 CST 2018
0.00/0.27	% done 40 iterations in 0.065s
0.00/0.27	% SZS status Theorem for 'stdin'
0.00/0.27	% SZS output start Refutation
0.00/0.27	tff(zf_stmt_198, conjecture, (![T:state]: (?[S:state]: (S != T)))).
0.00/0.27	tff(zf_stmt_0, negated_conjecture, (~(![T:state]: (?[S:state]: (S != T))))).
0.00/0.27	tff('0', plain, ![X282 : state]: X282 = sk_T1,
0.00/0.27	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.27	tff('1', plain, ![X0 : state, X1 : state]: X1 = X0,
0.00/0.27	    inference('sup+', [status(thm)], ['0', '0'])).
0.00/0.27	tff(zf_stmt_197, axiom, (?[S1:state,T:state]: (S1 != T))).
0.00/0.27	tff('2', plain, sk_S1 != sk_T, inference('cnf', [status(esa)], [zf_stmt_197])).
0.00/0.27	tff('3', plain, ![X0 : state]: sk_S1 != X0,
0.00/0.27	    inference('sup-', [status(thm)], ['1', '2'])).
0.00/0.27	tff('4', plain, $false, inference('simplify', [status(thm)], ['3'])).
0.00/0.27	
0.00/0.27	% SZS output end Refutation
0.00/0.27	EOF
