%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR101+3 : 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 : n012.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 4.01s 3.10s
% Output : CNFRefutation 4.01s
% 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_28267,axiom,
! [X1034,X1035] :
( ( s__instance(X1034,s__SetOrClass)
& s__instance(X1035,s__SetOrClass) )
=> ( ( s__subclass(X1035,X1034)
& s__subclass(X1034,X1035) )
=> X1034 = X1035 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28267) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X15,s__SetOrClass)
& s__instance(X1,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(kb_SUMO_28461,axiom,
! [X1034,X1035,X1097] :
( ( s__instance(X1034,s__SetOrClass)
& s__instance(X1035,s__SetOrClass)
& s__instance(X1097,s__SetOrClass) )
=> ( ( s__subclass(X1035,X1097)
& s__subclass(X1034,X1035) )
=> s__subclass(X1034,X1097) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28461) ).
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_ALL,conjecture,
! [X2341] :
( s__instance(X2341,s__Class32_2)
=> s__instance(X2341,s__Class32_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
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,
! [X2358,X2359] :
( X2358 = X2359
| ~ s__subclass(X2359,X2358)
| ~ s__subclass(X2358,X2359)
| ~ s__instance(X2358,s__SetOrClass)
| ~ s__instance(X2359,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28267])])]) ).
fof(c_0_8,plain,
! [X2346,X2347] :
( ( ~ s__subclass(X2346,X2347)
| s__instance(X2347,s__SetOrClass) )
& ( ~ s__subclass(X2346,X2347)
| s__instance(X2346,s__SetOrClass) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
fof(c_0_9,plain,
! [X2360,X2361,X2362] :
( s__subclass(X2360,X2362)
| ~ s__subclass(X2361,X2362)
| ~ s__subclass(X2360,X2361)
| ~ s__instance(X2360,s__SetOrClass)
| ~ s__instance(X2361,s__SetOrClass)
| ~ s__instance(X2362,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28461])])]) ).
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,
~ ! [X2341] :
( s__instance(X2341,s__Class32_2)
=> s__instance(X2341,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
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.01 % Problem : CSR101+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 14:58:22 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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
% 4.01/3.10 % Version: 3.5.1
% 4.01/3.10 % Preprocessing class: FLLLSMSLSSSNFFN.
% 4.01/3.10 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.01/3.10 % Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 4.01/3.10 % Starting new_bool_3 with 298s (1) cores
% 4.01/3.10 % Starting new_bool_1 with 298s (1) cores
% 4.01/3.10 % Starting sh5l with 298s (1) cores
% 4.01/3.10 % new_bool_3 with pid 2602902 completed with status 0
% 4.01/3.10 % Result found by new_bool_3
% 4.01/3.10 % Preprocessing class: FLLLSMSLSSSNFFN.
% 4.01/3.10 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.01/3.10 % Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 4.01/3.10 % Starting new_bool_3 with 298s (1) cores
% 4.01/3.10 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.01/3.10 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.01/3.10 % Search class: FHUSF-FFMM00-SFFFFFNN
% 4.01/3.10 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 4.01/3.10 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 4.01/3.10 % Starting SubtermCWHack with 30s (1) cores
% 4.01/3.10 % SubtermCWHack with pid 2602907 completed with status 0
% 4.01/3.10 % Result found by SubtermCWHack
% 4.01/3.10 % Preprocessing class: FLLLSMSLSSSNFFN.
% 4.01/3.10 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.01/3.10 % Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 4.01/3.10 % Starting new_bool_3 with 298s (1) cores
% 4.01/3.10 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.01/3.10 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.01/3.10 % Search class: FHUSF-FFMM00-SFFFFFNN
% 4.01/3.10 % partial match(1): FHUNF-FFMM00-SFFFFFNN
% 4.01/3.10 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 4.01/3.10 % Starting SubtermCWHack with 30s (1) cores
% 4.01/3.10 % Preprocessing time : 0.014 s
% 4.01/3.10
% 4.01/3.10 % Proof found!
% 4.01/3.10 % SZS status Theorem
% 4.01/3.10 % SZS output start CNFRefutation
% See solution above
% 4.01/3.10 % Parsed axioms : 145111
% 4.01/3.10 % Removed by relevancy pruning/SinE : 145029
% 4.01/3.10 % Initial clauses : 87
% 4.01/3.10 % Removed in clause preprocessing : 4
% 4.01/3.10 % Initial clauses in saturation : 83
% 4.01/3.10 % Processed clauses : 342
% 4.01/3.10 % ...of these trivial : 90
% 4.01/3.10 % ...subsumed : 0
% 4.01/3.10 % ...remaining for further processing : 252
% 4.01/3.10 % Other redundant clauses eliminated : 0
% 4.01/3.10 % Clauses deleted for lack of memory : 0
% 4.01/3.10 % Backward-subsumed : 0
% 4.01/3.10 % Backward-rewritten : 29
% 4.01/3.10 % Generated clauses : 525
% 4.01/3.10 % ...of the previous two non-redundant : 402
% 4.01/3.10 % ...aggressively subsumed : 0
% 4.01/3.10 % Contextual simplify-reflections : 8
% 4.01/3.10 % Paramodulations : 525
% 4.01/3.10 % Factorizations : 0
% 4.01/3.10 % NegExts : 0
% 4.01/3.10 % Equation resolutions : 0
% 4.01/3.10 % Disequality decompositions : 0
% 4.01/3.10 % Total rewrite steps : 231
% 4.01/3.10 % ...of those cached : 198
% 4.01/3.10 % Propositional unsat checks : 0
% 4.01/3.10 % Propositional check models : 0
% 4.01/3.10 % Propositional check unsatisfiable : 0
% 4.01/3.10 % Propositional clauses : 0
% 4.01/3.10 % Propositional clauses after purity: 0
% 4.01/3.10 % Propositional unsat core size : 0
% 4.01/3.10 % Propositional preprocessing time : 0.000
% 4.01/3.10 % Propositional encoding time : 0.000
% 4.01/3.10 % Propositional solver time : 0.000
% 4.01/3.10 % Success case prop preproc time : 0.000
% 4.01/3.10 % Success case prop encoding time : 0.000
% 4.01/3.10 % Success case prop solver time : 0.000
% 4.01/3.10 % Current number of processed clauses : 223
% 4.01/3.10 % Positive orientable unit clauses : 105
% 4.01/3.10 % Positive unorientable unit clauses: 0
% 4.01/3.10 % Negative unit clauses : 1
% 4.01/3.10 % Non-unit-clauses : 117
% 4.01/3.10 % Current number of unprocessed clauses: 137
% 4.01/3.10 % ...number of literals in the above : 279
% 4.01/3.10 % Current number of archived formulas : 0
% 4.01/3.10 % Current number of archived clauses : 29
% 4.01/3.10 % Clause-clause subsumption calls (NU) : 697
% 4.01/3.10 % Rec. Clause-clause subsumption calls : 686
% 4.01/3.10 % Non-unit clause-clause subsumptions : 8
% 4.01/3.10 % Unit Clause-clause subsumption calls : 43
% 4.01/3.10 % Rewrite failures with RHS unbound : 0
% 4.01/3.10 % BW rewrite match attempts : 4
% 4.01/3.10 % BW rewrite match successes : 4
% 4.01/3.10 % Condensation attempts : 0
% 4.01/3.10 % Condensation successes : 0
% 4.01/3.10 % Termbank termtop insertions : 1012649
% 4.01/3.10 % Search garbage collected termcells : 459543
% 4.01/3.10
% 4.01/3.10 % -------------------------------------------------
% 4.01/3.10 % User time : 0.326 s
% 4.01/3.10 % System time : 0.145 s
% 4.01/3.10 % Total time : 0.471 s
% 4.01/3.10 % Maximum resident set size: 177904 pages
% 4.01/3.10
% 4.01/3.10 % -------------------------------------------------
% 4.01/3.10 % User time : 2.488 s
% 4.01/3.10 % System time : 0.249 s
% 4.01/3.10 % Total time : 2.737 s
% 4.01/3.10 % Maximum resident set size: 104704 pages
% 4.01/3.10 % E exiting
%------------------------------------------------------------------------------