%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR100+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 : n001.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:16:51 PM UTC 2026
% Result : Theorem 2.33s 2.23s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 16 unt; 0 def)
% Number of atoms : 72 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 74 ( 33 ~; 29 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_1443,axiom,
! [X4,X5] :
( ( s__instance(X4,s__SetOrClass)
& s__instance(X5,s__SetOrClass) )
=> ( ( s__subclass(X5,X4)
& s__subclass(X4,X5) )
=> X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1443) ).
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_1539,axiom,
! [X4,X5,X105] :
( ( s__instance(X4,s__SetOrClass)
& s__instance(X5,s__SetOrClass)
& s__instance(X105,s__SetOrClass) )
=> ( ( s__subclass(X5,X105)
& s__subclass(X4,X5) )
=> s__subclass(X4,X105) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1539) ).
fof(local_8,axiom,
s__subclass(s__Class31_2,s__Class31_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_8) ).
fof(local_9,axiom,
s__subclass(s__Class31_3,s__Class31_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_9) ).
fof(prove_from_SUMO_MILO,conjecture,
s__instance(s__Animal31,s__Class31_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(local_7,axiom,
s__subclass(s__Class31_1,s__Class31_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_7) ).
fof(local_10,axiom,
s__instance(s__Animal31,s__Class31_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_10) ).
fof(c_0_8,plain,
! [X1238,X1239] :
( X1238 = X1239
| ~ s__subclass(X1239,X1238)
| ~ s__subclass(X1238,X1239)
| ~ s__instance(X1238,s__SetOrClass)
| ~ s__instance(X1239,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1443])])]) ).
fof(c_0_9,plain,
! [X1226,X1227] :
( ( ~ s__subclass(X1226,X1227)
| s__instance(X1227,s__SetOrClass) )
& ( ~ s__subclass(X1226,X1227)
| s__instance(X1226,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_10,plain,
! [X1240,X1241,X1242] :
( s__subclass(X1240,X1242)
| ~ s__subclass(X1241,X1242)
| ~ s__subclass(X1240,X1241)
| ~ s__instance(X1240,s__SetOrClass)
| ~ s__instance(X1241,s__SetOrClass)
| ~ s__instance(X1242,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1539])])]) ).
cnf(c_0_11,plain,
( ~ s__subclass(X1,X2)
| ~ s__subclass(X2,X1)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ s__subclass(X2,X1)
| ~ s__subclass(X3,X2)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| s__subclass(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ s__subclass(X1,X2)
| ~ s__subclass(X2,X1)
| X1 = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_16,plain,
s__subclass(s__Class31_2,s__Class31_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
cnf(c_0_17,plain,
( ~ s__subclass(X3,X2)
| ~ s__subclass(X1,X3)
| s__subclass(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_13,c_0_14]),c_0_12]),c_0_12]) ).
cnf(c_0_18,plain,
s__subclass(s__Class31_3,s__Class31_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
fof(c_0_19,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_0_20,plain,
( ~ s__subclass(s__Class31_3,s__Class31_2)
| s__Class31_3 = s__Class31_2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ s__subclass(s__Class31_1,X1)
| s__subclass(s__Class31_3,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
s__subclass(s__Class31_1,s__Class31_2),
inference(split_conjunct,[status(thm)],[local_7]) ).
fof(c_0_23,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( ~ s__subclass(s__Class31_1,s__Class31_3)
| s__Class31_3 = s__Class31_1 ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_25,plain,
s__Class31_3 = s__Class31_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
fof(c_0_26,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
s__instance(s__Animal31,s__Class31_2),
inference(split_conjunct,[status(thm)],[local_10]) ).
cnf(c_0_28,plain,
s__Class31_2 = s__Class31_1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR100+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.42 % Computer : n001.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.42 % DateTime : Mon Sep 21 15:03:59 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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.33/2.23 % Version: 3.5.1
% 2.33/2.23 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.33/2.23 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.33/2.23 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.33/2.23 % Starting new_bool_3 with 299s (1) cores
% 2.33/2.23 % Starting new_bool_1 with 299s (1) cores
% 2.33/2.23 % Starting sh5l with 299s (1) cores
% 2.33/2.23 % new_bool_1 with pid 3410218 completed with status 0
% 2.33/2.23 % Result found by new_bool_1
% 2.33/2.23 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.33/2.23 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.33/2.23 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.33/2.23 % Starting new_bool_3 with 299s (1) cores
% 2.33/2.23 % Starting new_bool_1 with 299s (1) cores
% 2.33/2.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.33/2.23 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.33/2.23 % Search class: FHUSF-FFMM00-SFFFFFNN
% 2.33/2.23 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 2.33/2.23 % Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 2.33/2.23 % Starting SubtermCWHack with 30s (1) cores
% 2.33/2.23 % SubtermCWHack with pid 3410220 completed with status 0
% 2.33/2.23 % Result found by SubtermCWHack
% 2.33/2.23 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.33/2.23 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.33/2.23 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.33/2.23 % Starting new_bool_3 with 299s (1) cores
% 2.33/2.23 % Starting new_bool_1 with 299s (1) cores
% 2.33/2.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.33/2.23 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.33/2.23 % Search class: FHUSF-FFMM00-SFFFFFNN
% 2.33/2.23 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 2.33/2.23 % Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 2.33/2.23 % Starting SubtermCWHack with 30s (1) cores
% 2.33/2.23 % Preprocessing time : 0.008 s
% 2.33/2.23
% 2.33/2.23 % Proof found!
% 2.33/2.23 % SZS status Theorem
% 2.33/2.23 % SZS output start CNFRefutation
% See solution above
% 2.33/2.23 % Parsed axioms : 37992
% 2.33/2.23 % Removed by relevancy pruning/SinE : 37910
% 2.33/2.23 % Initial clauses : 86
% 2.33/2.23 % Removed in clause preprocessing : 4
% 2.33/2.23 % Initial clauses in saturation : 82
% 2.33/2.23 % Processed clauses : 356
% 2.33/2.23 % ...of these trivial : 110
% 2.33/2.23 % ...subsumed : 0
% 2.33/2.23 % ...remaining for further processing : 246
% 2.33/2.23 % Other redundant clauses eliminated : 0
% 2.33/2.23 % Clauses deleted for lack of memory : 0
% 2.33/2.23 % Backward-subsumed : 0
% 2.33/2.23 % Backward-rewritten : 28
% 2.33/2.23 % Generated clauses : 509
% 2.33/2.23 % ...of the previous two non-redundant : 411
% 2.33/2.23 % ...aggressively subsumed : 0
% 2.33/2.23 % Contextual simplify-reflections : 8
% 2.33/2.23 % Paramodulations : 509
% 2.33/2.23 % Factorizations : 0
% 2.33/2.23 % NegExts : 0
% 2.33/2.23 % Equation resolutions : 0
% 2.33/2.23 % Disequality decompositions : 0
% 2.33/2.23 % Total rewrite steps : 230
% 2.33/2.23 % ...of those cached : 197
% 2.33/2.23 % Propositional unsat checks : 0
% 2.33/2.23 % Propositional check models : 0
% 2.33/2.23 % Propositional check unsatisfiable : 0
% 2.33/2.23 % Propositional clauses : 0
% 2.33/2.23 % Propositional clauses after purity: 0
% 2.33/2.23 % Propositional unsat core size : 0
% 2.33/2.23 % Propositional preprocessing time : 0.000
% 2.33/2.23 % Propositional encoding time : 0.000
% 2.33/2.23 % Propositional solver time : 0.000
% 2.33/2.23 % Success case prop preproc time : 0.000
% 2.33/2.23 % Success case prop encoding time : 0.000
% 2.33/2.23 % Success case prop solver time : 0.000
% 2.33/2.23 % Current number of processed clauses : 218
% 2.33/2.23 % Positive orientable unit clauses : 102
% 2.33/2.23 % Positive unorientable unit clauses: 0
% 2.33/2.23 % Negative unit clauses : 1
% 2.33/2.23 % Non-unit-clauses : 115
% 2.33/2.23 % Current number of unprocessed clauses: 134
% 2.33/2.23 % ...number of literals in the above : 270
% 2.33/2.23 % Current number of archived formulas : 0
% 2.33/2.23 % Current number of archived clauses : 28
% 2.33/2.23 % Clause-clause subsumption calls (NU) : 567
% 2.33/2.23 % Rec. Clause-clause subsumption calls : 561
% 2.33/2.23 % Non-unit clause-clause subsumptions : 8
% 2.33/2.23 % Unit Clause-clause subsumption calls : 12
% 2.33/2.23 % Rewrite failures with RHS unbound : 0
% 2.33/2.23 % BW rewrite match attempts : 4
% 2.33/2.23 % BW rewrite match successes : 4
% 2.33/2.23 % Condensation attempts : 0
% 2.33/2.23 % Condensation successes : 0
% 2.33/2.23 % Termbank termtop insertions : 254183
% 2.33/2.23 % Search garbage collected termcells : 125515
% 2.33/2.23
% 2.33/2.23 % -------------------------------------------------
% 2.33/2.23 % User time : 0.117 s
% 2.33/2.23 % System time : 0.064 s
% 2.33/2.23 % Total time : 0.181 s
% 2.33/2.23 % Maximum resident set size: 52072 pages
% 2.33/2.23
% 2.33/2.23 % -------------------------------------------------
% 2.33/2.23 % User time : 1.546 s
% 2.33/2.23 % System time : 0.138 s
% 2.33/2.23 % Total time : 1.684 s
% 2.33/2.23 % Maximum resident set size: 31488 pages
% 2.33/2.23 % E exiting
%------------------------------------------------------------------------------