%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL040-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 : n003.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:36 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.48s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 51 ( 7 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(cn_35,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
cnf(prove_cn_21,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_21) ).
cnf(c_0_4,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_5,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_4 ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_7,plain,
( ~ is_a_theorem(implies(X1,implies(X2,X3)))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X1),X3),X3))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
inference(fof_simplification,[status(thm)],[prove_cn_21]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X1,X3)),X4))
| is_a_theorem(implies(implies(X1,implies(X2,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
c_0_18 ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL040-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 00:03:33 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 0.12/0.48 % Version: 3.5.1
% 0.12/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.48 % Starting sh5l with 300s (1) cores
% 0.12/0.48 % new_bool_3 with pid 2967422 completed with status 0
% 0.12/0.48 % Result found by new_bool_3
% 0.12/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.48 % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.12/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.48 % SubtermCWHack with pid 2967427 completed with status 0
% 0.12/0.48 % Result found by SubtermCWHack
% 0.12/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.48 % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.12/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.48 % Preprocessing time : 0.001 s
% 0.12/0.48
% 0.12/0.48 % Proof found!
% 0.12/0.48 % SZS status Unsatisfiable
% 0.12/0.48 % SZS output start CNFRefutation
% See solution above
% 0.12/0.48 % Parsed axioms : 7
% 0.12/0.48 % Removed by relevancy pruning/SinE : 3
% 0.12/0.48 % Initial clauses : 4
% 0.12/0.48 % Removed in clause preprocessing : 0
% 0.12/0.48 % Initial clauses in saturation : 4
% 0.12/0.48 % Processed clauses : 556
% 0.12/0.48 % ...of these trivial : 11
% 0.12/0.48 % ...subsumed : 404
% 0.12/0.48 % ...remaining for further processing : 141
% 0.12/0.48 % Other redundant clauses eliminated : 0
% 0.12/0.48 % Clauses deleted for lack of memory : 0
% 0.12/0.48 % Backward-subsumed : 0
% 0.12/0.48 % Backward-rewritten : 2
% 0.12/0.48 % Generated clauses : 3079
% 0.12/0.48 % ...of the previous two non-redundant : 2252
% 0.12/0.48 % ...aggressively subsumed : 0
% 0.12/0.48 % Contextual simplify-reflections : 0
% 0.12/0.48 % Paramodulations : 3079
% 0.12/0.48 % Factorizations : 0
% 0.12/0.48 % NegExts : 0
% 0.12/0.48 % Equation resolutions : 0
% 0.12/0.48 % Disequality decompositions : 0
% 0.12/0.48 % Total rewrite steps : 803
% 0.12/0.48 % ...of those cached : 638
% 0.12/0.48 % Propositional unsat checks : 0
% 0.12/0.48 % Propositional check models : 0
% 0.12/0.48 % Propositional check unsatisfiable : 0
% 0.12/0.48 % Propositional clauses : 0
% 0.12/0.48 % Propositional clauses after purity: 0
% 0.12/0.48 % Propositional unsat core size : 0
% 0.12/0.48 % Propositional preprocessing time : 0.000
% 0.12/0.48 % Propositional encoding time : 0.000
% 0.12/0.48 % Propositional solver time : 0.000
% 0.12/0.48 % Success case prop preproc time : 0.000
% 0.12/0.48 % Success case prop encoding time : 0.000
% 0.12/0.48 % Success case prop solver time : 0.000
% 0.12/0.48 % Current number of processed clauses : 139
% 0.12/0.48 % Positive orientable unit clauses : 46
% 0.12/0.48 % Positive unorientable unit clauses: 0
% 0.12/0.48 % Negative unit clauses : 11
% 0.12/0.48 % Non-unit-clauses : 82
% 0.12/0.48 % Current number of unprocessed clauses: 1697
% 0.12/0.48 % ...number of literals in the above : 3813
% 0.12/0.48 % Current number of archived formulas : 0
% 0.12/0.48 % Current number of archived clauses : 2
% 0.12/0.48 % Clause-clause subsumption calls (NU) : 3475
% 0.12/0.48 % Rec. Clause-clause subsumption calls : 3472
% 0.12/0.48 % Non-unit clause-clause subsumptions : 380
% 0.12/0.48 % Unit Clause-clause subsumption calls : 227
% 0.12/0.48 % Rewrite failures with RHS unbound : 0
% 0.12/0.48 % BW rewrite match attempts : 1310
% 0.12/0.48 % BW rewrite match successes : 2
% 0.12/0.48 % Condensation attempts : 0
% 0.12/0.48 % Condensation successes : 0
% 0.12/0.48 % Termbank termtop insertions : 34510
% 0.12/0.48 % Search garbage collected termcells : 21
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.040 s
% 0.12/0.48 % System time : 0.003 s
% 0.12/0.48 % Total time : 0.043 s
% 0.12/0.48 % Maximum resident set size: 3636 pages
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.042 s
% 0.12/0.48 % System time : 0.007 s
% 0.12/0.48 % Total time : 0.049 s
% 0.12/0.48 % Maximum resident set size: 4608 pages
% 0.12/0.48 % E exiting
%------------------------------------------------------------------------------