0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_portfolio.sh /export/starexec/sandbox2/benchmark/theBenchmark.p /export/starexec/sandbox2/tmp/tmp.fMJhYgHms5
0.13/0.34	% Computer   : n010.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% DateTime   : Thu Jul  2 06:49:42 EDT 2020
0.13/0.34	% CPUTime    : 
0.13/0.34	% Running portfolio for 120 s
0.13/0.34	% File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.13/0.34	% Number of cores: 8
0.13/0.34	% Python version: Python 3.6.8
0.13/0.34	% Running in FO mode
0.20/0.51	% Running /export/starexec/sandbox2/solver/bin/fo/fo7.sh for 25
0.20/0.51	% Solved by: fo/fo7.sh
0.20/0.51	To remain in the chosen logic fragment, unification with booleans has been disabled.
0.20/0.51	% done 389 iterations in 0.084s
0.20/0.51	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.20/0.51	% SZS output start Refutation
0.20/0.51	tff(axiom_m2, axiom,
0.20/0.51	  (axiom_m2 <=> (![X,Y]: is_a_theorem(strict_implies(and(X,Y),X))))).
0.20/0.51	tff('0', plain,
0.20/0.51	    ( axiom_m2
0.20/0.51	     | ~ is_a_theorem(strict_implies(and(sk_X_23, sk_Y_19), sk_X_23))),
0.20/0.51	    inference('cnf', [status(esa)], [axiom_m2])).
0.20/0.51	tff('1', plain,
0.20/0.51	    (~ is_a_theorem(strict_implies(and(sk_X_23, sk_Y_19), sk_X_23)))
0.20/0.51	      <= (~ ( is_a_theorem(strict_implies(and(sk_X_23, sk_Y_19), sk_X_23)))),
0.20/0.51	    inference('split', [status(esa)], ['0'])).
0.20/0.51	tff('2', plain, ( axiom_m2) <= (( axiom_m2)),
0.20/0.51	    inference('split', [status(esa)], ['0'])).
0.20/0.51	tff(s1_0_axiom_m2, conjecture, (axiom_m2)).
0.20/0.51	tff(zf_stmt_0, negated_conjecture, (~axiom_m2)).
0.20/0.51	tff('3', plain, ~ axiom_m2, inference('cnf', [status(esa)], [zf_stmt_0])).
0.20/0.51	tff('4', plain, ~ ( axiom_m2), inference('sup-', [status(thm)], ['2', '3'])).
0.20/0.51	tff('5', plain,
0.20/0.51	    ~ ( is_a_theorem(strict_implies(and(sk_X_23, sk_Y_19), sk_X_23))) | 
0.20/0.51	    ( axiom_m2), inference('split', [status(esa)], ['0'])).
0.20/0.51	tff('6', plain,
0.20/0.51	    ~ ( is_a_theorem(strict_implies(and(sk_X_23, sk_Y_19), sk_X_23))),
0.20/0.51	    inference('sat_resolution*', [status(thm)], ['4', '5'])).
0.20/0.51	tff('7', plain,
0.20/0.51	    ~ is_a_theorem(strict_implies(and(sk_X_23, sk_Y_19), sk_X_23)),
0.20/0.51	    inference('simpl_trail', [status(thm)], ['1', '6'])).
0.20/0.51	tff(kn2, axiom, (kn2 <=> (![P,Q]: is_a_theorem(implies(and(P,Q),P))))).
0.20/0.51	tff('8', plain,
0.20/0.51	    ![X17, X18]: ( is_a_theorem(implies(and(X17, X18), X17)) | ~ kn2),
0.20/0.51	    inference('cnf', [status(esa)], [kn2])).
0.20/0.51	tff('9', plain,
0.20/0.51	    (![X17, X18]:  is_a_theorem(implies(and(X17, X18), X17)))
0.20/0.51	      <= ((![X17, X18]:  is_a_theorem(implies(and(X17, X18), X17)))),
0.20/0.51	    inference('split', [status(esa)], ['8'])).
0.20/0.51	tff(and_1, axiom, ((![X,Y]: is_a_theorem(implies(and(X,Y),X))) <=> and_1)).
0.20/0.51	tff('10', plain,
0.20/0.51	    ![X41, X42]: ( is_a_theorem(implies(and(X41, X42), X41)) | ~ and_1),
0.20/0.51	    inference('cnf', [status(esa)], [and_1])).
0.20/0.51	tff('11', plain, (~ and_1) <= (~ ( and_1)),
0.20/0.51	    inference('split', [status(esa)], ['10'])).
0.20/0.51	tff(hilbert_and_1, axiom, (and_1)).
0.20/0.51	tff('12', plain,  and_1, inference('cnf', [status(esa)], [hilbert_and_1])).
0.20/0.51	tff('13', plain, ( and_1), inference('demod', [status(thm)], ['11', '12'])).
0.20/0.51	tff('14', plain,
0.20/0.51	    (![X17, X18]:  is_a_theorem(implies(and(X17, X18), X17))) | ~ ( and_1),
0.20/0.51	    inference('split', [status(esa)], ['10'])).
0.20/0.51	tff('15', plain, (![X17, X18]:  is_a_theorem(implies(and(X17, X18), X17))),
0.20/0.51	    inference('sat_resolution*', [status(thm)], ['13', '14'])).
0.20/0.51	tff('16', plain, ![X17, X18]:  is_a_theorem(implies(and(X17, X18), X17)),
0.20/0.51	    inference('simpl_trail', [status(thm)], ['9', '15'])).
0.20/0.51	tff(op_strict_implies, axiom,
0.20/0.51	  (op_strict_implies =>
0.20/0.51	   (![X,Y]: (necessarily(implies(X,Y)) = strict_implies(X,Y))))).
0.20/0.51	tff('17', plain,
0.20/0.51	    ![X105, X106]:
0.20/0.51	      (necessarily(implies(X105, X106)) = strict_implies(X105, X106)
0.20/0.51	       | ~ op_strict_implies),
0.20/0.51	    inference('cnf', [status(esa)], [op_strict_implies])).
0.20/0.51	tff('18', plain,
0.20/0.51	    (![X105, X106]:
0.20/0.51	       necessarily(implies(X105, X106)) = strict_implies(X105, X106))
0.20/0.51	      <= ((![X105, X106]:
0.20/0.51	             necessarily(implies(X105, X106)) = strict_implies(X105, X106))),
0.20/0.51	    inference('split', [status(esa)], ['17'])).
0.20/0.51	tff(s1_0_op_strict_implies, axiom, (op_strict_implies)).
0.20/0.51	tff('19', plain,  op_strict_implies,
0.20/0.51	    inference('cnf', [status(esa)], [s1_0_op_strict_implies])).
0.20/0.51	tff('20', plain, (~ op_strict_implies) <= (~ ( op_strict_implies)),
0.20/0.51	    inference('split', [status(esa)], ['17'])).
0.20/0.51	tff('21', plain, ( op_strict_implies),
0.20/0.51	    inference('sup-', [status(thm)], ['19', '20'])).
0.20/0.51	tff('22', plain,
0.20/0.51	    (![X105, X106]:
0.20/0.51	       necessarily(implies(X105, X106)) = strict_implies(X105, X106)) | 
0.20/0.51	    ~ ( op_strict_implies), inference('split', [status(esa)], ['17'])).
0.20/0.51	tff('23', plain,
0.20/0.51	    (![X105, X106]:
0.20/0.51	       necessarily(implies(X105, X106)) = strict_implies(X105, X106)),
0.20/0.51	    inference('sat_resolution*', [status(thm)], ['21', '22'])).
0.20/0.52	tff('24', plain,
0.20/0.52	    ![X105, X106]:
0.20/0.52	      necessarily(implies(X105, X106)) = strict_implies(X105, X106),
0.20/0.52	    inference('simpl_trail', [status(thm)], ['18', '23'])).
0.20/0.52	tff(necessitation, axiom,
0.20/0.52	  (necessitation <=>
0.20/0.52	   (![X]: (is_a_theorem(X) => is_a_theorem(necessarily(X)))))).
0.20/0.52	tff('25', plain,
0.20/0.52	    ![X83]:
0.20/0.52	      (~ is_a_theorem(X83)
0.20/0.52	       |  is_a_theorem(necessarily(X83))
0.20/0.52	       | ~ necessitation),
0.20/0.52	    inference('cnf', [status(esa)], [necessitation])).
0.20/0.52	tff('26', plain,
0.20/0.52	    (![X83]: (~ is_a_theorem(X83) |  is_a_theorem(necessarily(X83))))
0.20/0.52	      <= ((![X83]: (~ is_a_theorem(X83) |  is_a_theorem(necessarily(X83))))),
0.20/0.52	    inference('split', [status(esa)], ['25'])).
0.20/0.52	tff(km5_necessitation, axiom, (necessitation)).
0.20/0.52	tff('27', plain,  necessitation,
0.20/0.52	    inference('cnf', [status(esa)], [km5_necessitation])).
0.20/0.52	tff('28', plain, (~ necessitation) <= (~ ( necessitation)),
0.20/0.52	    inference('split', [status(esa)], ['25'])).
0.20/0.52	tff('29', plain, ( necessitation),
0.20/0.52	    inference('sup-', [status(thm)], ['27', '28'])).
0.20/0.52	tff('30', plain,
0.20/0.52	    (![X83]: (~ is_a_theorem(X83) |  is_a_theorem(necessarily(X83)))) | 
0.20/0.52	    ~ ( necessitation), inference('split', [status(esa)], ['25'])).
0.20/0.52	tff('31', plain,
0.20/0.52	    (![X83]: (~ is_a_theorem(X83) |  is_a_theorem(necessarily(X83)))),
0.20/0.52	    inference('sat_resolution*', [status(thm)], ['29', '30'])).
0.20/0.52	tff('32', plain,
0.20/0.52	    ![X83]: (~ is_a_theorem(X83) |  is_a_theorem(necessarily(X83))),
0.20/0.52	    inference('simpl_trail', [status(thm)], ['26', '31'])).
0.20/0.52	tff('33', plain,
0.20/0.52	    ![X0, X1]:
0.20/0.52	      ( is_a_theorem(strict_implies(X1, X0))
0.20/0.52	       | ~ is_a_theorem(implies(X1, X0))),
0.20/0.52	    inference('sup+', [status(thm)], ['24', '32'])).
0.20/0.52	tff('34', plain, ![X0, X1]:  is_a_theorem(strict_implies(and(X0, X1), X0)),
0.20/0.52	    inference('sup-', [status(thm)], ['16', '33'])).
0.20/0.52	tff('35', plain, $false, inference('demod', [status(thm)], ['7', '34'])).
0.20/0.52	
0.20/0.52	% SZS output end Refutation
0.20/0.52	
0.20/0.52	% Zipperpin 1.5 exiting
0.20/0.52	EOF