%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL044-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 : n012.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:19 PM UTC 2026
% Result : Unsatisfiable 0.04s 5.35s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 14 unt; 0 nHn; 11 RR)
% Number of literals : 32 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 36 ( 5 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_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_40,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_40) ).
cnf(c_0_6,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_7,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_6 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
cn_54 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(implies(not(X1),X2),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
cn_21 ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_15,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
inference(fof_simplification,[status(thm)],[prove_cn_40]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X2,implies(X1,not(X2))))
| is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
c_0_15 ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL044-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.32 % Computer : n012.cluster.edu
% 0.04/5.32 % Model : x86_64 x86_64
% 0.04/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.32 % Memory : 8046.5625MB
% 0.04/5.32 % OS : Linux 6.8.0-71-generic
% 0.04/5.32 % CPULimit : 300
% 0.04/5.32 % WCLimit : 300
% 0.04/5.32 % DateTime : Mon Sep 21 00:01:28 UTC 2026
% 0.04/5.32 % CPUTime :
% 0.04/5.32 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.34 Running first-order theorem proving
% 0.04/5.34 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
% 0.04/5.35 % Version: 3.5.1
% 0.04/5.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/5.35 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.35 % Starting new_bool_1 with 300s (1) cores
% 0.04/5.35 % Starting sh5l with 300s (1) cores
% 0.04/5.35 % new_bool_3 with pid 1187212 completed with status 0
% 0.04/5.35 % Result found by new_bool_3
% 0.04/5.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/5.35 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/5.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/5.35 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.04/5.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/5.35 % Starting SubtermCWHack with 31s (1) cores
% 0.04/5.35 % SubtermCWHack with pid 1187217 completed with status 0
% 0.04/5.35 % Result found by SubtermCWHack
% 0.04/5.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/5.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/5.35 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/5.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/5.35 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.04/5.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/5.35 % Starting SubtermCWHack with 31s (1) cores
% 0.04/5.35 % Preprocessing time : 0.001 s
% 0.04/5.35
% 0.04/5.35 % Proof found!
% 0.04/5.35 % SZS status Unsatisfiable
% 0.04/5.35 % SZS output start CNFRefutation
% See solution above
% 0.04/5.35 % Parsed axioms : 7
% 0.04/5.35 % Removed by relevancy pruning/SinE : 0
% 0.04/5.35 % Initial clauses : 7
% 0.04/5.35 % Removed in clause preprocessing : 0
% 0.04/5.35 % Initial clauses in saturation : 7
% 0.04/5.35 % Processed clauses : 39
% 0.04/5.35 % ...of these trivial : 2
% 0.04/5.35 % ...subsumed : 7
% 0.04/5.35 % ...remaining for further processing : 30
% 0.04/5.35 % Other redundant clauses eliminated : 0
% 0.04/5.35 % Clauses deleted for lack of memory : 0
% 0.04/5.35 % Backward-subsumed : 0
% 0.04/5.35 % Backward-rewritten : 2
% 0.04/5.35 % Generated clauses : 69
% 0.04/5.35 % ...of the previous two non-redundant : 53
% 0.04/5.35 % ...aggressively subsumed : 0
% 0.04/5.35 % Contextual simplify-reflections : 0
% 0.04/5.35 % Paramodulations : 69
% 0.04/5.35 % Factorizations : 0
% 0.04/5.35 % NegExts : 0
% 0.04/5.35 % Equation resolutions : 0
% 0.04/5.35 % Disequality decompositions : 0
% 0.04/5.35 % Total rewrite steps : 9
% 0.04/5.35 % ...of those cached : 1
% 0.04/5.35 % Propositional unsat checks : 0
% 0.04/5.35 % Propositional check models : 0
% 0.04/5.35 % Propositional check unsatisfiable : 0
% 0.04/5.35 % Propositional clauses : 0
% 0.04/5.35 % Propositional clauses after purity: 0
% 0.04/5.35 % Propositional unsat core size : 0
% 0.04/5.35 % Propositional preprocessing time : 0.000
% 0.04/5.35 % Propositional encoding time : 0.000
% 0.04/5.35 % Propositional solver time : 0.000
% 0.04/5.35 % Success case prop preproc time : 0.000
% 0.04/5.35 % Success case prop encoding time : 0.000
% 0.04/5.35 % Success case prop solver time : 0.000
% 0.04/5.35 % Current number of processed clauses : 28
% 0.04/5.35 % Positive orientable unit clauses : 10
% 0.04/5.35 % Positive unorientable unit clauses: 0
% 0.04/5.35 % Negative unit clauses : 2
% 0.04/5.35 % Non-unit-clauses : 16
% 0.04/5.35 % Current number of unprocessed clauses: 21
% 0.04/5.35 % ...number of literals in the above : 41
% 0.04/5.35 % Current number of archived formulas : 0
% 0.04/5.35 % Current number of archived clauses : 2
% 0.04/5.35 % Clause-clause subsumption calls (NU) : 37
% 0.04/5.35 % Rec. Clause-clause subsumption calls : 37
% 0.04/5.35 % Non-unit clause-clause subsumptions : 6
% 0.04/5.35 % Unit Clause-clause subsumption calls : 21
% 0.04/5.35 % Rewrite failures with RHS unbound : 0
% 0.04/5.35 % BW rewrite match attempts : 48
% 0.04/5.35 % BW rewrite match successes : 2
% 0.04/5.35 % Condensation attempts : 0
% 0.04/5.35 % Condensation successes : 0
% 0.04/5.35 % Termbank termtop insertions : 988
% 0.04/5.35 % Search garbage collected termcells : 8
% 0.04/5.35
% 0.04/5.35 % -------------------------------------------------
% 0.04/5.35 % User time : 0.003 s
% 0.04/5.35 % System time : 0.001 s
% 0.04/5.35 % Total time : 0.004 s
% 0.04/5.35 % Maximum resident set size: 3636 pages
% 0.04/5.35
% 0.04/5.35 % -------------------------------------------------
% 0.04/5.35 % User time : 0.004 s
% 0.04/5.35 % System time : 0.004 s
% 0.04/5.35 % Total time : 0.008 s
% 0.04/5.35 % Maximum resident set size: 4864 pages
% 0.04/5.35 % E exiting
%------------------------------------------------------------------------------