%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR101+1 : 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 : n011.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 0.41s 0.77s
% Output : CNFRefutation 0.41s
% 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_1220,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+0.ax',kb_SUMO_1220) ).
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+0.ax',kb_SUMO_26) ).
fof(kb_SUMO_1294,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+0.ax',kb_SUMO_1294) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_8) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_9) ).
fof(prove_from_SUMO,conjecture,
! [X591] :
( s__instance(X591,s__Class32_2)
=> s__instance(X591,s__Class32_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(local_7,axiom,
s__subclass(s__Class32_1,s__Class32_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_7) ).
fof(c_0_7,plain,
! [X608,X609] :
( X608 = X609
| ~ s__subclass(X609,X608)
| ~ s__subclass(X608,X609)
| ~ s__instance(X608,s__SetOrClass)
| ~ s__instance(X609,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1220])])]) ).
fof(c_0_8,plain,
! [X596,X597] :
( ( ~ s__subclass(X596,X597)
| s__instance(X597,s__SetOrClass) )
& ( ~ s__subclass(X596,X597)
| s__instance(X596,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,
! [X610,X611,X612] :
( s__subclass(X610,X612)
| ~ s__subclass(X611,X612)
| ~ s__subclass(X610,X611)
| ~ s__instance(X610,s__SetOrClass)
| ~ s__instance(X611,s__SetOrClass)
| ~ s__instance(X612,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1294])])]) ).
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,
~ ! [X591] :
( s__instance(X591,s__Class32_2)
=> s__instance(X591,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
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+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 14:58:41 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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
% 0.41/0.77 % Version: 3.5.1
% 0.41/0.77 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.41/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.77 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.41/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.41/0.77 % Starting new_bool_1 with 300s (1) cores
% 0.41/0.77 % Starting sh5l with 300s (1) cores
% 0.41/0.77 % new_bool_3 with pid 2187638 completed with status 0
% 0.41/0.77 % Result found by new_bool_3
% 0.41/0.77 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.41/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.77 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.41/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.41/0.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.41/0.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.77 % Search class: FHUSF-FFMM00-SFFFFFNN
% 0.41/0.77 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 0.41/0.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.77 % Starting SubtermCWHack with 31s (1) cores
% 0.41/0.77 % SubtermCWHack with pid 2187641 completed with status 0
% 0.41/0.77 % Result found by SubtermCWHack
% 0.41/0.77 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.41/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.77 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.41/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.41/0.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.41/0.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.77 % Search class: FHUSF-FFMM00-SFFFFFNN
% 0.41/0.77 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 0.41/0.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.77 % Starting SubtermCWHack with 31s (1) cores
% 0.41/0.77 % Preprocessing time : 0.003 s
% 0.41/0.77
% 0.41/0.77 % Proof found!
% 0.41/0.77 % SZS status Theorem
% 0.41/0.77 % SZS output start CNFRefutation
% See solution above
% 0.41/0.78 % Parsed axioms : 14797
% 0.41/0.78 % Removed by relevancy pruning/SinE : 14715
% 0.41/0.78 % Initial clauses : 87
% 0.41/0.78 % Removed in clause preprocessing : 4
% 0.41/0.78 % Initial clauses in saturation : 83
% 0.41/0.78 % Processed clauses : 342
% 0.41/0.78 % ...of these trivial : 90
% 0.41/0.78 % ...subsumed : 0
% 0.41/0.78 % ...remaining for further processing : 252
% 0.41/0.78 % Other redundant clauses eliminated : 0
% 0.41/0.78 % Clauses deleted for lack of memory : 0
% 0.41/0.78 % Backward-subsumed : 0
% 0.41/0.78 % Backward-rewritten : 29
% 0.41/0.78 % Generated clauses : 523
% 0.41/0.78 % ...of the previous two non-redundant : 400
% 0.41/0.78 % ...aggressively subsumed : 0
% 0.41/0.78 % Contextual simplify-reflections : 8
% 0.41/0.78 % Paramodulations : 523
% 0.41/0.78 % Factorizations : 0
% 0.41/0.78 % NegExts : 0
% 0.41/0.78 % Equation resolutions : 0
% 0.41/0.78 % Disequality decompositions : 0
% 0.41/0.78 % Total rewrite steps : 237
% 0.41/0.78 % ...of those cached : 202
% 0.41/0.78 % Propositional unsat checks : 0
% 0.41/0.78 % Propositional check models : 0
% 0.41/0.78 % Propositional check unsatisfiable : 0
% 0.41/0.78 % Propositional clauses : 0
% 0.41/0.78 % Propositional clauses after purity: 0
% 0.41/0.78 % Propositional unsat core size : 0
% 0.41/0.78 % Propositional preprocessing time : 0.000
% 0.41/0.78 % Propositional encoding time : 0.000
% 0.41/0.78 % Propositional solver time : 0.000
% 0.41/0.78 % Success case prop preproc time : 0.000
% 0.41/0.78 % Success case prop encoding time : 0.000
% 0.41/0.78 % Success case prop solver time : 0.000
% 0.41/0.78 % Current number of processed clauses : 223
% 0.41/0.78 % Positive orientable unit clauses : 105
% 0.41/0.78 % Positive unorientable unit clauses: 0
% 0.41/0.78 % Negative unit clauses : 1
% 0.41/0.78 % Non-unit-clauses : 117
% 0.41/0.78 % Current number of unprocessed clauses: 135
% 0.41/0.78 % ...number of literals in the above : 275
% 0.41/0.78 % Current number of archived formulas : 0
% 0.41/0.78 % Current number of archived clauses : 29
% 0.41/0.78 % Clause-clause subsumption calls (NU) : 736
% 0.41/0.78 % Rec. Clause-clause subsumption calls : 722
% 0.41/0.78 % Non-unit clause-clause subsumptions : 8
% 0.41/0.78 % Unit Clause-clause subsumption calls : 159
% 0.41/0.78 % Rewrite failures with RHS unbound : 0
% 0.41/0.78 % BW rewrite match attempts : 4
% 0.41/0.78 % BW rewrite match successes : 4
% 0.41/0.78 % Condensation attempts : 0
% 0.41/0.78 % Condensation successes : 0
% 0.41/0.78 % Termbank termtop insertions : 113368
% 0.41/0.78 % Search garbage collected termcells : 52910
% 0.41/0.78
% 0.41/0.78 % -------------------------------------------------
% 0.41/0.78 % User time : 0.045 s
% 0.41/0.78 % System time : 0.041 s
% 0.41/0.78 % Total time : 0.086 s
% 0.41/0.78 % Maximum resident set size: 22368 pages
% 0.41/0.78
% 0.41/0.78 % -------------------------------------------------
% 0.41/0.78 % User time : 0.294 s
% 0.41/0.78 % System time : 0.062 s
% 0.41/0.78 % Total time : 0.356 s
% 0.41/0.78 % Maximum resident set size: 15872 pages
% 0.41/0.78 % E exiting
%------------------------------------------------------------------------------