%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL384+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 : n020.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:35 PM UTC 2026
% Result : Theorem 35.90s 5.81s
% Output : CNFRefutation 35.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 51 ( 24 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 81 ( 42 ~; 37 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 112 ( 19 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_45,conjecture,
is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_45) ).
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]) ).
cnf(c_0_21,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]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(X4,X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(not(X1),X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_22]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(implies(X2,X3),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_8]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,implies(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_9]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(implies(implies(not(X2),X4),X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_34,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]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4))
| is_a_theorem(implies(X1,implies(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_31]) ).
cnf(c_0_36,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_13]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_38,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(assume_negation,[status(cth)],[prove_cn_45]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3))
| is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4))) ),
inference(spm,[status(thm)],[c_0_35,c_0_8]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_41,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(fof_simplification,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_43,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(fof_nnf,[status(thm)],[c_0_41]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,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_47,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_39,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_16,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL384+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n020.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 00:27:17 UTC 2026
% 0.15/0.38 % CPUTime :
% 0.15/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 35.90/5.81 % Version: 3.5.1
% 35.90/5.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 35.90/5.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.90/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 35.90/5.81 % Starting new_bool_3 with 300s (1) cores
% 35.90/5.81 % Starting new_bool_1 with 300s (1) cores
% 35.90/5.81 % Starting sh5l with 300s (1) cores
% 35.90/5.81 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1597725 completed with status 0
% 35.90/5.81 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 35.90/5.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 35.90/5.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.90/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 35.90/5.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.90/5.81 % No SInE strategy applied
% 35.90/5.81 % Search class: FHUNS-FFSF21-MFFFFFNN
% 35.90/5.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.90/5.81 % Starting SubtermCWHack with 136s (1) cores
% 35.90/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 35.90/5.81 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 35.90/5.81 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 35.90/5.81 % Starting new_bool_3 with 136s (1) cores
% 35.90/5.81 % H----_011_C07_F1_PI_SE_SP_S0V with pid 1597735 completed with status 0
% 35.90/5.81 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 35.90/5.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 35.90/5.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.90/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 35.90/5.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.90/5.81 % No SInE strategy applied
% 35.90/5.81 % Search class: FHUNS-FFSF21-MFFFFFNN
% 35.90/5.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.90/5.81 % Starting SubtermCWHack with 136s (1) cores
% 35.90/5.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 35.90/5.81 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 35.90/5.81 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 35.90/5.81 % Preprocessing time : 0.001 s
% 35.90/5.81
% 35.90/5.81 % Proof found!
% 35.90/5.81 % SZS status Theorem
% 35.90/5.81 % SZS output start CNFRefutation
% See solution above
% 35.90/5.81 % Parsed axioms : 5
% 35.90/5.81 % Removed by relevancy pruning/SinE : 0
% 35.90/5.81 % Initial clauses : 5
% 35.90/5.81 % Removed in clause preprocessing : 0
% 35.90/5.81 % Initial clauses in saturation : 5
% 35.90/5.81 % Processed clauses : 37760
% 35.90/5.81 % ...of these trivial : 362
% 35.90/5.81 % ...subsumed : 34362
% 35.90/5.81 % ...remaining for further processing : 3036
% 35.90/5.81 % Other redundant clauses eliminated : 0
% 35.90/5.81 % Clauses deleted for lack of memory : 0
% 35.90/5.81 % Backward-subsumed : 196
% 35.90/5.81 % Backward-rewritten : 6
% 35.90/5.81 % Generated clauses : 141523
% 35.90/5.81 % ...of the previous two non-redundant : 136436
% 35.90/5.81 % ...aggressively subsumed : 0
% 35.90/5.81 % Contextual simplify-reflections : 0
% 35.90/5.81 % Paramodulations : 141523
% 35.90/5.81 % Factorizations : 0
% 35.90/5.81 % NegExts : 0
% 35.90/5.81 % Equation resolutions : 0
% 35.90/5.81 % Disequality decompositions : 0
% 35.90/5.81 % Total rewrite steps : 5567
% 35.90/5.81 % ...of those cached : 4995
% 35.90/5.81 % Propositional unsat checks : 0
% 35.90/5.81 % Propositional check models : 0
% 35.90/5.81 % Propositional check unsatisfiable : 0
% 35.90/5.81 % Propositional clauses : 0
% 35.90/5.81 % Propositional clauses after purity: 0
% 35.90/5.81 % Propositional unsat core size : 0
% 35.90/5.81 % Propositional preprocessing time : 0.000
% 35.90/5.81 % Propositional encoding time : 0.000
% 35.90/5.81 % Propositional solver time : 0.000
% 35.90/5.81 % Success case prop preproc time : 0.000
% 35.90/5.81 % Success case prop encoding time : 0.000
% 35.90/5.81 % Success case prop solver time : 0.000
% 35.90/5.81 % Current number of processed clauses : 2834
% 35.90/5.81 % Positive orientable unit clauses : 146
% 35.90/5.81 % Positive unorientable unit clauses: 0
% 35.90/5.81 % Negative unit clauses : 50
% 35.90/5.81 % Non-unit-clauses : 2638
% 35.90/5.81 % Current number of unprocessed clauses: 98253
% 35.90/5.81 % ...number of literals in the above : 370710
% 35.90/5.81 % Current number of archived formulas : 0
% 35.90/5.81 % Current number of archived clauses : 202
% 35.90/5.81 % Clause-clause subsumption calls (NU) : 1658473
% 35.90/5.81 % Rec. Clause-clause subsumption calls : 318174
% 35.90/5.81 % Non-unit clause-clause subsumptions : 26920
% 35.90/5.81 % Unit Clause-clause subsumption calls : 7096
% 35.90/5.81 % Rewrite failures with RHS unbound : 0
% 35.90/5.81 % BW rewrite match attempts : 20915
% 35.90/5.81 % BW rewrite match successes : 6
% 35.90/5.81 % Condensation attempts : 0
% 35.90/5.81 % Condensation successes : 0
% 35.90/5.81 % Termbank termtop insertions : 2271594
% 35.90/5.81 % Search garbage collected termcells : 19
% 35.90/5.81
% 35.90/5.81 % -------------------------------------------------
% 35.90/5.81 % User time : 5.076 s
% 35.90/5.81 % System time : 0.109 s
% 35.90/5.81 % Total time : 5.185 s
% 35.90/5.81 % Maximum resident set size: 3380 pages
% 35.90/5.81
% 35.90/5.81 % -------------------------------------------------
% 35.90/5.81 % User time : 24.446 s
% 35.90/5.81 % System time : 0.860 s
% 35.90/5.81 % Total time : 25.305 s
% 35.90/5.81 % Maximum resident set size: 4608 pages
% 35.90/5.81 % E exiting
%------------------------------------------------------------------------------