0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.13	% Command    : run_portfolio.sh /export/starexec/sandbox2/benchmark/theBenchmark.p /export/starexec/sandbox2/tmp/tmp.gcOWMcbVMx
0.12/0.33	% Computer   : n027.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 960
0.12/0.33	% DateTime   : Thu Jul  2 07:28:32 EDT 2020
0.12/0.33	% CPUTime    : 
0.12/0.33	% Running portfolio for 120 s
0.12/0.33	% File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.34	% Number of cores: 8
0.12/0.34	% Python version: Python 3.6.8
0.12/0.34	% Running in FO mode
2.80/3.04	% Running /export/starexec/sandbox2/solver/bin/fo/fo7.sh for 25
2.80/3.04	% Solved by: fo/fo7.sh
2.80/3.04	To remain in the chosen logic fragment, unification with booleans has been disabled.
2.80/3.04	% done 1899 iterations in 2.594s
2.80/3.04	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
2.80/3.04	% SZS output start Refutation
2.80/3.04	tff(thI28, conjecture,
2.80/3.04	  (![A,E]:
2.80/3.04	     (subset(A,E) => equal_set(intersection(difference(E,A),A),empty_set)))).
2.80/3.04	tff(zf_stmt_0, negated_conjecture,
2.80/3.04	  (~
2.80/3.04	    (![A,E]:
2.80/3.04	       (subset(A,E) => equal_set(intersection(difference(E,A),A),empty_set))))).
2.80/3.04	tff('0', plain,
2.80/3.04	    ~ equal_set(intersection(difference(sk_E, sk_A), sk_A), empty_set),
2.80/3.04	    inference('cnf', [status(esa)], [zf_stmt_0])).
2.80/3.04	tff(subset, axiom,
2.80/3.04	  (![A,B]: (subset(A,B) <=> (![X]: (member(X,A) => member(X,B)))))).
2.80/3.04	tff('1', plain,
2.80/3.04	    ![X19, X21]: ( subset(X19, X21) |  member(sk_X(X21, X19), X19)),
2.80/3.04	    inference('cnf', [status(esa)], [subset])).
2.80/3.04	tff(intersection, axiom,
2.80/3.04	  (![X,A,B]: ((member(X,A) & member(X,B)) <=> member(X,intersection(A,B))))).
2.80/3.04	tff('2', plain,
2.80/3.04	    ![X0, X1, X3]: ( member(X0, X3) | ~ member(X0, intersection(X1, X3))),
2.80/3.04	    inference('cnf', [status(esa)], [intersection])).
2.80/3.04	tff('3', plain,
2.80/3.04	    ![X0, X1, X2]:
2.80/3.04	      ( subset(intersection(X1, X0), X2)
2.80/3.04	       |  member(sk_X(X2, intersection(X1, X0)), X0)),
2.80/3.04	    inference('sup-', [status(thm)], ['1', '2'])).
2.80/3.04	tff('4', plain,
2.80/3.04	    ![X19, X21]: ( subset(X19, X21) |  member(sk_X(X21, X19), X19)),
2.80/3.04	    inference('cnf', [status(esa)], [subset])).
2.80/3.04	tff('5', plain,
2.80/3.04	    ![X0, X1, X3]: ( member(X0, X1) | ~ member(X0, intersection(X1, X3))),
2.80/3.04	    inference('cnf', [status(esa)], [intersection])).
2.80/3.04	tff('6', plain,
2.80/3.04	    ![X0, X1, X2]:
2.80/3.04	      ( subset(intersection(X1, X0), X2)
2.80/3.04	       |  member(sk_X(X2, intersection(X1, X0)), X1)),
2.80/3.04	    inference('sup-', [status(thm)], ['4', '5'])).
2.80/3.04	tff(difference, axiom,
2.80/3.04	  (![B,A,E]: (member(B,difference(E,A)) <=> (member(B,E) & (~member(B,A)))))).
2.80/3.04	tff('7', plain,
2.80/3.04	    ![X8, X9, X10]: (~ member(X8, X10) | ~ member(X8, difference(X9, X10))),
2.80/3.04	    inference('cnf', [status(esa)], [difference])).
2.80/3.04	tff('8', plain,
2.80/3.04	    ![X0, X1, X2, X3]:
2.80/3.04	      ( subset(intersection(difference(X1, X0), X2), X3)
2.80/3.04	       | ~ member(sk_X(X3, intersection(difference(X1, X0), X2)), X0)),
2.80/3.04	    inference('sup-', [status(thm)], ['6', '7'])).
2.80/3.04	tff('9', plain,
2.80/3.04	    ![X0, X1, X2]:
2.80/3.04	      ( subset(intersection(difference(X1, X0), X0), X2)
2.80/3.04	       |  subset(intersection(difference(X1, X0), X0), X2)),
2.80/3.04	    inference('sup-', [status(thm)], ['3', '8'])).
2.80/3.04	tff('10', plain,
2.80/3.04	    ![X0, X1, X2]:  subset(intersection(difference(X1, X0), X0), X2),
2.80/3.04	    inference('simplify', [status(thm)], ['9'])).
2.80/3.04	tff('11', plain,
2.80/3.04	    ![X19, X21]: ( subset(X19, X21) |  member(sk_X(X21, X19), X19)),
2.80/3.04	    inference('cnf', [status(esa)], [subset])).
2.80/3.04	tff(empty_set, axiom, (![X]: (~member(X,empty_set)))).
2.80/3.04	tff('12', plain, ![X22]: ~ member(X22, empty_set),
2.80/3.04	    inference('cnf', [status(esa)], [empty_set])).
2.80/3.04	tff('13', plain, ![X0]:  subset(empty_set, X0),
2.80/3.04	    inference('sup-', [status(thm)], ['11', '12'])).
2.80/3.04	tff(equal_set, axiom,
2.80/3.04	  (![A,B]: ((subset(A,B) & subset(B,A)) <=> equal_set(A,B)))).
2.80/3.04	tff('14', plain,
2.80/3.04	    ![X23, X24]:
2.80/3.04	      ( equal_set(X23, X24) | ~ subset(X24, X23) | ~ subset(X23, X24)),
2.80/3.04	    inference('cnf', [status(esa)], [equal_set])).
2.80/3.04	tff('15', plain,
2.80/3.04	    ![X0]: (~ subset(X0, empty_set) |  equal_set(X0, empty_set)),
2.80/3.04	    inference('sup-', [status(thm)], ['13', '14'])).
2.80/3.04	tff('16', plain,
2.80/3.04	    ![X0, X1]:  equal_set(intersection(difference(X1, X0), X0), empty_set),
2.80/3.04	    inference('sup-', [status(thm)], ['10', '15'])).
2.80/3.04	tff('17', plain, $false, inference('demod', [status(thm)], ['0', '16'])).
2.80/3.04	
2.80/3.04	% SZS output end Refutation
2.80/3.04	
2.80/3.05	% Zipperpin 1.5 exiting
2.80/3.05	EOF