%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:18:13 PM UTC 2026
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 13 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 13 ( 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 : 94 ( 24 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(condensed_detachment,axiom,
! [X1,X2] :
( is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(a5,axiom,
! [X3,X4,X5,X6,X7] : is_a_theorem(implies(implies(X3,X4),implies(implies(implies(X5,implies(X6,X7)),implies(X4,implies(not(X6),not(X3)))),implies(X3,X6)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5) ).
fof(prove_cn_1,conjecture,
! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X5),implies(X3,X5)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_1) ).
fof(c_0_3,plain,
! [X1,X2] :
( is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
fof(c_0_4,plain,
! [X8,X9] :
( is_a_theorem(X9)
| ~ is_a_theorem(X8)
| ~ is_a_theorem(implies(X8,X9)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_3])]) ).
fof(c_0_5,plain,
! [X10,X11,X12,X13,X14] : is_a_theorem(implies(implies(X10,X11),implies(implies(implies(X12,implies(X13,X14)),implies(X11,implies(not(X13),not(X10)))),implies(X10,X13)))),
inference(variable_rename,[status(thm)],[a5]) ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X4,X5)),implies(X2,implies(not(X4),not(X1)))),implies(X1,X4)))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(X5,X4))
| is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,implies(not(X2),not(X5)))),implies(X5,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(implies(implies(implies(X4,implies(X5,X6)),implies(X7,implies(not(X5),not(X8)))),implies(X8,X5)),implies(not(X2),not(implies(X8,X7))))),implies(implies(X8,X7),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(implies(X4,implies(X3,X5)),implies(implies(implies(implies(X6,implies(X7,X8)),implies(X2,implies(not(X7),not(X1)))),implies(X1,X7)),implies(not(X3),not(implies(X1,X2))))))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X4,X5)),implies(implies(X1,X6),implies(not(X4),not(implies(implies(X7,implies(X6,X8)),implies(X2,implies(not(X6),not(X1)))))))),implies(implies(implies(X7,implies(X6,X8)),implies(X2,implies(not(X6),not(X1)))),X4)))),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
fof(c_0_12,negated_conjecture,
~ ! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X5),implies(X3,X5)))),
inference(assume_negation,[status(cth)],[prove_cn_1]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(implies(implies(implies(X4,implies(X5,X6)),implies(implies(X7,X8),implies(not(X5),not(implies(implies(X9,implies(X8,X10)),implies(X11,implies(not(X8),not(X7)))))))),implies(implies(implies(X9,implies(X8,X10)),implies(X11,implies(not(X8),not(X7)))),X5)),implies(not(X2),not(implies(X7,X11))))),implies(implies(X7,X11),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(implies(X4,implies(X3,X5)),implies(implies(implies(implies(X6,implies(X7,X8)),implies(implies(X1,X9),implies(not(X7),not(implies(implies(X10,implies(X9,X11)),implies(X2,implies(not(X9),not(X1)))))))),implies(implies(implies(X10,implies(X9,X11)),implies(X2,implies(not(X9),not(X1)))),X7)),implies(not(X3),not(implies(X1,X2))))))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(implies(implies(X4,X5),X6),implies(not(X2),not(implies(implies(X7,implies(X6,X8)),implies(implies(implies(implies(X9,implies(X10,X11)),implies(X5,implies(not(X10),not(X4)))),implies(X4,X10)),implies(not(X6),not(implies(X4,X5))))))))),implies(implies(implies(X7,implies(X6,X8)),implies(implies(implies(implies(X9,implies(X10,X11)),implies(X5,implies(not(X10),not(X4)))),implies(X4,X10)),implies(not(X6),not(implies(X4,X5))))),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
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.03 % Problem : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 01:15:06 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/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
% 0.16/0.45 % Version: 3.5.1
% 0.16/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % Starting sh5l with 300s (1) cores
% 0.16/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3843819 completed with status 0
% 0.16/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.45 % No SInE strategy applied
% 0.16/0.45 % Search class: FHUNF-FFSF21-DFFFFFNN
% 0.16/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 136s (1) cores
% 0.16/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.46 % new_bool_3 with pid 3843826 completed with status 0
% 0.16/0.46 % Result found by new_bool_3
% 0.16/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.46 % No SInE strategy applied
% 0.16/0.46 % Search class: FHUNF-FFSF21-DFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 136s (1) cores
% 0.16/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.46 % Preprocessing time : 0.002 s
% 0.16/0.46 % Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 % Proof found!
% 0.16/0.46 % SZS status Theorem
% 0.16/0.46 % SZS output start CNFRefutation
% See solution above
% 0.16/0.46 % Parsed axioms : 3
% 0.16/0.46 % Removed by relevancy pruning/SinE : 0
% 0.16/0.46 % Initial clauses : 3
% 0.16/0.46 % Removed in clause preprocessing : 0
% 0.16/0.46 % Initial clauses in saturation : 3
% 0.16/0.46 % Processed clauses : 15
% 0.16/0.46 % ...of these trivial : 0
% 0.16/0.46 % ...subsumed : 0
% 0.16/0.46 % ...remaining for further processing : 15
% 0.16/0.46 % Other redundant clauses eliminated : 0
% 0.16/0.46 % Clauses deleted for lack of memory : 0
% 0.16/0.46 % Backward-subsumed : 0
% 0.16/0.46 % Backward-rewritten : 1
% 0.16/0.46 % Generated clauses : 24
% 0.16/0.46 % ...of the previous two non-redundant : 21
% 0.16/0.46 % ...aggressively subsumed : 0
% 0.16/0.46 % Contextual simplify-reflections : 0
% 0.16/0.46 % Paramodulations : 24
% 0.16/0.46 % Factorizations : 0
% 0.16/0.46 % NegExts : 0
% 0.16/0.46 % Equation resolutions : 0
% 0.16/0.46 % Disequality decompositions : 0
% 0.16/0.46 % Total rewrite steps : 1
% 0.16/0.46 % ...of those cached : 0
% 0.16/0.46 % Propositional unsat checks : 0
% 0.16/0.46 % Propositional check models : 0
% 0.16/0.46 % Propositional check unsatisfiable : 0
% 0.16/0.46 % Propositional clauses : 0
% 0.16/0.46 % Propositional clauses after purity: 0
% 0.16/0.46 % Propositional unsat core size : 0
% 0.16/0.46 % Propositional preprocessing time : 0.000
% 0.16/0.46 % Propositional encoding time : 0.000
% 0.16/0.46 % Propositional solver time : 0.000
% 0.16/0.46 % Success case prop preproc time : 0.000
% 0.16/0.46 % Success case prop encoding time : 0.000
% 0.16/0.46 % Success case prop solver time : 0.000
% 0.16/0.46 % Current number of processed clauses : 11
% 0.16/0.46 % Positive orientable unit clauses : 6
% 0.16/0.46 % Positive unorientable unit clauses: 0
% 0.16/0.46 % Negative unit clauses : 0
% 0.16/0.46 % Non-unit-clauses : 5
% 0.16/0.46 % Current number of unprocessed clauses: 12
% 0.16/0.46 % ...number of literals in the above : 13
% 0.16/0.46 % Current number of archived formulas : 0
% 0.16/0.46 % Current number of archived clauses : 4
% 0.16/0.46 % Clause-clause subsumption calls (NU) : 2
% 0.16/0.46 % Rec. Clause-clause subsumption calls : 2
% 0.16/0.46 % Non-unit clause-clause subsumptions : 0
% 0.16/0.46 % Unit Clause-clause subsumption calls : 2
% 0.16/0.46 % Rewrite failures with RHS unbound : 0
% 0.16/0.46 % BW rewrite match attempts : 36
% 0.16/0.46 % BW rewrite match successes : 1
% 0.16/0.46 % Condensation attempts : 0
% 0.16/0.46 % Condensation successes : 0
% 0.16/0.46 % Termbank termtop insertions : 2059
% 0.16/0.46 % Search garbage collected termcells : 30
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.008 s
% 0.16/0.46 % System time : 0.002 s
% 0.16/0.46 % Total time : 0.010 s
% 0.16/0.46 % Maximum resident set size: 3636 pages
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.035 s
% 0.16/0.46 % System time : 0.017 s
% 0.16/0.46 % Total time : 0.052 s
% 0.16/0.46 % Maximum resident set size: 4608 pages
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------