%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR118+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 12:19:30 PM UTC 2026
% Result : Theorem 2.49s 6.82s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 41 ( 19 ~; 15 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 21 ( 2 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(abe_mammal,conjecture,
s__instance(s__AbrahamLincoln,s__Mammal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abe_mammal) ).
fof(kb_SUMO_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) )
=> ( ( s__instance(X8,X6)
& s__subclass(X6,X7) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).
fof(kb_SUMO_15954,axiom,
s__subclass(s__Human,s__Mammal),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+4.ax',kb_SUMO_15954) ).
fof(abe_human,axiom,
s__instance(s__AbrahamLincoln,s__Human),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abe_human) ).
fof(c_0_5,negated_conjecture,
~ s__instance(s__AbrahamLincoln,s__Mammal),
inference(assume_negation,[status(cth)],[abe_mammal]) ).
fof(c_0_6,plain,
! [X1227,X1228,X1229] :
( s__instance(X1229,X1228)
| ~ s__instance(X1229,X1227)
| ~ s__subclass(X1227,X1228)
| ~ s__instance(X1227,s__SetOrClass)
| ~ s__instance(X1228,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_7,plain,
! [X1225,X1226] :
( ( ~ s__subclass(X1225,X1226)
| s__instance(X1226,s__SetOrClass) )
& ( ~ s__subclass(X1225,X1226)
| s__instance(X1225,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
fof(c_0_8,negated_conjecture,
~ s__instance(s__AbrahamLincoln,s__Mammal),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ s__instance(X3,X2)
| ~ s__subclass(X2,X1)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| s__instance(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
~ s__instance(s__AbrahamLincoln,s__Mammal),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| s__instance(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
s__subclass(s__Human,s__Mammal),
inference(split_conjunct,[status(thm)],[kb_SUMO_15954]) ).
cnf(c_0_15,negated_conjecture,
~ s__instance(s__AbrahamLincoln,s__Mammal),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ s__instance(X1,s__Human)
| s__instance(X1,s__Mammal) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
s__instance(s__AbrahamLincoln,s__Human),
inference(split_conjunct,[status(thm)],[abe_human]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR118+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.47 % Computer : n020.cluster.edu
% 0.19/5.47 % Model : x86_64 x86_64
% 0.19/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.47 % Memory : 8046.5625MB
% 0.19/5.47 % OS : Linux 6.8.0-71-generic
% 0.19/5.47 % CPULimit : 300
% 0.19/5.47 % WCLimit : 300
% 0.19/5.47 % DateTime : Mon Sep 21 15:11:38 UTC 2026
% 0.19/5.47 % CPUTime :
% 0.19/5.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/5.52 Running first-order theorem proving
% 0.25/5.52 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
% 2.49/6.82 % Version: 3.5.1
% 2.49/6.82 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.49/6.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/6.82 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.49/6.82 % Starting new_bool_3 with 300s (1) cores
% 2.49/6.82 % Starting new_bool_1 with 300s (1) cores
% 2.49/6.82 % Starting sh5l with 300s (1) cores
% 2.49/6.82 % new_bool_3 with pid 3226691 completed with status 0
% 2.49/6.82 % Result found by new_bool_3
% 2.49/6.82 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.49/6.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/6.82 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.49/6.82 % Starting new_bool_3 with 300s (1) cores
% 2.49/6.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.49/6.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.49/6.82 % Search class: FHUSF-FFMM00-SFFFFFNN
% 2.49/6.82 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 2.49/6.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.49/6.82 % Starting SubtermCWHack with 31s (1) cores
% 2.49/6.82 % SubtermCWHack with pid 3226700 completed with status 0
% 2.49/6.82 % Result found by SubtermCWHack
% 2.49/6.82 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.49/6.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/6.82 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.49/6.82 % Starting new_bool_3 with 300s (1) cores
% 2.49/6.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.49/6.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.49/6.82 % Search class: FHUSF-FFMM00-SFFFFFNN
% 2.49/6.82 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 2.49/6.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.49/6.82 % Starting SubtermCWHack with 31s (1) cores
% 2.49/6.82 % Preprocessing time : 0.013 s
% 2.49/6.82
% 2.49/6.82 % Proof found!
% 2.49/6.82 % SZS status Theorem
% 2.49/6.82 % SZS output start CNFRefutation
% See solution above
% 2.49/6.82 % Parsed axioms : 37983
% 2.49/6.82 % Removed by relevancy pruning/SinE : 37840
% 2.49/6.82 % Initial clauses : 146
% 2.49/6.82 % Removed in clause preprocessing : 4
% 2.49/6.82 % Initial clauses in saturation : 142
% 2.49/6.82 % Processed clauses : 592
% 2.49/6.82 % ...of these trivial : 208
% 2.49/6.82 % ...subsumed : 0
% 2.49/6.82 % ...remaining for further processing : 384
% 2.49/6.82 % Other redundant clauses eliminated : 0
% 2.49/6.82 % Clauses deleted for lack of memory : 0
% 2.49/6.82 % Backward-subsumed : 0
% 2.49/6.82 % Backward-rewritten : 2
% 2.49/6.82 % Generated clauses : 841
% 2.49/6.82 % ...of the previous two non-redundant : 704
% 2.49/6.82 % ...aggressively subsumed : 0
% 2.49/6.82 % Contextual simplify-reflections : 7
% 2.49/6.82 % Paramodulations : 841
% 2.49/6.82 % Factorizations : 0
% 2.49/6.82 % NegExts : 0
% 2.49/6.82 % Equation resolutions : 0
% 2.49/6.82 % Disequality decompositions : 0
% 2.49/6.82 % Total rewrite steps : 305
% 2.49/6.82 % ...of those cached : 280
% 2.49/6.82 % Propositional unsat checks : 0
% 2.49/6.82 % Propositional check models : 0
% 2.49/6.82 % Propositional check unsatisfiable : 0
% 2.49/6.82 % Propositional clauses : 0
% 2.49/6.82 % Propositional clauses after purity: 0
% 2.49/6.82 % Propositional unsat core size : 0
% 2.49/6.82 % Propositional preprocessing time : 0.000
% 2.49/6.82 % Propositional encoding time : 0.000
% 2.49/6.82 % Propositional solver time : 0.000
% 2.49/6.82 % Success case prop preproc time : 0.000
% 2.49/6.82 % Success case prop encoding time : 0.000
% 2.49/6.82 % Success case prop solver time : 0.000
% 2.49/6.82 % Current number of processed clauses : 382
% 2.49/6.82 % Positive orientable unit clauses : 175
% 2.49/6.82 % Positive unorientable unit clauses: 0
% 2.49/6.82 % Negative unit clauses : 1
% 2.49/6.82 % Non-unit-clauses : 206
% 2.49/6.82 % Current number of unprocessed clauses: 254
% 2.49/6.82 % ...number of literals in the above : 508
% 2.49/6.82 % Current number of archived formulas : 0
% 2.49/6.82 % Current number of archived clauses : 2
% 2.49/6.82 % Clause-clause subsumption calls (NU) : 1218
% 2.49/6.82 % Rec. Clause-clause subsumption calls : 1212
% 2.49/6.82 % Non-unit clause-clause subsumptions : 7
% 2.49/6.82 % Unit Clause-clause subsumption calls : 4
% 2.49/6.82 % Rewrite failures with RHS unbound : 0
% 2.49/6.82 % BW rewrite match attempts : 2
% 2.49/6.82 % BW rewrite match successes : 2
% 2.49/6.82 % Condensation attempts : 0
% 2.49/6.82 % Condensation successes : 0
% 2.49/6.82 % Termbank termtop insertions : 257324
% 2.49/6.82 % Search garbage collected termcells : 125349
% 2.49/6.82
% 2.49/6.82 % -------------------------------------------------
% 2.49/6.82 % User time : 0.178 s
% 2.49/6.82 % System time : 0.113 s
% 2.49/6.82 % Total time : 0.291 s
% 2.49/6.82 % Maximum resident set size: 52068 pages
% 2.49/6.82
% 2.49/6.82 % -------------------------------------------------
% 2.49/6.82 % User time : 1.011 s
% 2.49/6.82 % System time : 0.175 s
% 2.49/6.82 % Total time : 1.186 s
% 2.49/6.82 % Maximum resident set size: 31488 pages
% 2.49/6.82 % E exiting
%------------------------------------------------------------------------------