%------------------------------------------------------------------------------
% File : E-SAT---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 : n002.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:18:54 PM UTC 2026
% Result : Theorem 0.98s 1.44s
% Output : CNFRefutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 92 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 100 ( 42 ~; 39 |; 10 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 44 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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_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+1.ax',kb_SUMO_27) ).
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(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(local_7,axiom,
s__subclass(s__Class32_1,s__Class32_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_7) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_9) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_8) ).
fof(c_0_8,plain,
! [X1245,X1246,X1247] :
( s__subclass(X1245,X1247)
| ~ s__subclass(X1246,X1247)
| ~ s__subclass(X1245,X1246)
| ~ s__instance(X1245,s__SetOrClass)
| ~ s__instance(X1246,s__SetOrClass)
| ~ s__instance(X1247,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1539])])]) ).
fof(c_0_9,plain,
! [X1231,X1232] :
( ( ~ s__subclass(X1231,X1232)
| s__instance(X1232,s__SetOrClass) )
& ( ~ s__subclass(X1231,X1232)
| s__instance(X1231,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,
! [X1233,X1234,X1235] :
( s__instance(X1235,X1234)
| ~ s__instance(X1235,X1233)
| ~ s__subclass(X1233,X1234)
| ~ s__instance(X1233,s__SetOrClass)
| ~ s__instance(X1234,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1223] :
( s__instance(X1223,s__Class32_2)
=> s__instance(X1223,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_12,plain,
! [X1243,X1244] :
( X1243 = X1244
| ~ s__subclass(X1244,X1243)
| ~ s__subclass(X1243,X1244)
| ~ 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_1443])])]) ).
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_8]) ).
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__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,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_10]) ).
fof(c_0_17,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_11])])])]) ).
cnf(c_0_18,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_12]) ).
cnf(c_0_19,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_15]),c_0_15]) ).
cnf(c_0_20,plain,
s__subclass(s__Class32_1,s__Class32_2),
inference(split_conjunct,[status(thm)],[local_7]) ).
cnf(c_0_21,plain,
( ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| s__instance(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_16,c_0_14]),c_0_15]) ).
cnf(c_0_22,negated_conjecture,
s__instance(esk1_0,s__Class32_2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ~ s__subclass(X1,X2)
| ~ s__subclass(X2,X1)
| X1 = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_18,c_0_15]),c_0_15]) ).
cnf(c_0_24,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_25,plain,
( ~ s__subclass(s__Class32_2,X1)
| s__subclass(s__Class32_1,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
cnf(c_0_27,negated_conjecture,
( ~ s__subclass(s__Class32_2,X1)
| s__instance(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ s__subclass(s__Class32_1,s__Class32_3)
| s__Class32_3 = s__Class32_1 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
s__subclass(s__Class32_1,s__Class32_3),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
s__instance(esk1_0,s__Class32_3),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_31,plain,
s__Class32_3 = s__Class32_1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
~ s__instance(esk1_0,s__Class32_1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR101+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n002.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 15:01:02 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.44 % Version: 3.5.1
% 0.98/1.44 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.98/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/1.44 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.98/1.44 % Starting new_bool_3 with 300s (1) cores
% 0.98/1.44 % Starting new_bool_1 with 300s (1) cores
% 0.98/1.44 % Starting sh5l with 300s (1) cores
% 0.98/1.44 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3552739 completed with status 0
% 0.98/1.44 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 0.98/1.44 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.98/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/1.44 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.98/1.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.98/1.44 % SinE strategy is gf200_h_gu_R03_F100_L20000
% 0.98/1.44 % Search class: FHUSS-FFMM32-MFFFFFNN
% 0.98/1.44 % partial match(1): FHUNS-FFMM32-MFFFFFNN
% 0.98/1.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.98/1.44 % Starting SubtermCWHack with 136s (1) cores
% 0.98/1.44 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 0.98/1.44 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S3S with 136s (1) cores
% 0.98/1.44 % Starting new_bool_3 with 136s (1) cores
% 0.98/1.44 % Starting new_bool_1 with 136s (1) cores
% 0.98/1.44 % new_bool_3 with pid 3552746 completed with status 0
% 0.98/1.44 % Result found by new_bool_3
% 0.98/1.44 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.98/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/1.44 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.98/1.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.98/1.44 % SinE strategy is gf200_h_gu_R03_F100_L20000
% 0.98/1.44 % Search class: FHUSS-FFMM32-MFFFFFNN
% 0.98/1.44 % partial match(1): FHUNS-FFMM32-MFFFFFNN
% 0.98/1.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.98/1.44 % Starting SubtermCWHack with 136s (1) cores
% 0.98/1.44 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 0.98/1.44 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S3S with 136s (1) cores
% 0.98/1.44 % Starting new_bool_3 with 136s (1) cores
% 0.98/1.44 % Preprocessing time : 0.006 s
% 0.98/1.44 % Presaturation interreduction done
% 0.98/1.44
% 0.98/1.44 % Proof found!
% 0.98/1.44 % SZS status Theorem
% 0.98/1.44 % SZS output start CNFRefutation
% See solution above
% 0.98/1.44 % Parsed axioms : 37991
% 0.98/1.44 % Removed by relevancy pruning/SinE : 37875
% 0.98/1.44 % Initial clauses : 121
% 0.98/1.44 % Removed in clause preprocessing : 7
% 0.98/1.44 % Initial clauses in saturation : 114
% 0.98/1.44 % Processed clauses : 478
% 0.98/1.44 % ...of these trivial : 120
% 0.98/1.44 % ...subsumed : 0
% 0.98/1.44 % ...remaining for further processing : 358
% 0.98/1.44 % Other redundant clauses eliminated : 0
% 0.98/1.44 % Clauses deleted for lack of memory : 0
% 0.98/1.44 % Backward-subsumed : 0
% 0.98/1.44 % Backward-rewritten : 14
% 0.98/1.44 % Generated clauses : 698
% 0.98/1.44 % ...of the previous two non-redundant : 632
% 0.98/1.44 % ...aggressively subsumed : 0
% 0.98/1.44 % Contextual simplify-reflections : 12
% 0.98/1.44 % Paramodulations : 698
% 0.98/1.44 % Factorizations : 0
% 0.98/1.44 % NegExts : 0
% 0.98/1.44 % Equation resolutions : 0
% 0.98/1.44 % Disequality decompositions : 0
% 0.98/1.44 % Total rewrite steps : 232
% 0.98/1.44 % ...of those cached : 166
% 0.98/1.44 % Propositional unsat checks : 0
% 0.98/1.44 % Propositional check models : 0
% 0.98/1.44 % Propositional check unsatisfiable : 0
% 0.98/1.44 % Propositional clauses : 0
% 0.98/1.44 % Propositional clauses after purity: 0
% 0.98/1.44 % Propositional unsat core size : 0
% 0.98/1.44 % Propositional preprocessing time : 0.000
% 0.98/1.44 % Propositional encoding time : 0.000
% 0.98/1.44 % Propositional solver time : 0.000
% 0.98/1.44 % Success case prop preproc time : 0.000
% 0.98/1.44 % Success case prop encoding time : 0.000
% 0.98/1.44 % Success case prop solver time : 0.000
% 0.98/1.44 % Current number of processed clauses : 235
% 0.98/1.44 % Positive orientable unit clauses : 142
% 0.98/1.44 % Positive unorientable unit clauses: 0
% 0.98/1.44 % Negative unit clauses : 1
% 0.98/1.44 % Non-unit-clauses : 92
% 0.98/1.44 % Current number of unprocessed clauses: 375
% 0.98/1.44 % ...number of literals in the above : 543
% 0.98/1.44 % Current number of archived formulas : 0
% 0.98/1.44 % Current number of archived clauses : 123
% 0.98/1.44 % Clause-clause subsumption calls (NU) : 279
% 0.98/1.44 % Rec. Clause-clause subsumption calls : 249
% 0.98/1.44 % Non-unit clause-clause subsumptions : 12
% 0.98/1.44 % Unit Clause-clause subsumption calls : 55
% 0.98/1.44 % Rewrite failures with RHS unbound : 0
% 0.98/1.44 % BW rewrite match attempts : 6
% 0.98/1.44 % BW rewrite match successes : 3
% 0.98/1.44 % Condensation attempts : 0
% 0.98/1.44 % Condensation successes : 0
% 0.98/1.44 % Termbank termtop insertions : 258625
% 0.98/1.44 % Search garbage collected termcells : 125670
% 0.98/1.44
% 0.98/1.44 % -------------------------------------------------
% 0.98/1.44 % User time : 0.098 s
% 0.98/1.44 % System time : 0.059 s
% 0.98/1.44 % Total time : 0.157 s
% 0.98/1.44 % Maximum resident set size: 52072 pages
% 0.98/1.44
% 0.98/1.44 % -------------------------------------------------
% 0.98/1.44 % User time : 0.962 s
% 0.98/1.44 % System time : 0.185 s
% 0.98/1.44 % Total time : 1.146 s
% 0.98/1.44 % Maximum resident set size: 31488 pages
% 0.98/1.44 % E exiting
%------------------------------------------------------------------------------