%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR101+2 : 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 : n006.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:52 PM UTC 2026
% Result : Theorem 0.98s 1.48s
% Output : CNFRefutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 73 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 76 ( 32 ~; 29 |; 8 &)
% ( 0 <=>; 7 =>; 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 : 31 ( 2 sgn 16 !; 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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1539) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_8) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_9) ).
fof(prove_from_SUMO_MILO,conjecture,
! [X1223] :
( s__instance(X1223,s__Class32_2)
=> s__instance(X1223,s__Class32_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(local_7,axiom,
s__subclass(s__Class32_1,s__Class32_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_7) ).
fof(c_0_7,plain,
! [X1240,X1241] :
( X1240 = X1241
| ~ s__subclass(X1241,X1240)
| ~ s__subclass(X1240,X1241)
| ~ s__instance(X1240,s__SetOrClass)
| ~ s__instance(X1241,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1443])])]) ).
fof(c_0_8,plain,
! [X1228,X1229] :
( ( ~ s__subclass(X1228,X1229)
| s__instance(X1229,s__SetOrClass) )
& ( ~ s__subclass(X1228,X1229)
| s__instance(X1228,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_9,plain,
! [X1242,X1243,X1244] :
( s__subclass(X1242,X1244)
| ~ s__subclass(X1243,X1244)
| ~ s__subclass(X1242,X1243)
| ~ s__instance(X1242,s__SetOrClass)
| ~ s__instance(X1243,s__SetOrClass)
| ~ s__instance(X1244,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1539])])]) ).
cnf(c_0_10,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_7]) ).
cnf(c_0_11,plain,
( ~ s__subclass(X1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,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_9]) ).
cnf(c_0_13,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ s__subclass(X1,X2)
| ~ s__subclass(X2,X1)
| X1 = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_15,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
cnf(c_0_16,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_12,c_0_13]),c_0_11]),c_0_11]) ).
cnf(c_0_17,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1223] :
( s__instance(X1223,s__Class32_2)
=> s__instance(X1223,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_0_19,plain,
( ~ s__subclass(s__Class32_3,s__Class32_2)
| s__Class32_3 = s__Class32_2 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ s__subclass(s__Class32_1,X1)
| s__subclass(s__Class32_3,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
s__subclass(s__Class32_1,s__Class32_2),
inference(split_conjunct,[status(thm)],[local_7]) ).
fof(c_0_22,negated_conjecture,
( ~ s__instance(esk1_0,s__Class32_1)
& s__instance(esk1_0,s__Class32_2) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_23,plain,
( ~ s__subclass(s__Class32_1,s__Class32_3)
| s__Class32_3 = s__Class32_1 ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_24,plain,
s__Class32_3 = s__Class32_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
s__instance(esk1_0,s__Class32_2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
s__Class32_2 = s__Class32_1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
~ s__instance(esk1_0,s__Class32_1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR101+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n006.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 14:58:27 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.98/1.48 % Version: 3.5.1
% 0.98/1.48 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.98/1.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/1.48 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.98/1.48 % Starting new_bool_3 with 300s (1) cores
% 0.98/1.48 % Starting new_bool_1 with 300s (1) cores
% 0.98/1.48 % Starting sh5l with 300s (1) cores
% 0.98/1.48 % new_bool_1 with pid 3103191 completed with status 0
% 0.98/1.48 % Result found by new_bool_1
% 0.98/1.48 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.98/1.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/1.48 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.98/1.48 % Starting new_bool_3 with 300s (1) cores
% 0.98/1.48 % Starting new_bool_1 with 300s (1) cores
% 0.98/1.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.98/1.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.98/1.48 % Search class: FHUSF-FFMM00-SFFFFFNN
% 0.98/1.48 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 0.98/1.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.98/1.48 % Starting SubtermCWHack with 31s (1) cores
% 0.98/1.48 % SubtermCWHack with pid 3103193 completed with status 0
% 0.98/1.48 % Result found by SubtermCWHack
% 0.98/1.48 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.98/1.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/1.48 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.98/1.48 % Starting new_bool_3 with 300s (1) cores
% 0.98/1.48 % Starting new_bool_1 with 300s (1) cores
% 0.98/1.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.98/1.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.98/1.48 % Search class: FHUSF-FFMM00-SFFFFFNN
% 0.98/1.48 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 0.98/1.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.98/1.48 % Starting SubtermCWHack with 31s (1) cores
% 0.98/1.48 % Preprocessing time : 0.009 s
% 0.98/1.48
% 0.98/1.48 % Proof found!
% 0.98/1.48 % SZS status Theorem
% 0.98/1.48 % SZS output start CNFRefutation
% See solution above
% 0.98/1.48 % Parsed axioms : 37991
% 0.98/1.48 % Removed by relevancy pruning/SinE : 37910
% 0.98/1.48 % Initial clauses : 86
% 0.98/1.48 % Removed in clause preprocessing : 4
% 0.98/1.48 % Initial clauses in saturation : 82
% 0.98/1.48 % Processed clauses : 356
% 0.98/1.48 % ...of these trivial : 110
% 0.98/1.48 % ...subsumed : 0
% 0.98/1.48 % ...remaining for further processing : 246
% 0.98/1.48 % Other redundant clauses eliminated : 0
% 0.98/1.48 % Clauses deleted for lack of memory : 0
% 0.98/1.48 % Backward-subsumed : 0
% 0.98/1.48 % Backward-rewritten : 28
% 0.98/1.48 % Generated clauses : 509
% 0.98/1.48 % ...of the previous two non-redundant : 411
% 0.98/1.48 % ...aggressively subsumed : 0
% 0.98/1.48 % Contextual simplify-reflections : 8
% 0.98/1.48 % Paramodulations : 509
% 0.98/1.48 % Factorizations : 0
% 0.98/1.48 % NegExts : 0
% 0.98/1.48 % Equation resolutions : 0
% 0.98/1.48 % Disequality decompositions : 0
% 0.98/1.48 % Total rewrite steps : 230
% 0.98/1.48 % ...of those cached : 197
% 0.98/1.48 % Propositional unsat checks : 0
% 0.98/1.48 % Propositional check models : 0
% 0.98/1.48 % Propositional check unsatisfiable : 0
% 0.98/1.48 % Propositional clauses : 0
% 0.98/1.48 % Propositional clauses after purity: 0
% 0.98/1.48 % Propositional unsat core size : 0
% 0.98/1.48 % Propositional preprocessing time : 0.000
% 0.98/1.48 % Propositional encoding time : 0.000
% 0.98/1.48 % Propositional solver time : 0.000
% 0.98/1.48 % Success case prop preproc time : 0.000
% 0.98/1.48 % Success case prop encoding time : 0.000
% 0.98/1.48 % Success case prop solver time : 0.000
% 0.98/1.48 % Current number of processed clauses : 218
% 0.98/1.48 % Positive orientable unit clauses : 102
% 0.98/1.48 % Positive unorientable unit clauses: 0
% 0.98/1.48 % Negative unit clauses : 1
% 0.98/1.48 % Non-unit-clauses : 115
% 0.98/1.48 % Current number of unprocessed clauses: 134
% 0.98/1.48 % ...number of literals in the above : 270
% 0.98/1.48 % Current number of archived formulas : 0
% 0.98/1.48 % Current number of archived clauses : 28
% 0.98/1.48 % Clause-clause subsumption calls (NU) : 567
% 0.98/1.48 % Rec. Clause-clause subsumption calls : 561
% 0.98/1.48 % Non-unit clause-clause subsumptions : 8
% 0.98/1.48 % Unit Clause-clause subsumption calls : 12
% 0.98/1.48 % Rewrite failures with RHS unbound : 0
% 0.98/1.48 % BW rewrite match attempts : 4
% 0.98/1.48 % BW rewrite match successes : 4
% 0.98/1.48 % Condensation attempts : 0
% 0.98/1.48 % Condensation successes : 0
% 0.98/1.48 % Termbank termtop insertions : 254215
% 0.98/1.48 % Search garbage collected termcells : 125535
% 0.98/1.48
% 0.98/1.48 % -------------------------------------------------
% 0.98/1.48 % User time : 0.115 s
% 0.98/1.48 % System time : 0.081 s
% 0.98/1.48 % Total time : 0.196 s
% 0.98/1.48 % Maximum resident set size: 52072 pages
% 0.98/1.48
% 0.98/1.48 % -------------------------------------------------
% 0.98/1.48 % User time : 0.902 s
% 0.98/1.48 % System time : 0.121 s
% 0.98/1.48 % Total time : 1.023 s
% 0.98/1.48 % Maximum resident set size: 31744 pages
% 0.98/1.48 % E exiting
%------------------------------------------------------------------------------