%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL045-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 : n016.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:36 PM UTC 2026
% Result : Unsatisfiable 6.82s 1.39s
% Output : CNFRefutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of clauses : 50 ( 29 unt; 0 nHn; 20 RR)
% Number of literals : 77 ( 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; 2 con; 0-2 aty)
% Number of variables : 111 ( 20 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_22,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_22) ).
cnf(cn_54,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54) ).
cnf(cn_21,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_21) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
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_46,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_46) ).
cnf(c_0_7,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_8,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_7 ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
cn_22 ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
cn_54 ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
cn_21 ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(implies(not(X1),X2),X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_14,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_8,c_0_11]) ).
cnf(c_0_15,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_18,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(X1,implies(not(not(X1)),X2)))
| is_a_theorem(implies(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(not(X1),X2))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(implies(implies(X1,X3),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(implies(not(X2),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(implies(X1,implies(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(not(X1),implies(not(implies(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(implies(X3,X4),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_29]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(not(X1),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_32]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(not(implies(X1,X2)),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(implies(X1,implies(not(X2),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(not(X1),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(implies(X2,implies(not(implies(X1,not(X2))),X3)))
| is_a_theorem(implies(not(implies(X1,not(X2))),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(not(implies(implies(X1,X2),X3)),X2))),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(not(implies(implies(X1,X2),not(X1))),X2)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
inference(fof_simplification,[status(thm)],[prove_cn_46]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(not(X1),implies(implies(X2,X1),not(X2)))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
c_0_45 ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(X2),not(X1)))),
inference(spm,[status(thm)],[c_0_16,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL045-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.12/0.38 % Computer : n016.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:06:22 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 6.82/1.39 % Version: 3.5.1
% 6.82/1.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.82/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.82/1.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.82/1.39 % Starting new_bool_3 with 300s (1) cores
% 6.82/1.39 % Starting new_bool_1 with 300s (1) cores
% 6.82/1.39 % Starting sh5l with 300s (1) cores
% 6.82/1.39 % sh5l with pid 1142243 completed with status 0
% 6.82/1.39 % Result found by sh5l
% 6.82/1.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.82/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.82/1.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.82/1.39 % Starting new_bool_3 with 300s (1) cores
% 6.82/1.39 % Starting new_bool_1 with 300s (1) cores
% 6.82/1.39 % Starting sh5l with 300s (1) cores
% 6.82/1.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 6.82/1.39 % SinE strategy is gf500_gu_R04_F100_L20000
% 6.82/1.39 % Search class: FHUNM-FFSF21-MFFFFFNN
% 6.82/1.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 6.82/1.39 % Starting SubtermCWHack with 28s (1) cores
% 6.82/1.39 % SubtermCWHack with pid 1142250 completed with status 0
% 6.82/1.39 % Result found by SubtermCWHack
% 6.82/1.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.82/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.82/1.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.82/1.39 % Starting new_bool_3 with 300s (1) cores
% 6.82/1.39 % Starting new_bool_1 with 300s (1) cores
% 6.82/1.39 % Starting sh5l with 300s (1) cores
% 6.82/1.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 6.82/1.39 % SinE strategy is gf500_gu_R04_F100_L20000
% 6.82/1.39 % Search class: FHUNM-FFSF21-MFFFFFNN
% 6.82/1.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 6.82/1.39 % Starting SubtermCWHack with 28s (1) cores
% 6.82/1.39 % Preprocessing time : 0.001 s
% 6.82/1.39
% 6.82/1.39 % Proof found!
% 6.82/1.39 % SZS status Unsatisfiable
% 6.82/1.39 % SZS output start CNFRefutation
% See solution above
% 6.82/1.39 % Parsed axioms : 7
% 6.82/1.39 % Removed by relevancy pruning/SinE : 0
% 6.82/1.39 % Initial clauses : 7
% 6.82/1.39 % Removed in clause preprocessing : 0
% 6.82/1.39 % Initial clauses in saturation : 7
% 6.82/1.39 % Processed clauses : 7362
% 6.82/1.39 % ...of these trivial : 256
% 6.82/1.39 % ...subsumed : 6002
% 6.82/1.39 % ...remaining for further processing : 1104
% 6.82/1.39 % Other redundant clauses eliminated : 0
% 6.82/1.39 % Clauses deleted for lack of memory : 0
% 6.82/1.39 % Backward-subsumed : 1
% 6.82/1.39 % Backward-rewritten : 3
% 6.82/1.39 % Generated clauses : 74767
% 6.82/1.39 % ...of the previous two non-redundant : 60082
% 6.82/1.39 % ...aggressively subsumed : 0
% 6.82/1.39 % Contextual simplify-reflections : 0
% 6.82/1.39 % Paramodulations : 74767
% 6.82/1.39 % Factorizations : 0
% 6.82/1.39 % NegExts : 0
% 6.82/1.39 % Equation resolutions : 0
% 6.82/1.39 % Disequality decompositions : 0
% 6.82/1.39 % Total rewrite steps : 14930
% 6.82/1.39 % ...of those cached : 12426
% 6.82/1.39 % Propositional unsat checks : 0
% 6.82/1.39 % Propositional check models : 0
% 6.82/1.39 % Propositional check unsatisfiable : 0
% 6.82/1.39 % Propositional clauses : 0
% 6.82/1.39 % Propositional clauses after purity: 0
% 6.82/1.39 % Propositional unsat core size : 0
% 6.82/1.39 % Propositional preprocessing time : 0.000
% 6.82/1.39 % Propositional encoding time : 0.000
% 6.82/1.39 % Propositional solver time : 0.000
% 6.82/1.39 % Success case prop preproc time : 0.000
% 6.82/1.39 % Success case prop encoding time : 0.000
% 6.82/1.39 % Success case prop solver time : 0.000
% 6.82/1.39 % Current number of processed clauses : 1100
% 6.82/1.39 % Positive orientable unit clauses : 487
% 6.82/1.39 % Positive unorientable unit clauses: 0
% 6.82/1.39 % Negative unit clauses : 9
% 6.82/1.39 % Non-unit-clauses : 604
% 6.82/1.39 % Current number of unprocessed clauses: 52725
% 6.82/1.39 % ...number of literals in the above : 107082
% 6.82/1.39 % Current number of archived formulas : 0
% 6.82/1.39 % Current number of archived clauses : 4
% 6.82/1.39 % Clause-clause subsumption calls (NU) : 86314
% 6.82/1.39 % Rec. Clause-clause subsumption calls : 86054
% 6.82/1.39 % Non-unit clause-clause subsumptions : 5996
% 6.82/1.39 % Unit Clause-clause subsumption calls : 4278
% 6.82/1.39 % Rewrite failures with RHS unbound : 0
% 6.82/1.39 % BW rewrite match attempts : 45088
% 6.82/1.39 % BW rewrite match successes : 3
% 6.82/1.39 % Condensation attempts : 0
% 6.82/1.39 % Condensation successes : 0
% 6.82/1.39 % Termbank termtop insertions : 968130
% 6.82/1.39 % Search garbage collected termcells : 8
% 6.82/1.39
% 6.82/1.39 % -------------------------------------------------
% 6.82/1.39 % User time : 0.881 s
% 6.82/1.39 % System time : 0.047 s
% 6.82/1.39 % Total time : 0.928 s
% 6.82/1.39 % Maximum resident set size: 3828 pages
% 6.82/1.39
% 6.82/1.39 % -------------------------------------------------
% 6.82/1.39 % User time : 0.882 s
% 6.82/1.39 % System time : 0.052 s
% 6.82/1.39 % Total time : 0.934 s
% 6.82/1.39 % Maximum resident set size: 4864 pages
% 6.82/1.39 % E exiting
%------------------------------------------------------------------------------