%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR094+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:46 PM UTC 2026
% Result : Theorem 0.66s 1.37s
% Output : CNFRefutation 0.66s
% 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(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/sandbox2/benchmark/Axioms/CSR003+0.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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).
fof(prove_from_SUMO,conjecture,
s__instance(s__Rover24_1,s__CorpuscularObject),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMOcache_3900,axiom,
s__subclass(s__Canine,s__CorpuscularObject),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+3.ax',kb_SUMOcache_3900) ).
fof(local_1,axiom,
s__instance(s__Rover24_1,s__Canine),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(c_0_5,plain,
! [X595,X596,X597] :
( s__instance(X597,X596)
| ~ s__instance(X597,X595)
| ~ s__subclass(X595,X596)
| ~ s__instance(X595,s__SetOrClass)
| ~ s__instance(X596,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_6,plain,
! [X593,X594] :
( ( ~ s__subclass(X593,X594)
| s__instance(X594,s__SetOrClass) )
& ( ~ s__subclass(X593,X594)
| s__instance(X593,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_7,negated_conjecture,
~ s__instance(s__Rover24_1,s__CorpuscularObject),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
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_5]) ).
cnf(c_0_9,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
~ s__instance(s__Rover24_1,s__CorpuscularObject),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
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__Canine,s__CorpuscularObject),
inference(split_conjunct,[status(thm)],[kb_SUMOcache_3900]) ).
fof(c_0_14,negated_conjecture,
~ s__instance(s__Rover24_1,s__CorpuscularObject),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ s__instance(X1,s__Canine)
| s__instance(X1,s__CorpuscularObject) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
s__instance(s__Rover24_1,s__Canine),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_17,negated_conjecture,
~ s__instance(s__Rover24_1,s__CorpuscularObject),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR094+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.67 % Computer : n004.cluster.edu
% 0.19/0.67 % Model : x86_64 x86_64
% 0.19/0.67 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.67 % Memory : 8046.5625MB
% 0.19/0.67 % OS : Linux 6.8.0-71-generic
% 0.19/0.67 % CPULimit : 300
% 0.19/0.67 % WCLimit : 300
% 0.19/0.67 % DateTime : Mon Sep 21 14:55:51 UTC 2026
% 0.19/0.67 % CPUTime :
% 0.19/0.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.74 Running first-order theorem proving
% 0.23/0.74 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.66/1.37 % Version: 3.5.1
% 0.66/1.37 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.66/1.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/1.37 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.66/1.37 % Starting new_bool_3 with 300s (1) cores
% 0.66/1.37 % Starting new_bool_1 with 300s (1) cores
% 0.66/1.37 % Starting sh5l with 300s (1) cores
% 0.66/1.37 % new_bool_1 with pid 3408423 completed with status 0
% 0.66/1.37 % Result found by new_bool_1
% 0.66/1.37 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.66/1.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/1.37 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.66/1.37 % Starting new_bool_3 with 300s (1) cores
% 0.66/1.37 % Starting new_bool_1 with 300s (1) cores
% 0.66/1.37 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.66/1.37 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/1.37 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.66/1.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.66/1.37 % Starting SubtermCWHack with 28s (1) cores
% 0.66/1.37 % SubtermCWHack with pid 3408425 completed with status 0
% 0.66/1.37 % Result found by SubtermCWHack
% 0.66/1.37 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.66/1.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/1.37 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.66/1.37 % Starting new_bool_3 with 300s (1) cores
% 0.66/1.37 % Starting new_bool_1 with 300s (1) cores
% 0.66/1.37 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.66/1.37 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/1.37 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.66/1.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.66/1.37 % Starting SubtermCWHack with 28s (1) cores
% 0.66/1.37 % Preprocessing time : 0.009 s
% 0.66/1.37
% 0.66/1.37 % Proof found!
% 0.66/1.37 % SZS status Theorem
% 0.66/1.37 % SZS output start CNFRefutation
% See solution above
% 0.66/1.37 % Parsed axioms : 14789
% 0.66/1.37 % Removed by relevancy pruning/SinE : 14599
% 0.66/1.37 % Initial clauses : 197
% 0.66/1.37 % Removed in clause preprocessing : 4
% 0.66/1.37 % Initial clauses in saturation : 193
% 0.66/1.37 % Processed clauses : 706
% 0.66/1.37 % ...of these trivial : 265
% 0.66/1.37 % ...subsumed : 2
% 0.66/1.37 % ...remaining for further processing : 439
% 0.66/1.37 % Other redundant clauses eliminated : 0
% 0.66/1.37 % Clauses deleted for lack of memory : 0
% 0.66/1.37 % Backward-subsumed : 0
% 0.66/1.37 % Backward-rewritten : 2
% 0.66/1.37 % Generated clauses : 1026
% 0.66/1.37 % ...of the previous two non-redundant : 856
% 0.66/1.37 % ...aggressively subsumed : 0
% 0.66/1.37 % Contextual simplify-reflections : 9
% 0.66/1.37 % Paramodulations : 1026
% 0.66/1.37 % Factorizations : 0
% 0.66/1.37 % NegExts : 0
% 0.66/1.37 % Equation resolutions : 0
% 0.66/1.37 % Disequality decompositions : 0
% 0.66/1.37 % Total rewrite steps : 394
% 0.66/1.37 % ...of those cached : 364
% 0.66/1.37 % Propositional unsat checks : 0
% 0.66/1.37 % Propositional check models : 0
% 0.66/1.37 % Propositional check unsatisfiable : 0
% 0.66/1.37 % Propositional clauses : 0
% 0.66/1.37 % Propositional clauses after purity: 0
% 0.66/1.37 % Propositional unsat core size : 0
% 0.66/1.37 % Propositional preprocessing time : 0.000
% 0.66/1.37 % Propositional encoding time : 0.000
% 0.66/1.37 % Propositional solver time : 0.000
% 0.66/1.37 % Success case prop preproc time : 0.000
% 0.66/1.37 % Success case prop encoding time : 0.000
% 0.66/1.37 % Success case prop solver time : 0.000
% 0.66/1.37 % Current number of processed clauses : 437
% 0.66/1.37 % Positive orientable unit clauses : 230
% 0.66/1.37 % Positive unorientable unit clauses: 0
% 0.66/1.37 % Negative unit clauses : 1
% 0.66/1.37 % Non-unit-clauses : 206
% 0.66/1.37 % Current number of unprocessed clauses: 341
% 0.66/1.37 % ...number of literals in the above : 694
% 0.66/1.37 % Current number of archived formulas : 0
% 0.66/1.37 % Current number of archived clauses : 2
% 0.66/1.37 % Clause-clause subsumption calls (NU) : 2662
% 0.66/1.37 % Rec. Clause-clause subsumption calls : 2624
% 0.66/1.37 % Non-unit clause-clause subsumptions : 11
% 0.66/1.37 % Unit Clause-clause subsumption calls : 55
% 0.66/1.37 % Rewrite failures with RHS unbound : 0
% 0.66/1.37 % BW rewrite match attempts : 2
% 0.66/1.37 % BW rewrite match successes : 2
% 0.66/1.37 % Condensation attempts : 0
% 0.66/1.37 % Condensation successes : 0
% 0.66/1.37 % Termbank termtop insertions : 119064
% 0.66/1.37 % Search garbage collected termcells : 52770
% 0.66/1.37
% 0.66/1.37 % -------------------------------------------------
% 0.66/1.37 % User time : 0.095 s
% 0.66/1.37 % System time : 0.063 s
% 0.66/1.37 % Total time : 0.158 s
% 0.66/1.37 % Maximum resident set size: 22112 pages
% 0.66/1.37
% 0.66/1.37 % -------------------------------------------------
% 0.66/1.37 % User time : 0.451 s
% 0.66/1.37 % System time : 0.097 s
% 0.66/1.37 % Total time : 0.548 s
% 0.66/1.37 % Maximum resident set size: 15360 pages
% 0.66/1.37 % E exiting
%------------------------------------------------------------------------------