%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL116-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:11:49 PM UTC 2026
% Result : Unsatisfiable 165.87s 24.93s
% Output : CNFRefutation 165.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of clauses : 44 ( 25 unt; 0 nHn; 16 RR)
% Number of literals : 70 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 94 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
cnf(prove_mv_50,negated_conjecture,
~ is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_50) ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_6 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv_2 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv_3 ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv_1 ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
mv_5 ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(implies(X2,X1),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X1,implies(not(X3),not(X2))))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X1,implies(implies(X3,X2),X2)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(not(X3),not(X2)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(not(not(X1)),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(implies(X1,not(not(X1))),X2),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_29]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(not(X1)),X2))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(X1,implies(implies(X3,not(not(X3))),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_32]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))),
inference(spm,[status(thm)],[c_0_34,c_0_8]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(X1,implies(X3,not(X2))))
| is_a_theorem(implies(X1,implies(X2,not(X3)))) ),
inference(spm,[status(thm)],[c_0_12,c_0_35]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),not(not(X2))))),
inference(spm,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))),
inference(fof_simplification,[status(thm)],[prove_mv_50]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,implies(not(X2),not(implies(X1,X2))))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))),
c_0_39 ).
cnf(c_0_42,plain,
is_a_theorem(implies(not(X1),implies(X2,not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_30,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL116-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n001.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:11:28 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.40 Running first-order theorem proving
% 0.02/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 165.87/24.93 % Version: 3.5.1
% 165.87/24.93 % Preprocessing class: FSSSSMSSSSSNFFN.
% 165.87/24.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.87/24.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 165.87/24.93 % Starting new_bool_3 with 300s (1) cores
% 165.87/24.93 % Starting new_bool_1 with 300s (1) cores
% 165.87/24.93 % Starting sh5l with 300s (1) cores
% 165.87/24.93 % new_bool_1 with pid 1780943 completed with status 0
% 165.87/24.93 % Result found by new_bool_1
% 165.87/24.93 % Preprocessing class: FSSSSMSSSSSNFFN.
% 165.87/24.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.87/24.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 165.87/24.93 % Starting new_bool_3 with 300s (1) cores
% 165.87/24.93 % Starting new_bool_1 with 300s (1) cores
% 165.87/24.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 165.87/24.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 165.87/24.93 % Search class: FHUNM-FFSF21-MFFFFFNN
% 165.87/24.93 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 165.87/24.93 % Starting SubtermCWHack with 31s (1) cores
% 165.87/24.93 % SubtermCWHack with pid 1780951 completed with status 0
% 165.87/24.93 % Result found by SubtermCWHack
% 165.87/24.93 % Preprocessing class: FSSSSMSSSSSNFFN.
% 165.87/24.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.87/24.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 165.87/24.93 % Starting new_bool_3 with 300s (1) cores
% 165.87/24.93 % Starting new_bool_1 with 300s (1) cores
% 165.87/24.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 165.87/24.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 165.87/24.93 % Search class: FHUNM-FFSF21-MFFFFFNN
% 165.87/24.93 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 165.87/24.93 % Starting SubtermCWHack with 31s (1) cores
% 165.87/24.93 % Preprocessing time : 0.001 s
% 165.87/24.93
% 165.87/24.93 % Proof found!
% 165.87/24.93 % SZS status Unsatisfiable
% 165.87/24.93 % SZS output start CNFRefutation
% See solution above
% 165.87/24.93 % Parsed axioms : 6
% 165.87/24.93 % Removed by relevancy pruning/SinE : 0
% 165.87/24.93 % Initial clauses : 6
% 165.87/24.93 % Removed in clause preprocessing : 0
% 165.87/24.93 % Initial clauses in saturation : 6
% 165.87/24.93 % Processed clauses : 58765
% 165.87/24.93 % ...of these trivial : 3520
% 165.87/24.93 % ...subsumed : 50141
% 165.87/24.93 % ...remaining for further processing : 5104
% 165.87/24.93 % Other redundant clauses eliminated : 0
% 165.87/24.93 % Clauses deleted for lack of memory : 0
% 165.87/24.93 % Backward-subsumed : 82
% 165.87/24.93 % Backward-rewritten : 34
% 165.87/24.93 % Generated clauses : 2454449
% 165.87/24.93 % ...of the previous two non-redundant : 2321675
% 165.87/24.93 % ...aggressively subsumed : 0
% 165.87/24.93 % Contextual simplify-reflections : 0
% 165.87/24.93 % Paramodulations : 2454449
% 165.87/24.93 % Factorizations : 0
% 165.87/24.93 % NegExts : 0
% 165.87/24.93 % Equation resolutions : 0
% 165.87/24.93 % Disequality decompositions : 0
% 165.87/24.93 % Total rewrite steps : 144979
% 165.87/24.93 % ...of those cached : 128768
% 165.87/24.93 % Propositional unsat checks : 0
% 165.87/24.93 % Propositional check models : 0
% 165.87/24.93 % Propositional check unsatisfiable : 0
% 165.87/24.93 % Propositional clauses : 0
% 165.87/24.93 % Propositional clauses after purity: 0
% 165.87/24.93 % Propositional unsat core size : 0
% 165.87/24.93 % Propositional preprocessing time : 0.000
% 165.87/24.93 % Propositional encoding time : 0.000
% 165.87/24.93 % Propositional solver time : 0.000
% 165.87/24.93 % Success case prop preproc time : 0.000
% 165.87/24.93 % Success case prop encoding time : 0.000
% 165.87/24.93 % Success case prop solver time : 0.000
% 165.87/24.93 % Current number of processed clauses : 4988
% 165.87/24.93 % Positive orientable unit clauses : 1340
% 165.87/24.93 % Positive unorientable unit clauses: 0
% 165.87/24.93 % Negative unit clauses : 14
% 165.87/24.93 % Non-unit-clauses : 3634
% 165.87/24.93 % Current number of unprocessed clauses: 2253246
% 165.87/24.93 % ...number of literals in the above : 5667561
% 165.87/24.93 % Current number of archived formulas : 0
% 165.87/24.93 % Current number of archived clauses : 116
% 165.87/24.93 % Clause-clause subsumption calls (NU) : 1652553
% 165.87/24.93 % Rec. Clause-clause subsumption calls : 1625833
% 165.87/24.93 % Non-unit clause-clause subsumptions : 50189
% 165.87/24.93 % Unit Clause-clause subsumption calls : 95758
% 165.87/24.93 % Rewrite failures with RHS unbound : 0
% 165.87/24.93 % BW rewrite match attempts : 606651
% 165.87/24.93 % BW rewrite match successes : 34
% 165.87/24.93 % Condensation attempts : 0
% 165.87/24.93 % Condensation successes : 0
% 165.87/24.93 % Termbank termtop insertions : 38252095
% 165.87/24.93 % Search garbage collected termcells : 8
% 165.87/24.93
% 165.87/24.93 % -------------------------------------------------
% 165.87/24.93 % User time : 22.213 s
% 165.87/24.93 % System time : 1.073 s
% 165.87/24.93 % Total time : 23.287 s
% 165.87/24.93 % Maximum resident set size: 3636 pages
% 165.87/24.93
% 165.87/24.93 % -------------------------------------------------
% 165.87/24.93 % User time : 22.213 s
% 165.87/24.93 % System time : 1.080 s
% 165.87/24.93 % Total time : 23.294 s
% 165.87/24.93 % Maximum resident set size: 4608 pages
% 165.87/24.93 % E exiting
%------------------------------------------------------------------------------