%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL030-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 : n014.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:18:17 PM UTC 2026
% Result : Unsatisfiable 155.00s 23.05s
% Output : CNFRefutation 155.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 38 ( 19 unt; 0 nHn; 20 RR)
% Number of literals : 63 ( 0 equ; 30 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 12 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(c0_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_1) ).
cnf(c0_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_3) ).
cnf(c0_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_2) ).
cnf(prove_c0_6,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_6) ).
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)))),
c0_1 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(pm,[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(pm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(pm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
c0_3 ).
cnf(c_0_12,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
c0_2 ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(pm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(X4,X1))
| ~ is_a_theorem(implies(implies(X4,X2),X3))
| is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(pm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(implies(X1,X2),X2))),
inference(pm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))),
inference(pm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(implies(X2,X3),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(pm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(pm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
inference(fof_simplification,[status(thm)],[prove_c0_6]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(implies(implies(X1,X3),implies(X4,X3)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X3),X3),X1),X1)),
inference(pm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
c_0_21 ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))),
inference(pm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(pm,[status(thm)],[c_0_24,c_0_8]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(pm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_30,negated_conjecture,
( ~ is_a_theorem(implies(implies(a,implies(b,c)),X1))
| ~ is_a_theorem(implies(X1,implies(implies(a,b),implies(a,c)))) ),
inference(pm,[status(thm)],[c_0_25,c_0_9]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(X1,implies(X2,implies(X1,X3))),implies(X2,implies(X1,X3)))),
inference(pm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(pm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(implies(X1,implies(implies(implies(X3,X5),implies(X2,X5)),X4)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),X4))) ),
inference(pm,[status(thm)],[c_0_29,c_0_7]) ).
cnf(c_0_34,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(a,implies(implies(a,b),implies(a,c))))),
inference(pm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(pm,[status(thm)],[c_0_10,c_0_32]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(pm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL030-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 00:00:49 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 155.00/23.05 % Version: 3.5.1
% 155.00/23.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 155.00/23.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 155.00/23.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 155.00/23.05 % Starting new_bool_3 with 300s (1) cores
% 155.00/23.05 % Starting new_bool_1 with 300s (1) cores
% 155.00/23.05 % Starting sh5l with 300s (1) cores
% 155.00/23.05 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2719166 completed with status 0
% 155.00/23.05 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 155.00/23.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 155.00/23.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 155.00/23.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 155.00/23.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 155.00/23.05 % No SInE strategy applied
% 155.00/23.05 % Search class: FHUNM-FFSF22-MFFFFFNN
% 155.00/23.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 155.00/23.05 % Starting SubtermCWHack with 136s (1) cores
% 155.00/23.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 155.00/23.05 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 155.00/23.05 % Starting G-E--_300_C01_S00 with 136s (1) cores
% 155.00/23.05 % Starting new_bool_3 with 136s (1) cores
% 155.00/23.05 % G-E--_300_C01_S00 with pid 2719173 completed with status 0
% 155.00/23.05 % Result found by G-E--_300_C01_S00
% 155.00/23.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 155.00/23.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 155.00/23.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 155.00/23.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 155.00/23.05 % No SInE strategy applied
% 155.00/23.05 % Search class: FHUNM-FFSF22-MFFFFFNN
% 155.00/23.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 155.00/23.05 % Starting SubtermCWHack with 136s (1) cores
% 155.00/23.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 155.00/23.05 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 155.00/23.05 % Starting G-E--_300_C01_S00 with 136s (1) cores
% 155.00/23.05 % Preprocessing time : 0.001 s
% 155.00/23.05
% 155.00/23.05 % Proof found!
% 155.00/23.05 % SZS status Unsatisfiable
% 155.00/23.05 % SZS output start CNFRefutation
% See solution above
% 155.00/23.05 % Parsed axioms : 6
% 155.00/23.05 % Removed by relevancy pruning/SinE : 0
% 155.00/23.05 % Initial clauses : 6
% 155.00/23.05 % Removed in clause preprocessing : 0
% 155.00/23.05 % Initial clauses in saturation : 6
% 155.00/23.05 % Processed clauses : 27844
% 155.00/23.05 % ...of these trivial : 241
% 155.00/23.05 % ...subsumed : 25382
% 155.00/23.05 % ...remaining for further processing : 2221
% 155.00/23.05 % Other redundant clauses eliminated : 0
% 155.00/23.05 % Clauses deleted for lack of memory : 0
% 155.00/23.05 % Backward-subsumed : 94
% 155.00/23.05 % Backward-rewritten : 31
% 155.00/23.05 % Generated clauses : 1209169
% 155.00/23.05 % ...of the previous two non-redundant : 1155326
% 155.00/23.05 % ...aggressively subsumed : 0
% 155.00/23.05 % Contextual simplify-reflections : 0
% 155.00/23.05 % Paramodulations : 1209169
% 155.00/23.05 % Factorizations : 0
% 155.00/23.05 % NegExts : 0
% 155.00/23.05 % Equation resolutions : 0
% 155.00/23.05 % Disequality decompositions : 0
% 155.00/23.05 % Total rewrite steps : 66261
% 155.00/23.05 % ...of those cached : 58399
% 155.00/23.05 % Propositional unsat checks : 0
% 155.00/23.05 % Propositional check models : 0
% 155.00/23.05 % Propositional check unsatisfiable : 0
% 155.00/23.05 % Propositional clauses : 0
% 155.00/23.05 % Propositional clauses after purity: 0
% 155.00/23.05 % Propositional unsat core size : 0
% 155.00/23.05 % Propositional preprocessing time : 0.000
% 155.00/23.05 % Propositional encoding time : 0.000
% 155.00/23.05 % Propositional solver time : 0.000
% 155.00/23.05 % Success case prop preproc time : 0.000
% 155.00/23.05 % Success case prop encoding time : 0.000
% 155.00/23.05 % Success case prop solver time : 0.000
% 155.00/23.05 % Current number of processed clauses : 2096
% 155.00/23.05 % Positive orientable unit clauses : 415
% 155.00/23.05 % Positive unorientable unit clauses: 0
% 155.00/23.05 % Negative unit clauses : 547
% 155.00/23.05 % Non-unit-clauses : 1134
% 155.00/23.05 % Current number of unprocessed clauses: 1126877
% 155.00/23.05 % ...number of literals in the above : 4022106
% 155.00/23.05 % Current number of archived formulas : 0
% 155.00/23.05 % Current number of archived clauses : 125
% 155.00/23.05 % Clause-clause subsumption calls (NU) : 190081
% 155.00/23.05 % Rec. Clause-clause subsumption calls : 128240
% 155.00/23.05 % Non-unit clause-clause subsumptions : 8643
% 155.00/23.05 % Unit Clause-clause subsumption calls : 49856
% 155.00/23.05 % Rewrite failures with RHS unbound : 0
% 155.00/23.05 % BW rewrite match attempts : 167282
% 155.00/23.05 % BW rewrite match successes : 31
% 155.00/23.05 % Condensation attempts : 0
% 155.00/23.05 % Condensation successes : 0
% 155.00/23.05 % Termbank termtop insertions : 14813426
% 155.00/23.05 % Search garbage collected termcells : 8
% 155.00/23.05
% 155.00/23.05 % -------------------------------------------------
% 155.00/23.05 % User time : 21.121 s
% 155.00/23.05 % System time : 0.807 s
% 155.00/23.05 % Total time : 21.929 s
% 155.00/23.05 % Maximum resident set size: 3632 pages
% 155.00/23.05
% 155.00/23.05 % -------------------------------------------------
% 155.00/23.05 % User time : 106.113 s
% 155.00/23.05 % System time : 3.749 s
% 155.00/23.05 % Total time : 109.863 s
% 155.00/23.05 % Maximum resident set size: 4864 pages
% 155.00/23.05 % E exiting
%------------------------------------------------------------------------------