%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL365-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 : Unsatisfiable 26.21s 4.43s
% Output : CNFRefutation 26.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of clauses : 38 ( 18 unt; 0 nHn; 16 RR)
% Number of literals : 65 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 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 : 85 ( 13 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_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(prove_cn_14,negated_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) ).
cnf(c_0_5,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_6,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,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_6,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_11,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_9,c_0_8]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X1,implies(not(X2),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(not(X2),not(X1)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,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_11,c_0_17]) ).
cnf(c_0_19,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_11,c_0_7]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(implies(not(X2),X4),X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_22,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)],[prove_cn_14]) ).
cnf(c_0_23,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_9,c_0_7]) ).
cnf(c_0_24,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_13,c_0_19]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
c_0_22 ).
cnf(c_0_27,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_11,c_0_23]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_29,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_18,c_0_7]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
~ is_a_theorem(implies(implies(not(z),y),implies(x,implies(implies(y,z),z)))),
inference(spm,[status(thm)],[c_0_26,c_0_8]) ).
cnf(c_0_32,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_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X3),implies(implies(X3,X2),X2)))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL365-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n004.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 00:24:05 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.21/4.43 % Version: 3.5.1
% 26.21/4.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.21/4.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.21/4.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.21/4.43 % Starting new_bool_3 with 300s (1) cores
% 26.21/4.43 % Starting new_bool_1 with 300s (1) cores
% 26.21/4.43 % Starting sh5l with 300s (1) cores
% 26.21/4.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1861381 completed with status 0
% 26.21/4.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 26.21/4.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.21/4.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.21/4.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.21/4.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.21/4.43 % No SInE strategy applied
% 26.21/4.43 % Search class: FHUNS-FFSF21-MFFFFFNN
% 26.21/4.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.21/4.43 % Starting SubtermCWHack with 136s (1) cores
% 26.21/4.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.21/4.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 26.21/4.43 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 26.21/4.43 % Starting new_bool_3 with 136s (1) cores
% 26.21/4.43 % H----_011_C07_F1_PI_SE_SP_S0V with pid 1861390 completed with status 0
% 26.21/4.43 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 26.21/4.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 26.21/4.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.21/4.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.21/4.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.21/4.43 % No SInE strategy applied
% 26.21/4.43 % Search class: FHUNS-FFSF21-MFFFFFNN
% 26.21/4.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.21/4.43 % Starting SubtermCWHack with 136s (1) cores
% 26.21/4.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.21/4.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 26.21/4.43 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 26.21/4.43 % Preprocessing time : 0.001 s
% 26.21/4.43
% 26.21/4.43 % Proof found!
% 26.21/4.43 % SZS status Unsatisfiable
% 26.21/4.43 % SZS output start CNFRefutation
% See solution above
% 26.21/4.43 % Parsed axioms : 5
% 26.21/4.43 % Removed by relevancy pruning/SinE : 0
% 26.21/4.43 % Initial clauses : 5
% 26.21/4.43 % Removed in clause preprocessing : 0
% 26.21/4.43 % Initial clauses in saturation : 5
% 26.21/4.43 % Processed clauses : 26173
% 26.21/4.43 % ...of these trivial : 240
% 26.21/4.43 % ...subsumed : 23852
% 26.21/4.43 % ...remaining for further processing : 2081
% 26.21/4.43 % Other redundant clauses eliminated : 0
% 26.21/4.43 % Clauses deleted for lack of memory : 0
% 26.21/4.43 % Backward-subsumed : 234
% 26.21/4.43 % Backward-rewritten : 6
% 26.21/4.43 % Generated clauses : 141073
% 26.21/4.43 % ...of the previous two non-redundant : 137009
% 26.21/4.43 % ...aggressively subsumed : 0
% 26.21/4.43 % Contextual simplify-reflections : 0
% 26.21/4.43 % Paramodulations : 141073
% 26.21/4.43 % Factorizations : 0
% 26.21/4.43 % NegExts : 0
% 26.21/4.43 % Equation resolutions : 0
% 26.21/4.43 % Disequality decompositions : 0
% 26.21/4.43 % Total rewrite steps : 4480
% 26.21/4.43 % ...of those cached : 3973
% 26.21/4.43 % Propositional unsat checks : 0
% 26.21/4.43 % Propositional check models : 0
% 26.21/4.43 % Propositional check unsatisfiable : 0
% 26.21/4.43 % Propositional clauses : 0
% 26.21/4.43 % Propositional clauses after purity: 0
% 26.21/4.43 % Propositional unsat core size : 0
% 26.21/4.43 % Propositional preprocessing time : 0.000
% 26.21/4.43 % Propositional encoding time : 0.000
% 26.21/4.43 % Propositional solver time : 0.000
% 26.21/4.43 % Success case prop preproc time : 0.000
% 26.21/4.43 % Success case prop encoding time : 0.000
% 26.21/4.43 % Success case prop solver time : 0.000
% 26.21/4.43 % Current number of processed clauses : 1841
% 26.21/4.43 % Positive orientable unit clauses : 107
% 26.21/4.43 % Positive unorientable unit clauses: 0
% 26.21/4.43 % Negative unit clauses : 107
% 26.21/4.43 % Non-unit-clauses : 1627
% 26.21/4.43 % Current number of unprocessed clauses: 110595
% 26.21/4.43 % ...number of literals in the above : 396679
% 26.21/4.43 % Current number of archived formulas : 0
% 26.21/4.43 % Current number of archived clauses : 240
% 26.21/4.43 % Clause-clause subsumption calls (NU) : 469012
% 26.21/4.43 % Rec. Clause-clause subsumption calls : 324284
% 26.21/4.43 % Non-unit clause-clause subsumptions : 18836
% 26.21/4.43 % Unit Clause-clause subsumption calls : 12035
% 26.21/4.43 % Rewrite failures with RHS unbound : 0
% 26.21/4.43 % BW rewrite match attempts : 16730
% 26.21/4.43 % BW rewrite match successes : 7
% 26.21/4.43 % Condensation attempts : 0
% 26.21/4.43 % Condensation successes : 0
% 26.21/4.43 % Termbank termtop insertions : 2163796
% 26.21/4.43 % Search garbage collected termcells : 8
% 26.21/4.43
% 26.21/4.43 % -------------------------------------------------
% 26.21/4.43 % User time : 3.604 s
% 26.21/4.43 % System time : 0.133 s
% 26.21/4.43 % Total time : 3.737 s
% 26.21/4.43 % Maximum resident set size: 3584 pages
% 26.21/4.43
% 26.21/4.43 % -------------------------------------------------
% 26.21/4.43 % User time : 17.824 s
% 26.21/4.43 % System time : 0.641 s
% 26.21/4.43 % Total time : 18.465 s
% 26.21/4.43 % Maximum resident set size: 4864 pages
% 26.21/4.43 % E exiting
%------------------------------------------------------------------------------