%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR118+3 : 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 : 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 12:19:30 PM UTC 2026
% Result : Theorem 0.15s 6.31s
% Output : CNFRefutation 0.15s
% 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_26636,axiom,
! [X1,X15,X13] :
( ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) )
=> ( ( s__instance(X13,X1)
& s__subclass(X1,X15) )
=> s__instance(X13,X15) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26636) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X15,s__SetOrClass)
& s__instance(X1,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(kb_SUMO_68888,axiom,
s__subclass(s__Human,s__Mammal),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+5.ax',kb_SUMO_68888) ).
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,
! [X2350,X2351,X2352] :
( s__instance(X2352,X2351)
| ~ s__instance(X2352,X2350)
| ~ s__subclass(X2350,X2351)
| ~ s__instance(X2350,s__SetOrClass)
| ~ s__instance(X2351,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_7,plain,
! [X2348,X2349] :
( ( ~ s__subclass(X2348,X2349)
| s__instance(X2349,s__SetOrClass) )
& ( ~ s__subclass(X2348,X2349)
| s__instance(X2348,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
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__subclass(X3,X2)
| ~ s__instance(X1,X3)
| 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_68888]) ).
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.02 % Problem : CSR118+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 15:10:41 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/0.40 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.15/6.31 % Version: 3.5.1
% 0.15/6.31 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.15/6.31 % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 0.15/6.31 % Starting G-E--_300_C01_S5PRR_S00 with 1475s (5) cores
% 0.15/6.31 % Starting new_bool_3 with 295s (1) cores
% 0.15/6.31 % Starting new_bool_1 with 295s (1) cores
% 0.15/6.31 % Starting sh5l with 295s (1) cores
% 0.15/6.31 % new_bool_3 with pid 2208704 completed with status 0
% 0.15/6.31 % Result found by new_bool_3
% 0.15/6.31 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.15/6.31 % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 0.15/6.31 % Starting G-E--_300_C01_S5PRR_S00 with 1475s (5) cores
% 0.15/6.31 % Starting new_bool_3 with 295s (1) cores
% 0.15/6.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/6.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/6.31 % Search class: FHUSF-FFMM21-SFFFFFNN
% 0.15/6.31 % partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.15/6.31 % Scheduled 5 strats onto 1 cores with 295 seconds (295 total)
% 0.15/6.31 % Starting SubtermCWHack with 30s (1) cores
% 0.15/6.31 % SubtermCWHack with pid 2208708 completed with status 0
% 0.15/6.31 % Result found by SubtermCWHack
% 0.15/6.31 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.15/6.31 % Scheduled 4 strats onto 8 cores with 295 seconds (2360 total)
% 0.15/6.31 % Starting G-E--_300_C01_S5PRR_S00 with 1475s (5) cores
% 0.15/6.31 % Starting new_bool_3 with 295s (1) cores
% 0.15/6.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/6.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/6.31 % Search class: FHUSF-FFMM21-SFFFFFNN
% 0.15/6.31 % partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.15/6.31 % Scheduled 5 strats onto 1 cores with 295 seconds (295 total)
% 0.15/6.31 % Starting SubtermCWHack with 30s (1) cores
% 0.15/6.31 % Preprocessing time : 0.014 s
% 0.15/6.31
% 0.15/6.31 % Proof found!
% 0.15/6.31 % SZS status Theorem
% 0.15/6.31 % SZS output start CNFRefutation
% See solution above
% 0.15/6.31 % Parsed axioms : 145103
% 0.15/6.31 % Removed by relevancy pruning/SinE : 144960
% 0.15/6.31 % Initial clauses : 146
% 0.15/6.31 % Removed in clause preprocessing : 4
% 0.15/6.31 % Initial clauses in saturation : 142
% 0.15/6.31 % Processed clauses : 590
% 0.15/6.31 % ...of these trivial : 204
% 0.15/6.31 % ...subsumed : 0
% 0.15/6.31 % ...remaining for further processing : 386
% 0.15/6.31 % Other redundant clauses eliminated : 0
% 0.15/6.31 % Clauses deleted for lack of memory : 0
% 0.15/6.31 % Backward-subsumed : 0
% 0.15/6.31 % Backward-rewritten : 2
% 0.15/6.31 % Generated clauses : 804
% 0.15/6.31 % ...of the previous two non-redundant : 671
% 0.15/6.31 % ...aggressively subsumed : 0
% 0.15/6.31 % Contextual simplify-reflections : 7
% 0.15/6.31 % Paramodulations : 804
% 0.15/6.31 % Factorizations : 0
% 0.15/6.31 % NegExts : 0
% 0.15/6.31 % Equation resolutions : 0
% 0.15/6.31 % Disequality decompositions : 0
% 0.15/6.31 % Total rewrite steps : 299
% 0.15/6.31 % ...of those cached : 275
% 0.15/6.31 % Propositional unsat checks : 0
% 0.15/6.31 % Propositional check models : 0
% 0.15/6.31 % Propositional check unsatisfiable : 0
% 0.15/6.31 % Propositional clauses : 0
% 0.15/6.31 % Propositional clauses after purity: 0
% 0.15/6.31 % Propositional unsat core size : 0
% 0.15/6.31 % Propositional preprocessing time : 0.000
% 0.15/6.31 % Propositional encoding time : 0.000
% 0.15/6.31 % Propositional solver time : 0.000
% 0.15/6.31 % Success case prop preproc time : 0.000
% 0.15/6.31 % Success case prop encoding time : 0.000
% 0.15/6.31 % Success case prop solver time : 0.000
% 0.15/6.31 % Current number of processed clauses : 384
% 0.15/6.31 % Positive orientable unit clauses : 171
% 0.15/6.31 % Positive unorientable unit clauses: 0
% 0.15/6.31 % Negative unit clauses : 1
% 0.15/6.31 % Non-unit-clauses : 212
% 0.15/6.31 % Current number of unprocessed clauses: 223
% 0.15/6.31 % ...number of literals in the above : 446
% 0.15/6.31 % Current number of archived formulas : 0
% 0.15/6.31 % Current number of archived clauses : 2
% 0.15/6.31 % Clause-clause subsumption calls (NU) : 1673
% 0.15/6.31 % Rec. Clause-clause subsumption calls : 1644
% 0.15/6.31 % Non-unit clause-clause subsumptions : 7
% 0.15/6.31 % Unit Clause-clause subsumption calls : 7
% 0.15/6.31 % Rewrite failures with RHS unbound : 0
% 0.15/6.31 % BW rewrite match attempts : 2
% 0.15/6.31 % BW rewrite match successes : 2
% 0.15/6.31 % Condensation attempts : 0
% 0.15/6.31 % Condensation successes : 0
% 0.15/6.31 % Termbank termtop insertions : 1015611
% 0.15/6.31 % Search garbage collected termcells : 459384
% 0.15/6.31
% 0.15/6.31 % -------------------------------------------------
% 0.15/6.31 % User time : 0.468 s
% 0.15/6.31 % System time : 0.248 s
% 0.15/6.31 % Total time : 0.716 s
% 0.15/6.31 % Maximum resident set size: 177904 pages
% 0.15/6.31
% 0.15/6.31 % -------------------------------------------------
% 0.15/6.31 % User time : 5.383 s
% 0.15/6.31 % System time : 0.442 s
% 0.15/6.31 % Total time : 5.825 s
% 0.15/6.31 % Maximum resident set size: 104704 pages
% 0.15/6.31 % E exiting
%------------------------------------------------------------------------------