%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL111-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:48 PM UTC 2026
% Result : Unsatisfiable 0.22s 10.81s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 12 unt; 0 nHn; 11 RR)
% Number of literals : 33 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_1) ).
cnf(prove_mv_25,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(c,a),implies(c,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_25) ).
cnf(c_0_5,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_6,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv_2 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,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_6,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,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_9,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv_1 ).
cnf(c_0_13,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_9,c_0_8]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(c,a),implies(c,b)))),
inference(fof_simplification,[status(thm)],[prove_mv_25]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(c,a),implies(c,b)))),
c_0_15 ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL111-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/10.66 % Computer : n006.cluster.edu
% 0.18/10.66 % Model : x86_64 x86_64
% 0.18/10.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/10.66 % Memory : 8046.5625MB
% 0.18/10.66 % OS : Linux 6.8.0-71-generic
% 0.18/10.66 % CPULimit : 300
% 0.18/10.66 % WCLimit : 300
% 0.18/10.66 % DateTime : Mon Sep 21 00:05:25 UTC 2026
% 0.18/10.67 % CPUTime :
% 0.18/10.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/10.73 Running first-order theorem proving
% 0.22/10.73 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.22/10.81 % Version: 3.5.1
% 0.22/10.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/10.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/10.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/10.81 % Starting new_bool_3 with 300s (1) cores
% 0.22/10.81 % Starting new_bool_1 with 300s (1) cores
% 0.22/10.81 % Starting sh5l with 300s (1) cores
% 0.22/10.81 % new_bool_3 with pid 1593296 completed with status 0
% 0.22/10.81 % Result found by new_bool_3
% 0.22/10.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/10.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/10.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/10.81 % Starting new_bool_3 with 300s (1) cores
% 0.22/10.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/10.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/10.81 % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.22/10.81 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/10.81 % Starting SubtermCWHack with 31s (1) cores
% 0.22/10.81 % SubtermCWHack with pid 1593304 completed with status 0
% 0.22/10.81 % Result found by SubtermCWHack
% 0.22/10.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/10.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/10.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/10.81 % Starting new_bool_3 with 300s (1) cores
% 0.22/10.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/10.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/10.81 % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.22/10.81 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/10.81 % Starting SubtermCWHack with 31s (1) cores
% 0.22/10.81 % Preprocessing time : 0.002 s
% 0.22/10.81
% 0.22/10.81 % Proof found!
% 0.22/10.81 % SZS status Unsatisfiable
% 0.22/10.81 % SZS output start CNFRefutation
% See solution above
% 0.22/10.81 % Parsed axioms : 6
% 0.22/10.81 % Removed by relevancy pruning/SinE : 1
% 0.22/10.81 % Initial clauses : 5
% 0.22/10.81 % Removed in clause preprocessing : 0
% 0.22/10.81 % Initial clauses in saturation : 5
% 0.22/10.81 % Processed clauses : 340
% 0.22/10.81 % ...of these trivial : 9
% 0.22/10.81 % ...subsumed : 232
% 0.22/10.81 % ...remaining for further processing : 99
% 0.22/10.81 % Other redundant clauses eliminated : 0
% 0.22/10.81 % Clauses deleted for lack of memory : 0
% 0.22/10.81 % Backward-subsumed : 0
% 0.22/10.81 % Backward-rewritten : 3
% 0.22/10.81 % Generated clauses : 1690
% 0.22/10.81 % ...of the previous two non-redundant : 1388
% 0.22/10.81 % ...aggressively subsumed : 0
% 0.22/10.81 % Contextual simplify-reflections : 0
% 0.22/10.81 % Paramodulations : 1690
% 0.22/10.81 % Factorizations : 0
% 0.22/10.81 % NegExts : 0
% 0.22/10.81 % Equation resolutions : 0
% 0.22/10.81 % Disequality decompositions : 0
% 0.22/10.81 % Total rewrite steps : 266
% 0.22/10.81 % ...of those cached : 225
% 0.22/10.81 % Propositional unsat checks : 0
% 0.22/10.81 % Propositional check models : 0
% 0.22/10.81 % Propositional check unsatisfiable : 0
% 0.22/10.81 % Propositional clauses : 0
% 0.22/10.81 % Propositional clauses after purity: 0
% 0.22/10.81 % Propositional unsat core size : 0
% 0.22/10.81 % Propositional preprocessing time : 0.000
% 0.22/10.81 % Propositional encoding time : 0.000
% 0.22/10.81 % Propositional solver time : 0.000
% 0.22/10.81 % Success case prop preproc time : 0.000
% 0.22/10.81 % Success case prop encoding time : 0.000
% 0.22/10.81 % Success case prop solver time : 0.000
% 0.22/10.81 % Current number of processed clauses : 96
% 0.22/10.81 % Positive orientable unit clauses : 25
% 0.22/10.81 % Positive unorientable unit clauses: 0
% 0.22/10.81 % Negative unit clauses : 9
% 0.22/10.81 % Non-unit-clauses : 62
% 0.22/10.81 % Current number of unprocessed clauses: 1026
% 0.22/10.81 % ...number of literals in the above : 2552
% 0.22/10.81 % Current number of archived formulas : 0
% 0.22/10.81 % Current number of archived clauses : 3
% 0.22/10.81 % Clause-clause subsumption calls (NU) : 2169
% 0.22/10.81 % Rec. Clause-clause subsumption calls : 2169
% 0.22/10.81 % Non-unit clause-clause subsumptions : 222
% 0.22/10.81 % Unit Clause-clause subsumption calls : 311
% 0.22/10.81 % Rewrite failures with RHS unbound : 0
% 0.22/10.81 % BW rewrite match attempts : 594
% 0.22/10.81 % BW rewrite match successes : 3
% 0.22/10.81 % Condensation attempts : 0
% 0.22/10.81 % Condensation successes : 0
% 0.22/10.81 % Termbank termtop insertions : 19002
% 0.22/10.81 % Search garbage collected termcells : 14
% 0.22/10.81
% 0.22/10.81 % -------------------------------------------------
% 0.22/10.81 % User time : 0.038 s
% 0.22/10.81 % System time : 0.006 s
% 0.22/10.81 % Total time : 0.044 s
% 0.22/10.81 % Maximum resident set size: 3636 pages
% 0.22/10.81
% 0.22/10.81 % -------------------------------------------------
% 0.22/10.81 % User time : 0.040 s
% 0.22/10.81 % System time : 0.012 s
% 0.22/10.81 % Total time : 0.052 s
% 0.22/10.81 % Maximum resident set size: 4864 pages
% 0.22/10.81 % E exiting
%------------------------------------------------------------------------------