%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR100+5 : 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 1.60s 1.51s
% Output : CNFRefutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 12 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 45 ( 21 ~; 17 |; 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 23 ( 2 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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_9,axiom,
s__subclass(s__Class31_3,s__Class31_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_9) ).
fof(local_8,axiom,
s__subclass(s__Class31_2,s__Class31_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_8) ).
fof(local_10,axiom,
s__instance(s__Animal31,s__Class31_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_10) ).
fof(c_0_6,plain,
! [X1226,X1227,X1228] :
( s__instance(X1228,X1227)
| ~ s__instance(X1228,X1226)
| ~ s__subclass(X1226,X1227)
| ~ s__instance(X1226,s__SetOrClass)
| ~ s__instance(X1227,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,
! [X1224,X1225] :
( ( ~ s__subclass(X1224,X1225)
| s__instance(X1225,s__SetOrClass) )
& ( ~ s__subclass(X1224,X1225)
| s__instance(X1224,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
cnf(c_0_8,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_9,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_0_12,plain,
( ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| s__instance(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,plain,
s__subclass(s__Class31_3,s__Class31_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_14,plain,
s__subclass(s__Class31_2,s__Class31_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
fof(c_0_15,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ s__instance(X1,s__Class31_3)
| s__instance(X1,s__Class31_1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,s__Class31_2)
| s__instance(X1,s__Class31_3) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
fof(c_0_18,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ s__instance(X1,s__Class31_2)
| s__instance(X1,s__Class31_1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
s__instance(s__Animal31,s__Class31_2),
inference(split_conjunct,[status(thm)],[local_10]) ).
cnf(c_0_21,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR100+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n001.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 15:04:15 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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
% 1.60/1.51 % Version: 3.5.1
% 1.60/1.51 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.60/1.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/1.51 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.60/1.51 % Starting new_bool_3 with 300s (1) cores
% 1.60/1.51 % Starting new_bool_1 with 300s (1) cores
% 1.60/1.51 % Starting sh5l with 300s (1) cores
% 1.60/1.51 % new_bool_1 with pid 3410611 completed with status 0
% 1.60/1.51 % Result found by new_bool_1
% 1.60/1.51 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.60/1.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/1.51 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.60/1.51 % Starting new_bool_3 with 300s (1) cores
% 1.60/1.51 % Starting new_bool_1 with 300s (1) cores
% 1.60/1.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.60/1.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.60/1.51 % Search class: FHUSF-FFMM32-SFFFFFNN
% 1.60/1.51 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.60/1.51 % Starting SubtermCWHack with 31s (1) cores
% 1.60/1.51 % SubtermCWHack with pid 3410614 completed with status 0
% 1.60/1.51 % Result found by SubtermCWHack
% 1.60/1.51 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.60/1.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/1.51 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.60/1.51 % Starting new_bool_3 with 300s (1) cores
% 1.60/1.51 % Starting new_bool_1 with 300s (1) cores
% 1.60/1.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.60/1.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.60/1.51 % Search class: FHUSF-FFMM32-SFFFFFNN
% 1.60/1.51 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.60/1.51 % Starting SubtermCWHack with 31s (1) cores
% 1.60/1.51 % Preprocessing time : 0.012 s
% 1.60/1.51
% 1.60/1.51 % Proof found!
% 1.60/1.51 % SZS status Theorem
% 1.60/1.51 % SZS output start CNFRefutation
% See solution above
% 1.60/1.51 % Parsed axioms : 16759
% 1.60/1.51 % Removed by relevancy pruning/SinE : 16724
% 1.60/1.51 % Initial clauses : 39
% 1.60/1.51 % Removed in clause preprocessing : 4
% 1.60/1.51 % Initial clauses in saturation : 35
% 1.60/1.51 % Processed clauses : 65
% 1.60/1.51 % ...of these trivial : 9
% 1.60/1.51 % ...subsumed : 0
% 1.60/1.51 % ...remaining for further processing : 56
% 1.60/1.51 % Other redundant clauses eliminated : 0
% 1.60/1.51 % Clauses deleted for lack of memory : 0
% 1.60/1.51 % Backward-subsumed : 0
% 1.60/1.51 % Backward-rewritten : 1
% 1.60/1.51 % Generated clauses : 58
% 1.60/1.51 % ...of the previous two non-redundant : 40
% 1.60/1.51 % ...aggressively subsumed : 0
% 1.60/1.51 % Contextual simplify-reflections : 5
% 1.60/1.51 % Paramodulations : 58
% 1.60/1.51 % Factorizations : 0
% 1.60/1.51 % NegExts : 0
% 1.60/1.51 % Equation resolutions : 0
% 1.60/1.51 % Disequality decompositions : 0
% 1.60/1.51 % Total rewrite steps : 22
% 1.60/1.51 % ...of those cached : 11
% 1.60/1.51 % Propositional unsat checks : 0
% 1.60/1.51 % Propositional check models : 0
% 1.60/1.51 % Propositional check unsatisfiable : 0
% 1.60/1.51 % Propositional clauses : 0
% 1.60/1.51 % Propositional clauses after purity: 0
% 1.60/1.51 % Propositional unsat core size : 0
% 1.60/1.51 % Propositional preprocessing time : 0.000
% 1.60/1.51 % Propositional encoding time : 0.000
% 1.60/1.51 % Propositional solver time : 0.000
% 1.60/1.51 % Success case prop preproc time : 0.000
% 1.60/1.51 % Success case prop encoding time : 0.000
% 1.60/1.51 % Success case prop solver time : 0.000
% 1.60/1.51 % Current number of processed clauses : 55
% 1.60/1.51 % Positive orientable unit clauses : 27
% 1.60/1.51 % Positive unorientable unit clauses: 0
% 1.60/1.51 % Negative unit clauses : 1
% 1.60/1.51 % Non-unit-clauses : 27
% 1.60/1.51 % Current number of unprocessed clauses: 10
% 1.60/1.51 % ...number of literals in the above : 33
% 1.60/1.51 % Current number of archived formulas : 0
% 1.60/1.51 % Current number of archived clauses : 1
% 1.60/1.51 % Clause-clause subsumption calls (NU) : 15
% 1.60/1.51 % Rec. Clause-clause subsumption calls : 15
% 1.60/1.51 % Non-unit clause-clause subsumptions : 5
% 1.60/1.51 % Unit Clause-clause subsumption calls : 0
% 1.60/1.51 % Rewrite failures with RHS unbound : 0
% 1.60/1.51 % BW rewrite match attempts : 1
% 1.60/1.51 % BW rewrite match successes : 1
% 1.60/1.51 % Condensation attempts : 0
% 1.60/1.51 % Condensation successes : 0
% 1.60/1.51 % Termbank termtop insertions : 165595
% 1.60/1.51 % Search garbage collected termcells : 87472
% 1.60/1.51
% 1.60/1.51 % -------------------------------------------------
% 1.60/1.51 % User time : 0.103 s
% 1.60/1.51 % System time : 0.073 s
% 1.60/1.51 % Total time : 0.176 s
% 1.60/1.51 % Maximum resident set size: 42596 pages
% 1.60/1.51
% 1.60/1.51 % -------------------------------------------------
% 1.60/1.51 % User time : 0.817 s
% 1.60/1.51 % System time : 0.133 s
% 1.60/1.51 % Total time : 0.949 s
% 1.60/1.51 % Maximum resident set size: 22016 pages
% 1.60/1.51 % E exiting
%------------------------------------------------------------------------------