0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : appext
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   : n189.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 10:31:53 CST 2018
0.00/0.21	% done 5 iterations in 0.006s
0.00/0.21	% SZS status Theorem for 'stdin'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(zf_stmt_33, axiom, (app_encode_app($i,$o,p,h))).
0.00/0.21	tff('0', plain, app_encode_app($i, $o, p, h),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_33])).
0.00/0.21	tff(zf_stmt_34, conjecture, (?[X]: app_encode_app($i,$o,p,X))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture, (~(?[X]: app_encode_app($i,$o,p,X)))).
0.00/0.21	tff('1', plain, ![X19]: ~ app_encode_app($i, $o, p, X19),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain, ~ $true, inference('sup-', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain, $false, inference('simplify', [status(thm)], ['2'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
