%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL365+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:12:30 PM UTC 2026
% Result : Theorem 26.11s 4.48s
% Output : CNFRefutation 26.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 23 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 31 ~; 25 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 91 ( 12 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(condensed_detachment,axiom,
! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(cn_1,axiom,
! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
fof(cn_2,axiom,
! [X1] : is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
fof(cn_3,axiom,
! [X1,X2] : is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(prove_cn_14,conjecture,
is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_14) ).
fof(c_0_5,plain,
! [X4,X5] :
( is_a_theorem(X5)
| ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(X4,X5)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[condensed_detachment])])]) ).
fof(c_0_6,plain,
! [X6,X7,X8] : is_a_theorem(implies(implies(X6,X7),implies(implies(X7,X8),implies(X6,X8)))),
inference(variable_rename,[status(thm)],[cn_1]) ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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]) ).
fof(c_0_10,plain,
! [X9] : is_a_theorem(implies(implies(not(X9),X9),X9)),
inference(variable_rename,[status(thm)],[cn_2]) ).
cnf(c_0_11,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]) ).
fof(c_0_12,plain,
! [X10,X11] : is_a_theorem(implies(X10,implies(not(X10),X11))),
inference(variable_rename,[status(thm)],[cn_3]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,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_11,c_0_9]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X1,implies(not(X2),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(not(X2),not(X1)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_21,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(assume_negation,[status(cth)],[prove_cn_14]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(implies(X2,X4))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
fof(c_0_23,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X3,implies(X2,X4)))
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(implies(not(X2),X4),X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
fof(c_0_27,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(implies(X1,implies(X4,X2)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3)))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(implies(X1,implies(X3,X5)))
| ~ is_a_theorem(implies(X2,implies(X5,X4)))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(implies(implies(X3,X5),implies(X2,X5)),X4))
| is_a_theorem(implies(X1,implies(implies(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_22,c_0_8]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ is_a_theorem(implies(implies(not(z),y),implies(x,implies(implies(y,z),z)))),
inference(spm,[status(thm)],[c_0_31,c_0_9]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(X1,implies(X3,X4)))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X3),implies(implies(X3,X2),X2)))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL365+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.56 % Computer : n017.cluster.edu
% 0.11/0.56 % Model : x86_64 x86_64
% 0.11/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.56 % Memory : 8046.5625MB
% 0.11/0.56 % OS : Linux 6.8.0-71-generic
% 0.11/0.56 % CPULimit : 300
% 0.11/0.56 % WCLimit : 300
% 0.11/0.56 % DateTime : Mon Sep 21 00:19:27 UTC 2026
% 0.11/0.56 % CPUTime :
% 0.11/0.56 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.61 Running first-order theorem proving
% 0.11/0.61 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
% 26.11/4.48 % Version: 3.5.1
% 26.11/4.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.11/4.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.11/4.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.11/4.48 % Starting new_bool_3 with 300s (1) cores
% 26.11/4.48 % Starting new_bool_1 with 300s (1) cores
% 26.11/4.48 % Starting sh5l with 300s (1) cores
% 26.11/4.48 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1011638 completed with status 0
% 26.11/4.48 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 26.11/4.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.11/4.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.11/4.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.11/4.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.11/4.48 % No SInE strategy applied
% 26.11/4.48 % Search class: FHUNS-FFSF21-MFFFFFNN
% 26.11/4.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.11/4.48 % Starting SubtermCWHack with 136s (1) cores
% 26.11/4.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.11/4.48 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 26.11/4.48 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 26.11/4.48 % Starting new_bool_3 with 136s (1) cores
% 26.11/4.48 % H----_011_C07_F1_PI_SE_SP_S0V with pid 1011647 completed with status 0
% 26.11/4.48 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 26.11/4.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.11/4.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.11/4.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.11/4.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.11/4.48 % No SInE strategy applied
% 26.11/4.48 % Search class: FHUNS-FFSF21-MFFFFFNN
% 26.11/4.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.11/4.48 % Starting SubtermCWHack with 136s (1) cores
% 26.11/4.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.11/4.48 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 26.11/4.48 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 26.11/4.48 % Preprocessing time : 0.001 s
% 26.11/4.48
% 26.11/4.48 % Proof found!
% 26.11/4.48 % SZS status Theorem
% 26.11/4.48 % SZS output start CNFRefutation
% See solution above
% 26.11/4.48 % Parsed axioms : 5
% 26.11/4.48 % Removed by relevancy pruning/SinE : 0
% 26.11/4.48 % Initial clauses : 5
% 26.11/4.48 % Removed in clause preprocessing : 0
% 26.11/4.48 % Initial clauses in saturation : 5
% 26.11/4.48 % Processed clauses : 26139
% 26.11/4.48 % ...of these trivial : 240
% 26.11/4.48 % ...subsumed : 23817
% 26.11/4.48 % ...remaining for further processing : 2082
% 26.11/4.48 % Other redundant clauses eliminated : 0
% 26.11/4.48 % Clauses deleted for lack of memory : 0
% 26.11/4.48 % Backward-subsumed : 234
% 26.11/4.48 % Backward-rewritten : 6
% 26.11/4.48 % Generated clauses : 141344
% 26.11/4.48 % ...of the previous two non-redundant : 137278
% 26.11/4.48 % ...aggressively subsumed : 0
% 26.11/4.48 % Contextual simplify-reflections : 0
% 26.11/4.48 % Paramodulations : 141344
% 26.11/4.48 % Factorizations : 0
% 26.11/4.48 % NegExts : 0
% 26.11/4.48 % Equation resolutions : 0
% 26.11/4.48 % Disequality decompositions : 0
% 26.11/4.48 % Total rewrite steps : 4483
% 26.11/4.48 % ...of those cached : 3976
% 26.11/4.48 % Propositional unsat checks : 0
% 26.11/4.48 % Propositional check models : 0
% 26.11/4.48 % Propositional check unsatisfiable : 0
% 26.11/4.48 % Propositional clauses : 0
% 26.11/4.48 % Propositional clauses after purity: 0
% 26.11/4.48 % Propositional unsat core size : 0
% 26.11/4.48 % Propositional preprocessing time : 0.000
% 26.11/4.48 % Propositional encoding time : 0.000
% 26.11/4.48 % Propositional solver time : 0.000
% 26.11/4.48 % Success case prop preproc time : 0.000
% 26.11/4.48 % Success case prop encoding time : 0.000
% 26.11/4.48 % Success case prop solver time : 0.000
% 26.11/4.48 % Current number of processed clauses : 1842
% 26.11/4.48 % Positive orientable unit clauses : 107
% 26.11/4.48 % Positive unorientable unit clauses: 0
% 26.11/4.48 % Negative unit clauses : 107
% 26.11/4.48 % Non-unit-clauses : 1628
% 26.11/4.48 % Current number of unprocessed clauses: 110899
% 26.11/4.48 % ...number of literals in the above : 397841
% 26.11/4.48 % Current number of archived formulas : 0
% 26.11/4.48 % Current number of archived clauses : 240
% 26.11/4.48 % Clause-clause subsumption calls (NU) : 469978
% 26.11/4.48 % Rec. Clause-clause subsumption calls : 325071
% 26.11/4.48 % Non-unit clause-clause subsumptions : 18801
% 26.11/4.48 % Unit Clause-clause subsumption calls : 12038
% 26.11/4.48 % Rewrite failures with RHS unbound : 0
% 26.11/4.48 % BW rewrite match attempts : 16729
% 26.11/4.48 % BW rewrite match successes : 7
% 26.11/4.48 % Condensation attempts : 0
% 26.11/4.48 % Condensation successes : 0
% 26.11/4.48 % Termbank termtop insertions : 2168970
% 26.11/4.48 % Search garbage collected termcells : 19
% 26.11/4.48
% 26.11/4.48 % -------------------------------------------------
% 26.11/4.48 % User time : 3.609 s
% 26.11/4.48 % System time : 0.115 s
% 26.11/4.48 % Total time : 3.724 s
% 26.11/4.48 % Maximum resident set size: 3636 pages
% 26.11/4.48
% 26.11/4.48 % -------------------------------------------------
% 26.11/4.48 % User time : 18.133 s
% 26.11/4.48 % System time : 0.664 s
% 26.11/4.48 % Total time : 18.797 s
% 26.11/4.48 % Maximum resident set size: 4608 pages
% 26.11/4.48 % E exiting
%------------------------------------------------------------------------------