%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL367-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:31 PM UTC 2026
% Result : Unsatisfiable 8.03s 6.68s
% Output : CNFRefutation 8.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of clauses : 47 ( 20 unt; 0 nHn; 17 RR)
% Number of literals : 84 ( 0 equ; 40 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 112 ( 23 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_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
cnf(prove_cn_17,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_17) ).
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,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
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_6,c_0_7]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(X1,X2),implies(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(implies(X4,X2),X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(implies(not(X4),X2),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X2)
| 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(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X4,X2),X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(implies(not(X1),X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X4,X2),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,implies(not(X2),X2)),X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(implies(not(X1),X2),X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(not(X1),implies(X2,X1)),X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,implies(X2,X3)),X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(implies(X2,X4))
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,implies(X3,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_31]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,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_34,c_0_7]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_38,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,implies(not(X1),X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_27]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(implies(implies(X3,implies(not(X1),X4)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
inference(fof_simplification,[status(thm)],[prove_cn_17]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(implies(X1,implies(not(X2),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
c_0_41 ).
cnf(c_0_45,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL367-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n026.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 00:26:42 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.45 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
% 8.03/6.68 % Version: 3.5.1
% 8.03/6.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.03/6.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.03/6.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.03/6.68 % Starting new_bool_3 with 300s (1) cores
% 8.03/6.68 % Starting new_bool_1 with 300s (1) cores
% 8.03/6.68 % Starting sh5l with 300s (1) cores
% 8.03/6.68 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 969692 completed with status 0
% 8.03/6.68 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.03/6.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.03/6.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.03/6.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.03/6.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.03/6.68 % No SInE strategy applied
% 8.03/6.68 % Search class: FHUNS-FFSF21-MFFFFFNN
% 8.03/6.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.03/6.68 % Starting SubtermCWHack with 136s (1) cores
% 8.03/6.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.03/6.68 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 8.03/6.68 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 8.03/6.68 % Starting new_bool_3 with 136s (1) cores
% 8.03/6.68 % new_bool_3 with pid 969703 completed with status 0
% 8.03/6.68 % Result found by new_bool_3
% 8.03/6.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.03/6.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.03/6.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.03/6.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.03/6.68 % No SInE strategy applied
% 8.03/6.68 % Search class: FHUNS-FFSF21-MFFFFFNN
% 8.03/6.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.03/6.68 % Starting SubtermCWHack with 136s (1) cores
% 8.03/6.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.03/6.68 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 8.03/6.68 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 8.03/6.68 % Starting new_bool_3 with 136s (1) cores
% 8.03/6.68 % Preprocessing time : 0.002 s
% 8.03/6.68 % Presaturation interreduction done
% 8.03/6.68
% 8.03/6.68 % Proof found!
% 8.03/6.68 % SZS status Unsatisfiable
% 8.03/6.68 % SZS output start CNFRefutation
% See solution above
% 8.03/6.68 % Parsed axioms : 5
% 8.03/6.68 % Removed by relevancy pruning/SinE : 0
% 8.03/6.68 % Initial clauses : 5
% 8.03/6.68 % Removed in clause preprocessing : 0
% 8.03/6.68 % Initial clauses in saturation : 5
% 8.03/6.68 % Processed clauses : 6087
% 8.03/6.68 % ...of these trivial : 127
% 8.03/6.68 % ...subsumed : 5101
% 8.03/6.68 % ...remaining for further processing : 859
% 8.03/6.68 % Other redundant clauses eliminated : 0
% 8.03/6.68 % Clauses deleted for lack of memory : 0
% 8.03/6.68 % Backward-subsumed : 33
% 8.03/6.68 % Backward-rewritten : 12
% 8.03/6.68 % Generated clauses : 83867
% 8.03/6.68 % ...of the previous two non-redundant : 69679
% 8.03/6.68 % ...aggressively subsumed : 0
% 8.03/6.68 % Contextual simplify-reflections : 0
% 8.03/6.68 % Paramodulations : 83867
% 8.03/6.68 % Factorizations : 0
% 8.03/6.68 % NegExts : 0
% 8.03/6.68 % Equation resolutions : 0
% 8.03/6.68 % Disequality decompositions : 0
% 8.03/6.68 % Total rewrite steps : 13824
% 8.03/6.68 % ...of those cached : 12112
% 8.03/6.68 % Propositional unsat checks : 0
% 8.03/6.68 % Propositional check models : 0
% 8.03/6.68 % Propositional check unsatisfiable : 0
% 8.03/6.68 % Propositional clauses : 0
% 8.03/6.68 % Propositional clauses after purity: 0
% 8.03/6.68 % Propositional unsat core size : 0
% 8.03/6.68 % Propositional preprocessing time : 0.000
% 8.03/6.68 % Propositional encoding time : 0.000
% 8.03/6.68 % Propositional solver time : 0.000
% 8.03/6.68 % Success case prop preproc time : 0.000
% 8.03/6.68 % Success case prop encoding time : 0.000
% 8.03/6.68 % Success case prop solver time : 0.000
% 8.03/6.68 % Current number of processed clauses : 809
% 8.03/6.68 % Positive orientable unit clauses : 266
% 8.03/6.68 % Positive unorientable unit clauses: 0
% 8.03/6.68 % Negative unit clauses : 3
% 8.03/6.68 % Non-unit-clauses : 540
% 8.03/6.68 % Current number of unprocessed clauses: 63537
% 8.03/6.68 % ...number of literals in the above : 107129
% 8.03/6.68 % Current number of archived formulas : 0
% 8.03/6.68 % Current number of archived clauses : 50
% 8.03/6.68 % Clause-clause subsumption calls (NU) : 149838
% 8.03/6.68 % Rec. Clause-clause subsumption calls : 123922
% 8.03/6.68 % Non-unit clause-clause subsumptions : 5130
% 8.03/6.68 % Unit Clause-clause subsumption calls : 2229
% 8.03/6.68 % Rewrite failures with RHS unbound : 0
% 8.03/6.68 % BW rewrite match attempts : 42412
% 8.03/6.68 % BW rewrite match successes : 14
% 8.03/6.68 % Condensation attempts : 0
% 8.03/6.68 % Condensation successes : 0
% 8.03/6.68 % Termbank termtop insertions : 1269409
% 8.03/6.68 % Search garbage collected termcells : 8
% 8.03/6.68
% 8.03/6.68 % -------------------------------------------------
% 8.03/6.68 % User time : 1.058 s
% 8.03/6.68 % System time : 0.052 s
% 8.03/6.68 % Total time : 1.109 s
% 8.03/6.68 % Maximum resident set size: 3580 pages
% 8.03/6.68
% 8.03/6.68 % -------------------------------------------------
% 8.03/6.68 % User time : 4.813 s
% 8.03/6.68 % System time : 0.188 s
% 8.03/6.68 % Total time : 5.000 s
% 8.03/6.68 % Maximum resident set size: 4608 pages
% 8.03/6.68 % E exiting
%------------------------------------------------------------------------------