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    : purification_int
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-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
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	  --ho-purify int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n104.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 08:25:08 CST 2018
0.00/0.21	% done 21 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(state_8, axiom, (has(p8,goto(loop)))).
0.00/0.21	tff('0', plain, has(p8, goto(loop)),
0.00/0.21	    inference('cnf', [status(esa)], [state_8])).
0.00/0.21	tff(label_state_3, axiom, (labels(loop,p3))).
0.00/0.21	tff('1', plain, labels(loop, p3),
0.00/0.21	    inference('cnf', [status(esa)], [label_state_3])).
0.00/0.21	tff(goto_success, axiom,
0.00/0.21	  (![Goal_state:state,Label:label,Start_state:state]:
0.00/0.21	     ((labels(Label,Goal_state) & has(Start_state,goto(Label))) =>
0.00/0.21	      succeeds(Goal_state,Start_state)))).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X5 : label, X6 : state, X7 : state]:
0.00/0.21	      (~ labels(X5, X6) | ~ has(X7, goto(X5)) | succeeds(X6, X7)),
0.00/0.21	    inference('cnf', [status(esa)], [goto_success])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X0 : state]: (~ $true | succeeds(p3, X0) | ~ has(X0, goto(loop))),
0.00/0.21	    inference('sup-', [status(thm)], ['1', '2'])).
0.00/0.21	tff('4', plain, ![X0 : state]: (~ has(X0, goto(loop)) | succeeds(p3, X0)),
0.00/0.21	    inference('simplify', [status(thm)], ['3'])).
0.00/0.21	tff('5', plain, (~ $true | succeeds(p3, p8)),
0.00/0.21	    inference('sup-', [status(thm)], ['0', '4'])).
0.00/0.21	tff('6', plain, succeeds(p3, p8), inference('simplify', [status(thm)], ['5'])).
0.00/0.21	tff(transition_3_to_8, axiom, (follows(p8,p3))).
0.00/0.21	tff('7', plain, follows(p8, p3),
0.00/0.21	    inference('cnf', [status(esa)], [transition_3_to_8])).
0.00/0.21	tff(direct_success, axiom,
0.00/0.21	  (![Start_state:state,Goal_state:state]:
0.00/0.21	     (follows(Goal_state,Start_state) => succeeds(Goal_state,Start_state)))).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X0 : state, X1 : state]: (succeeds(X0, X1) | ~ follows(X0, X1)),
0.00/0.21	    inference('cnf', [status(esa)], [direct_success])).
0.00/0.21	tff('9', plain, (~ $true | succeeds(p8, p3)),
0.00/0.21	    inference('sup-', [status(thm)], ['7', '8'])).
0.00/0.21	tff('10', plain, succeeds(p8, p3),
0.00/0.21	    inference('simplify', [status(thm)], ['9'])).
0.00/0.21	tff(transitivity_of_success, axiom,
0.00/0.21	  (![Start_state:state,Intermediate_state:state,Goal_state:state]:
0.00/0.21	     ((succeeds(Intermediate_state,Start_state) & 
0.00/0.21	       succeeds(Goal_state,Intermediate_state)) =>
0.00/0.21	      succeeds(Goal_state,Start_state)))).
0.00/0.21	tff('11', plain,
0.00/0.21	    ![X2 : state, X3 : state, X4 : state]:
0.00/0.21	      (~ succeeds(X2, X3) | ~ succeeds(X4, X2) | succeeds(X4, X3)),
0.00/0.21	    inference('cnf', [status(esa)], [transitivity_of_success])).
0.00/0.21	tff('12', plain,
0.00/0.21	    ![X0 : state]: (~ $true | succeeds(X0, p3) | ~ succeeds(X0, p8)),
0.00/0.21	    inference('sup-', [status(thm)], ['10', '11'])).
0.00/0.21	tff('13', plain, ![X0 : state]: (~ succeeds(X0, p8) | succeeds(X0, p3)),
0.00/0.21	    inference('simplify', [status(thm)], ['12'])).
0.00/0.21	tff('14', plain, (~ $true | succeeds(p3, p3)),
0.00/0.21	    inference('sup-', [status(thm)], ['6', '13'])).
0.00/0.21	tff('15', plain, succeeds(p3, p3),
0.00/0.21	    inference('simplify', [status(thm)], ['14'])).
0.00/0.21	tff(prove_there_is_a_loop_through_p3, conjecture, (succeeds(p3,p3))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture, (~succeeds(p3,p3))).
0.00/0.21	tff('16', plain, ~ succeeds(p3, p3),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('17', plain, ~ $true, inference('sup-', [status(thm)], ['15', '16'])).
0.00/0.21	tff('18', plain, $false, inference('simplify', [status(thm)], ['17'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
