%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL067-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:11:40 PM UTC 2026
% Result : Unsatisfiable 14.32s 2.64s
% Output : CNFRefutation 14.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 49 ( 24 unt; 0 nHn; 26 RR)
% Number of literals : 83 ( 0 equ; 38 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 121 ( 27 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_59,axiom,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_59) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).
cnf(prove_cn_1,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).
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(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
cn_59 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(not(X3),X2))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(implies(X1,X3),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(not(X1),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(X3,implies(X2,X4)))
| is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X4,implies(X1,X2)))
| ~ is_a_theorem(implies(implies(X3,X1),X4))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(implies(X3,X1),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(X2,implies(X3,not(X1))))
| is_a_theorem(implies(implies(X1,X2),implies(X3,not(X1)))) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X3,implies(X1,not(X2))))
| is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_19]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(implies(X1,X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(not(not(X1)),implies(implies(X2,X3),implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(not(not(X3)))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_25]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(implies(not(X1),X1))
| is_a_theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(not(not(X1)))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_28]) ).
cnf(c_0_31,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(implies(implies(X1,X1),X2),X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(implies(implies(X2,X2),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_32]) ).
cnf(c_0_36,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(X2,implies(X3,implies(X1,X4))))
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X1))))),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
inference(fof_simplification,[status(thm)],[prove_cn_1]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(implies(implies(X2,X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(implies(X2,implies(implies(X1,X2),implies(X1,X3))))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,implies(X5,X1)))))),
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
c_0_39 ).
cnf(c_0_44,plain,
( ~ is_a_theorem(implies(X2,implies(X1,implies(X2,X3))))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_40,c_0_37]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
~ is_a_theorem(implies(b,implies(implies(b,c),implies(a,c)))),
inference(spm,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL067-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.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 00:00:51 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 14.32/2.64 % Version: 3.5.1
% 14.32/2.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 14.32/2.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.32/2.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.32/2.64 % Starting new_bool_3 with 300s (1) cores
% 14.32/2.64 % Starting new_bool_1 with 300s (1) cores
% 14.32/2.64 % Starting sh5l with 300s (1) cores
% 14.32/2.64 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3920302 completed with status 0
% 14.32/2.64 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 14.32/2.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 14.32/2.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.32/2.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.32/2.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.32/2.64 % No SInE strategy applied
% 14.32/2.64 % Search class: FHUNS-FFSF21-MFFFFFNN
% 14.32/2.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.32/2.64 % Starting SubtermCWHack with 136s (1) cores
% 14.32/2.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 14.32/2.64 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 14.32/2.64 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 14.32/2.64 % Starting new_bool_3 with 136s (1) cores
% 14.32/2.64 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 3920309 completed with status 0
% 14.32/2.64 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 14.32/2.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 14.32/2.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.32/2.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 14.32/2.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.32/2.64 % No SInE strategy applied
% 14.32/2.64 % Search class: FHUNS-FFSF21-MFFFFFNN
% 14.32/2.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.32/2.64 % Starting SubtermCWHack with 136s (1) cores
% 14.32/2.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 14.32/2.64 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 14.32/2.64 % Preprocessing time : 0.008 s
% 14.32/2.64
% 14.32/2.64 % Proof found!
% 14.32/2.64 % SZS status Unsatisfiable
% 14.32/2.64 % SZS output start CNFRefutation
% See solution above
% 14.32/2.64 % Parsed axioms : 5
% 14.32/2.64 % Removed by relevancy pruning/SinE : 0
% 14.32/2.64 % Initial clauses : 5
% 14.32/2.64 % Removed in clause preprocessing : 0
% 14.32/2.64 % Initial clauses in saturation : 5
% 14.32/2.64 % Processed clauses : 5014
% 14.32/2.64 % ...of these trivial : 37
% 14.32/2.64 % ...subsumed : 3929
% 14.32/2.64 % ...remaining for further processing : 1048
% 14.32/2.64 % Other redundant clauses eliminated : 0
% 14.32/2.64 % Clauses deleted for lack of memory : 0
% 14.32/2.64 % Backward-subsumed : 17
% 14.32/2.64 % Backward-rewritten : 2
% 14.32/2.64 % Generated clauses : 72472
% 14.32/2.64 % ...of the previous two non-redundant : 65699
% 14.32/2.64 % ...aggressively subsumed : 0
% 14.32/2.64 % Contextual simplify-reflections : 0
% 14.32/2.64 % Paramodulations : 72472
% 14.32/2.64 % Factorizations : 0
% 14.32/2.64 % NegExts : 0
% 14.32/2.64 % Equation resolutions : 0
% 14.32/2.64 % Disequality decompositions : 0
% 14.32/2.64 % Total rewrite steps : 6415
% 14.32/2.64 % ...of those cached : 5647
% 14.32/2.64 % Propositional unsat checks : 0
% 14.32/2.64 % Propositional check models : 0
% 14.32/2.64 % Propositional check unsatisfiable : 0
% 14.32/2.64 % Propositional clauses : 0
% 14.32/2.64 % Propositional clauses after purity: 0
% 14.32/2.64 % Propositional unsat core size : 0
% 14.32/2.64 % Propositional preprocessing time : 0.000
% 14.32/2.64 % Propositional encoding time : 0.000
% 14.32/2.64 % Propositional solver time : 0.000
% 14.32/2.64 % Success case prop preproc time : 0.000
% 14.32/2.64 % Success case prop encoding time : 0.000
% 14.32/2.64 % Success case prop solver time : 0.000
% 14.32/2.64 % Current number of processed clauses : 1029
% 14.32/2.64 % Positive orientable unit clauses : 133
% 14.32/2.64 % Positive unorientable unit clauses: 0
% 14.32/2.64 % Negative unit clauses : 18
% 14.32/2.64 % Non-unit-clauses : 878
% 14.32/2.64 % Current number of unprocessed clauses: 60663
% 14.32/2.64 % ...number of literals in the above : 172448
% 14.32/2.64 % Current number of archived formulas : 0
% 14.32/2.64 % Current number of archived clauses : 19
% 14.32/2.64 % Clause-clause subsumption calls (NU) : 270509
% 14.32/2.64 % Rec. Clause-clause subsumption calls : 224225
% 14.32/2.64 % Non-unit clause-clause subsumptions : 3877
% 14.32/2.64 % Unit Clause-clause subsumption calls : 2722
% 14.32/2.64 % Rewrite failures with RHS unbound : 0
% 14.32/2.64 % BW rewrite match attempts : 12231
% 14.32/2.64 % BW rewrite match successes : 2
% 14.32/2.64 % Condensation attempts : 0
% 14.32/2.64 % Condensation successes : 0
% 14.32/2.64 % Termbank termtop insertions : 1117853
% 14.32/2.64 % Search garbage collected termcells : 8
% 14.32/2.64
% 14.32/2.64 % -------------------------------------------------
% 14.32/2.64 % User time : 2.093 s
% 14.32/2.64 % System time : 0.086 s
% 14.32/2.64 % Total time : 2.179 s
% 14.32/2.64 % Maximum resident set size: 3636 pages
% 14.32/2.64
% 14.32/2.64 % -------------------------------------------------
% 14.32/2.64 % User time : 9.953 s
% 14.32/2.64 % System time : 0.389 s
% 14.32/2.64 % Total time : 10.341 s
% 14.32/2.64 % Maximum resident set size: 4608 pages
% 14.32/2.64 % E exiting
%------------------------------------------------------------------------------