%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL057-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 : n011.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:21 PM UTC 2026
% Result : Unsatisfiable 15.31s 3.68s
% Output : CNFRefutation 15.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 35 ( 17 unt; 0 nHn; 15 RR)
% Number of literals : 60 ( 0 equ; 28 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 : 3 ( 3 usr; 1 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/sandbox/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/sandbox/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(prove_cn_40,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_40) ).
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,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_27,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_28,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_29,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
inference(fof_simplification,[status(thm)],[prove_cn_40]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(implies(not(X2),not(X1)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
c_0_29 ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL057-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n011.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 00:02:25 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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
% 15.31/3.68 % Version: 3.5.1
% 15.31/3.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 15.31/3.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.31/3.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.31/3.68 % Starting new_bool_3 with 300s (1) cores
% 15.31/3.68 % Starting new_bool_1 with 300s (1) cores
% 15.31/3.68 % Starting sh5l with 300s (1) cores
% 15.31/3.68 % sh5l with pid 532342 completed with status 0
% 15.31/3.68 % Result found by sh5l
% 15.31/3.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 15.31/3.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.31/3.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.31/3.68 % Starting new_bool_3 with 300s (1) cores
% 15.31/3.68 % Starting new_bool_1 with 300s (1) cores
% 15.31/3.68 % Starting sh5l with 300s (1) cores
% 15.31/3.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 15.31/3.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 15.31/3.68 % Search class: FHUNS-FFSF21-MFFFFFNN
% 15.31/3.68 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 15.31/3.68 % Starting SubtermCWHack with 28s (1) cores
% 15.31/3.68 % SubtermCWHack with pid 532349 completed with status 0
% 15.31/3.68 % Result found by SubtermCWHack
% 15.31/3.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 15.31/3.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.31/3.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.31/3.68 % Starting new_bool_3 with 300s (1) cores
% 15.31/3.68 % Starting new_bool_1 with 300s (1) cores
% 15.31/3.68 % Starting sh5l with 300s (1) cores
% 15.31/3.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 15.31/3.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 15.31/3.68 % Search class: FHUNS-FFSF21-MFFFFFNN
% 15.31/3.68 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 15.31/3.68 % Starting SubtermCWHack with 28s (1) cores
% 15.31/3.68 % Preprocessing time : 0.002 s
% 15.31/3.68
% 15.31/3.68 % Proof found!
% 15.31/3.68 % SZS status Unsatisfiable
% 15.31/3.68 % SZS output start CNFRefutation
% See solution above
% 15.31/3.68 % Parsed axioms : 5
% 15.31/3.68 % Removed by relevancy pruning/SinE : 0
% 15.31/3.68 % Initial clauses : 5
% 15.31/3.68 % Removed in clause preprocessing : 0
% 15.31/3.68 % Initial clauses in saturation : 5
% 15.31/3.68 % Processed clauses : 10756
% 15.31/3.68 % ...of these trivial : 252
% 15.31/3.68 % ...subsumed : 9479
% 15.31/3.68 % ...remaining for further processing : 1025
% 15.31/3.68 % Other redundant clauses eliminated : 0
% 15.31/3.68 % Clauses deleted for lack of memory : 0
% 15.31/3.68 % Backward-subsumed : 13
% 15.31/3.68 % Backward-rewritten : 2
% 15.31/3.68 % Generated clauses : 125111
% 15.31/3.68 % ...of the previous two non-redundant : 120014
% 15.31/3.68 % ...aggressively subsumed : 0
% 15.31/3.68 % Contextual simplify-reflections : 0
% 15.31/3.68 % Paramodulations : 125111
% 15.31/3.68 % Factorizations : 0
% 15.31/3.68 % NegExts : 0
% 15.31/3.68 % Equation resolutions : 0
% 15.31/3.68 % Disequality decompositions : 0
% 15.31/3.68 % Total rewrite steps : 5139
% 15.31/3.68 % ...of those cached : 4351
% 15.31/3.68 % Propositional unsat checks : 0
% 15.31/3.68 % Propositional check models : 0
% 15.31/3.68 % Propositional check unsatisfiable : 0
% 15.31/3.68 % Propositional clauses : 0
% 15.31/3.68 % Propositional clauses after purity: 0
% 15.31/3.68 % Propositional unsat core size : 0
% 15.31/3.68 % Propositional preprocessing time : 0.000
% 15.31/3.68 % Propositional encoding time : 0.000
% 15.31/3.68 % Propositional solver time : 0.000
% 15.31/3.68 % Success case prop preproc time : 0.000
% 15.31/3.68 % Success case prop encoding time : 0.000
% 15.31/3.68 % Success case prop solver time : 0.000
% 15.31/3.68 % Current number of processed clauses : 1010
% 15.31/3.68 % Positive orientable unit clauses : 89
% 15.31/3.68 % Positive unorientable unit clauses: 0
% 15.31/3.68 % Negative unit clauses : 2
% 15.31/3.68 % Non-unit-clauses : 919
% 15.31/3.68 % Current number of unprocessed clauses: 109221
% 15.31/3.68 % ...number of literals in the above : 354761
% 15.31/3.68 % Current number of archived formulas : 0
% 15.31/3.68 % Current number of archived clauses : 15
% 15.31/3.68 % Clause-clause subsumption calls (NU) : 207380
% 15.31/3.68 % Rec. Clause-clause subsumption calls : 195379
% 15.31/3.68 % Non-unit clause-clause subsumptions : 9492
% 15.31/3.68 % Unit Clause-clause subsumption calls : 5962
% 15.31/3.68 % Rewrite failures with RHS unbound : 0
% 15.31/3.68 % BW rewrite match attempts : 11195
% 15.31/3.68 % BW rewrite match successes : 2
% 15.31/3.68 % Condensation attempts : 0
% 15.31/3.68 % Condensation successes : 0
% 15.31/3.68 % Termbank termtop insertions : 2179135
% 15.31/3.68 % Search garbage collected termcells : 8
% 15.31/3.68
% 15.31/3.68 % -------------------------------------------------
% 15.31/3.68 % User time : 2.971 s
% 15.31/3.68 % System time : 0.120 s
% 15.31/3.68 % Total time : 3.092 s
% 15.31/3.68 % Maximum resident set size: 3632 pages
% 15.31/3.68
% 15.31/3.68 % -------------------------------------------------
% 15.31/3.68 % User time : 2.975 s
% 15.31/3.68 % System time : 0.125 s
% 15.31/3.68 % Total time : 3.100 s
% 15.31/3.68 % Maximum resident set size: 4608 pages
% 15.31/3.68 % E exiting
%------------------------------------------------------------------------------