%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL396-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 : 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:12:39 PM UTC 2026
% Result : Unsatisfiable 13.01s 2.52s
% Output : CNFRefutation 13.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 36 ( 18 unt; 0 nHn; 16 RR)
% Number of literals : 61 ( 0 equ; 29 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 : 80 ( 15 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_62,negated_conjecture,
~ is_a_theorem(implies(implies(not(not(x)),y),implies(x,y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_62) ).
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,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_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,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_13,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
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_10,c_0_11]) ).
cnf(c_0_15,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_10,c_0_12]) ).
cnf(c_0_16,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_13]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,implies(implies(not(not(X1)),not(X1)),X2))),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(X1,implies(X3,not(X2))))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,implies(not(X2),X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(X1,implies(X3,implies(not(not(X2)),not(X2)))))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(implies(not(X3),X1))
| is_a_theorem(implies(implies(implies(not(X1),X2),X3),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(implies(implies(not(not(x)),y),implies(x,y))),
inference(fof_simplification,[status(thm)],[prove_cn_62]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(not(X2),X3))
| ~ is_a_theorem(implies(X1,implies(implies(not(X3),X4),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(implies(X1,implies(not(implies(not(X2),X2)),implies(not(X2),X2))))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_24]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(implies(implies(not(not(x)),y),implies(x,y))),
c_0_26 ).
cnf(c_0_31,plain,
( ~ is_a_theorem(implies(not(X2),not(X1)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_theorem(implies(x,not(not(x)))),
inference(spm,[status(thm)],[c_0_30,c_0_8]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL396-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n007.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 00:26:05 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.54 Running first-order theorem proving
% 0.22/0.54 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
% 13.01/2.52 % Version: 3.5.1
% 13.01/2.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.01/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.01/2.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.01/2.52 % Starting new_bool_3 with 300s (1) cores
% 13.01/2.52 % Starting new_bool_1 with 300s (1) cores
% 13.01/2.52 % Starting sh5l with 300s (1) cores
% 13.01/2.52 % new_bool_1 with pid 3962989 completed with status 0
% 13.01/2.52 % Result found by new_bool_1
% 13.01/2.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.01/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.01/2.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.01/2.52 % Starting new_bool_3 with 300s (1) cores
% 13.01/2.52 % Starting new_bool_1 with 300s (1) cores
% 13.01/2.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 13.01/2.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.01/2.52 % Search class: FHUNS-FFSF21-MFFFFFNN
% 13.01/2.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 13.01/2.52 % Starting SubtermCWHack with 31s (1) cores
% 13.01/2.52 % SubtermCWHack with pid 3962993 completed with status 0
% 13.01/2.52 % Result found by SubtermCWHack
% 13.01/2.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.01/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.01/2.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.01/2.52 % Starting new_bool_3 with 300s (1) cores
% 13.01/2.52 % Starting new_bool_1 with 300s (1) cores
% 13.01/2.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 13.01/2.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.01/2.52 % Search class: FHUNS-FFSF21-MFFFFFNN
% 13.01/2.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 13.01/2.52 % Starting SubtermCWHack with 31s (1) cores
% 13.01/2.52 % Preprocessing time : 0.002 s
% 13.01/2.52
% 13.01/2.52 % Proof found!
% 13.01/2.52 % SZS status Unsatisfiable
% 13.01/2.52 % SZS output start CNFRefutation
% See solution above
% 13.01/2.52 % Parsed axioms : 5
% 13.01/2.52 % Removed by relevancy pruning/SinE : 0
% 13.01/2.52 % Initial clauses : 5
% 13.01/2.52 % Removed in clause preprocessing : 0
% 13.01/2.52 % Initial clauses in saturation : 5
% 13.01/2.52 % Processed clauses : 10371
% 13.01/2.52 % ...of these trivial : 244
% 13.01/2.52 % ...subsumed : 9111
% 13.01/2.52 % ...remaining for further processing : 1016
% 13.01/2.52 % Other redundant clauses eliminated : 0
% 13.01/2.52 % Clauses deleted for lack of memory : 0
% 13.01/2.52 % Backward-subsumed : 16
% 13.01/2.52 % Backward-rewritten : 2
% 13.01/2.52 % Generated clauses : 122784
% 13.01/2.52 % ...of the previous two non-redundant : 117760
% 13.01/2.52 % ...aggressively subsumed : 0
% 13.01/2.52 % Contextual simplify-reflections : 0
% 13.01/2.52 % Paramodulations : 122784
% 13.01/2.52 % Factorizations : 0
% 13.01/2.52 % NegExts : 0
% 13.01/2.52 % Equation resolutions : 0
% 13.01/2.52 % Disequality decompositions : 0
% 13.01/2.52 % Total rewrite steps : 5065
% 13.01/2.52 % ...of those cached : 4279
% 13.01/2.52 % Propositional unsat checks : 0
% 13.01/2.52 % Propositional check models : 0
% 13.01/2.52 % Propositional check unsatisfiable : 0
% 13.01/2.52 % Propositional clauses : 0
% 13.01/2.52 % Propositional clauses after purity: 0
% 13.01/2.52 % Propositional unsat core size : 0
% 13.01/2.52 % Propositional preprocessing time : 0.000
% 13.01/2.52 % Propositional encoding time : 0.000
% 13.01/2.52 % Propositional solver time : 0.000
% 13.01/2.52 % Success case prop preproc time : 0.000
% 13.01/2.52 % Success case prop encoding time : 0.000
% 13.01/2.52 % Success case prop solver time : 0.000
% 13.01/2.52 % Current number of processed clauses : 998
% 13.01/2.52 % Positive orientable unit clauses : 90
% 13.01/2.52 % Positive unorientable unit clauses: 0
% 13.01/2.52 % Negative unit clauses : 7
% 13.01/2.52 % Non-unit-clauses : 901
% 13.01/2.52 % Current number of unprocessed clauses: 107364
% 13.01/2.52 % ...number of literals in the above : 348485
% 13.01/2.52 % Current number of archived formulas : 0
% 13.01/2.52 % Current number of archived clauses : 18
% 13.01/2.52 % Clause-clause subsumption calls (NU) : 199186
% 13.01/2.52 % Rec. Clause-clause subsumption calls : 187654
% 13.01/2.52 % Non-unit clause-clause subsumptions : 9119
% 13.01/2.52 % Unit Clause-clause subsumption calls : 6103
% 13.01/2.52 % Rewrite failures with RHS unbound : 0
% 13.01/2.52 % BW rewrite match attempts : 11624
% 13.01/2.52 % BW rewrite match successes : 2
% 13.01/2.52 % Condensation attempts : 0
% 13.01/2.52 % Condensation successes : 0
% 13.01/2.52 % Termbank termtop insertions : 2139767
% 13.01/2.52 % Search garbage collected termcells : 8
% 13.01/2.52
% 13.01/2.52 % -------------------------------------------------
% 13.01/2.52 % User time : 1.666 s
% 13.01/2.52 % System time : 0.061 s
% 13.01/2.52 % Total time : 1.727 s
% 13.01/2.52 % Maximum resident set size: 3632 pages
% 13.01/2.52
% 13.01/2.52 % -------------------------------------------------
% 13.01/2.52 % User time : 1.667 s
% 13.01/2.52 % System time : 0.068 s
% 13.01/2.52 % Total time : 1.735 s
% 13.01/2.52 % Maximum resident set size: 4864 pages
% 13.01/2.52 % E exiting
%------------------------------------------------------------------------------