%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL042-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 : n019.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 7.63s 1.46s
% Output : CNFRefutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 26 ( 15 unt; 0 nHn; 12 RR)
% Number of literals : 41 ( 0 equ; 18 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 60 ( 3 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(cn_22,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_22) ).
cnf(cn_21,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_21) ).
cnf(cn_54,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
cnf(prove_cn_35,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_35) ).
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(X3,X1),implies(X3,X2)))),
cn_22 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
cn_21 ).
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_7,c_0_9]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
cn_54 ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(implies(implies(X4,X1),implies(X4,X2)),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
inference(fof_simplification,[status(thm)],[prove_cn_35]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(implies(X2,implies(X1,X3)),X4))
| is_a_theorem(implies(implies(X1,implies(X2,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X3,X2),X4))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X4))) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(not(X1),X2))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
c_0_17 ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(implies(X4,implies(X1,X3)),X5))
| is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),X5))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL042-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n019.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 00:02:07 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.42 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
% 7.63/1.46 % Version: 3.5.1
% 7.63/1.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.63/1.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.63/1.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.63/1.46 % Starting new_bool_3 with 300s (1) cores
% 7.63/1.46 % Starting new_bool_1 with 300s (1) cores
% 7.63/1.46 % Starting sh5l with 300s (1) cores
% 7.63/1.46 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1261634 completed with status 0
% 7.63/1.46 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.63/1.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.63/1.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.63/1.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.63/1.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.63/1.46 % No SInE strategy applied
% 7.63/1.46 % Search class: FHUNM-FFSF21-MFFFFFNN
% 7.63/1.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.63/1.46 % Starting SubtermCWHack with 136s (1) cores
% 7.63/1.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.63/1.46 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 7.63/1.46 % Starting new_bool_3 with 136s (1) cores
% 7.63/1.46 % Starting new_bool_1 with 136s (1) cores
% 7.63/1.46 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1261643 completed with status 0
% 7.63/1.46 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.63/1.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.63/1.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.63/1.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.63/1.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.63/1.46 % No SInE strategy applied
% 7.63/1.46 % Search class: FHUNM-FFSF21-MFFFFFNN
% 7.63/1.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.63/1.46 % Starting SubtermCWHack with 136s (1) cores
% 7.63/1.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.63/1.46 % Preprocessing time : 0.011 s
% 7.63/1.46
% 7.63/1.46 % Proof found!
% 7.63/1.46 % SZS status Unsatisfiable
% 7.63/1.46 % SZS output start CNFRefutation
% See solution above
% 7.63/1.46 % Parsed axioms : 7
% 7.63/1.46 % Removed by relevancy pruning/SinE : 0
% 7.63/1.46 % Initial clauses : 7
% 7.63/1.46 % Removed in clause preprocessing : 0
% 7.63/1.46 % Initial clauses in saturation : 7
% 7.63/1.46 % Processed clauses : 3216
% 7.63/1.46 % ...of these trivial : 43
% 7.63/1.46 % ...subsumed : 2372
% 7.63/1.46 % ...remaining for further processing : 801
% 7.63/1.46 % Other redundant clauses eliminated : 0
% 7.63/1.46 % Clauses deleted for lack of memory : 0
% 7.63/1.46 % Backward-subsumed : 8
% 7.63/1.46 % Backward-rewritten : 1
% 7.63/1.46 % Generated clauses : 66208
% 7.63/1.46 % ...of the previous two non-redundant : 59969
% 7.63/1.46 % ...aggressively subsumed : 0
% 7.63/1.46 % Contextual simplify-reflections : 0
% 7.63/1.46 % Paramodulations : 66208
% 7.63/1.46 % Factorizations : 0
% 7.63/1.46 % NegExts : 0
% 7.63/1.46 % Equation resolutions : 0
% 7.63/1.46 % Disequality decompositions : 0
% 7.63/1.46 % Total rewrite steps : 6751
% 7.63/1.46 % ...of those cached : 5081
% 7.63/1.46 % Propositional unsat checks : 0
% 7.63/1.46 % Propositional check models : 0
% 7.63/1.46 % Propositional check unsatisfiable : 0
% 7.63/1.46 % Propositional clauses : 0
% 7.63/1.46 % Propositional clauses after purity: 0
% 7.63/1.46 % Propositional unsat core size : 0
% 7.63/1.46 % Propositional preprocessing time : 0.000
% 7.63/1.46 % Propositional encoding time : 0.000
% 7.63/1.46 % Propositional solver time : 0.000
% 7.63/1.46 % Success case prop preproc time : 0.000
% 7.63/1.46 % Success case prop encoding time : 0.000
% 7.63/1.46 % Success case prop solver time : 0.000
% 7.63/1.46 % Current number of processed clauses : 792
% 7.63/1.46 % Positive orientable unit clauses : 226
% 7.63/1.46 % Positive unorientable unit clauses: 0
% 7.63/1.46 % Negative unit clauses : 19
% 7.63/1.46 % Non-unit-clauses : 547
% 7.63/1.46 % Current number of unprocessed clauses: 56623
% 7.63/1.46 % ...number of literals in the above : 123164
% 7.63/1.46 % Current number of archived formulas : 0
% 7.63/1.46 % Current number of archived clauses : 9
% 7.63/1.46 % Clause-clause subsumption calls (NU) : 97383
% 7.63/1.46 % Rec. Clause-clause subsumption calls : 78254
% 7.63/1.46 % Non-unit clause-clause subsumptions : 2313
% 7.63/1.46 % Unit Clause-clause subsumption calls : 2752
% 7.63/1.46 % Rewrite failures with RHS unbound : 0
% 7.63/1.46 % BW rewrite match attempts : 23372
% 7.63/1.46 % BW rewrite match successes : 1
% 7.63/1.46 % Condensation attempts : 0
% 7.63/1.46 % Condensation successes : 0
% 7.63/1.46 % Termbank termtop insertions : 999822
% 7.63/1.46 % Search garbage collected termcells : 8
% 7.63/1.46
% 7.63/1.46 % -------------------------------------------------
% 7.63/1.46 % User time : 0.886 s
% 7.63/1.46 % System time : 0.050 s
% 7.63/1.46 % Total time : 0.936 s
% 7.63/1.46 % Maximum resident set size: 3380 pages
% 7.63/1.46
% 7.63/1.46 % -------------------------------------------------
% 7.63/1.46 % User time : 4.616 s
% 7.63/1.46 % System time : 0.252 s
% 7.63/1.46 % Total time : 4.868 s
% 7.63/1.46 % Maximum resident set size: 4608 pages
% 7.63/1.46 % E exiting
%------------------------------------------------------------------------------