%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR100+7 : 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 : n013.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 12.19s 7.29s
% Output : CNFRefutation 12.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 15 unt; 0 def)
% Number of atoms : 104 ( 14 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 122 ( 45 ~; 51 |; 20 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 48 ( 12 sgn 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X137,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X136,s__SetOrClass) )
=> ( ( s__instance(X1139,X12)
& s__instance(X34,X137)
& s__instance(X1138,X136) )
=> ( ( s__instance(X1139,X137)
| s__instance(X1139,X136) )
& s__instance(X34,X12)
& s__instance(X1138,X12) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(local_8,axiom,
s__subclass(s__Class31_2,s__Class31_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_8) ).
fof(kb_SUMO_26636,axiom,
! [X1,X15,X13] :
( ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) )
=> ( ( s__instance(X13,X1)
& s__subclass(X1,X15) )
=> s__instance(X13,X15) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26636) ).
fof(prove_from_ALL,conjecture,
? [X2341] : s__instance(X2341,s__Class31_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(local_9,axiom,
s__subclass(s__Class31_3,s__Class31_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_9) ).
fof(local_10,axiom,
s__instance(s__Animal31,s__Class31_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_10) ).
fof(c_0_7,plain,
! [X2343,X2344] :
( ( ~ s__subclass(X2343,X2344)
| s__instance(X2344,s__SetOrClass) )
& ( ~ s__subclass(X2343,X2344)
| s__instance(X2343,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_8,plain,
! [X2367,X2368,X2369,X2370,X2371,X2372,X2373,X2374,X2375] :
( ( X2374 = s__UnionFn(X2375,X2373)
| ~ s__instance(esk2_3(X2373,X2374,X2375),X2374)
| ~ s__instance(esk1_3(X2373,X2374,X2375),X2374)
| ~ s__instance(esk3_3(X2373,X2374,X2375),X2373) )
& ( X2374 = s__UnionFn(X2375,X2373)
| ~ s__instance(esk2_3(X2373,X2374,X2375),X2374)
| ~ s__instance(esk1_3(X2373,X2374,X2375),X2374)
| ~ s__instance(esk3_3(X2373,X2374,X2375),X2375) )
& ( X2374 = s__UnionFn(X2375,X2373)
| s__instance(esk3_3(X2373,X2374,X2375),X2374) )
& ( X2374 = s__UnionFn(X2375,X2373)
| s__instance(esk2_3(X2373,X2374,X2375),X2373) )
& ( X2374 = s__UnionFn(X2375,X2373)
| s__instance(esk1_3(X2373,X2374,X2375),X2375) )
& ( X2374 = s__UnionFn(X2375,X2373)
| s__instance(X2373,s__SetOrClass) )
& ( X2374 = s__UnionFn(X2375,X2373)
| s__instance(X2374,s__SetOrClass) )
& ( X2374 = s__UnionFn(X2375,X2373)
| s__instance(X2375,s__SetOrClass) )
& ( X2368 != s__UnionFn(X2369,X2367)
| ~ s__instance(X2367,s__SetOrClass)
| ~ s__instance(X2368,s__SetOrClass)
| ~ s__instance(X2369,s__SetOrClass)
| ~ s__instance(X2372,X2368)
| ~ s__instance(X2371,X2367)
| ~ s__instance(X2370,X2369)
| s__instance(X2372,X2367)
| s__instance(X2372,X2369) )
& ( X2368 != s__UnionFn(X2369,X2367)
| ~ s__instance(X2367,s__SetOrClass)
| ~ s__instance(X2368,s__SetOrClass)
| ~ s__instance(X2369,s__SetOrClass)
| ~ s__instance(X2372,X2368)
| ~ s__instance(X2371,X2367)
| ~ s__instance(X2370,X2369)
| s__instance(X2371,X2368) )
& ( X2368 != s__UnionFn(X2369,X2367)
| ~ s__instance(X2367,s__SetOrClass)
| ~ s__instance(X2368,s__SetOrClass)
| ~ s__instance(X2369,s__SetOrClass)
| ~ s__instance(X2372,X2368)
| ~ s__instance(X2371,X2367)
| ~ s__instance(X2370,X2369)
| s__instance(X2370,X2368) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32603])])])])])])]) ).
cnf(c_0_9,plain,
( ~ s__subclass(X2,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
s__subclass(s__Class31_2,s__Class31_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
cnf(c_0_11,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
s__instance(s__Class31_3,s__SetOrClass),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( s__instance(X3,s__SetOrClass)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
fof(c_0_14,plain,
! [X2345,X2346,X2347] :
( s__instance(X2347,X2346)
| ~ s__instance(X2347,X2345)
| ~ s__subclass(X2345,X2346)
| ~ s__instance(X2345,s__SetOrClass)
| ~ s__instance(X2346,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
cnf(c_0_15,plain,
( s__instance(X2,s__SetOrClass)
| s__instance(X1,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ? [X2341] : s__instance(X2341,s__Class31_1),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
cnf(c_0_17,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_14]) ).
cnf(c_0_18,plain,
s__instance(X1,s__SetOrClass),
inference(ef,[status(thm)],[c_0_15]) ).
fof(c_0_19,negated_conjecture,
! [X2342] : ~ s__instance(X2342,s__Class31_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_20,plain,
( ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3)
| s__instance(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18])]) ).
cnf(c_0_21,plain,
s__subclass(s__Class31_3,s__Class31_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_22,negated_conjecture,
~ s__instance(X1,s__Class31_1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
~ s__instance(X1,s__Class31_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_24,plain,
s__instance(s__Animal31,s__Class31_2),
inference(split_conjunct,[status(thm)],[local_10]) ).
cnf(c_0_25,plain,
~ s__instance(X1,s__Class31_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR100+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 14:58:07 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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
% 12.19/7.29 % Version: 3.5.1
% 12.19/7.29 % Preprocessing class: FMLLSMSLSSSNFFN.
% 12.19/7.29 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 12.19/7.29 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 12.19/7.29 % Starting new_bool_3 with 297s (1) cores
% 12.19/7.29 % Starting new_bool_1 with 297s (1) cores
% 12.19/7.29 % Starting sh5l with 297s (1) cores
% 12.19/7.29 % sh5l with pid 1029404 completed with status 0
% 12.19/7.29 % Result found by sh5l
% 12.19/7.29 % Preprocessing class: FMLLSMSLSSSNFFN.
% 12.19/7.29 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 12.19/7.29 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 12.19/7.29 % Starting new_bool_3 with 297s (1) cores
% 12.19/7.29 % Starting new_bool_1 with 297s (1) cores
% 12.19/7.29 % Starting sh5l with 297s (1) cores
% 12.19/7.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 12.19/7.29 % SinE strategy is gf500_gu_R04_F100_L20000
% 12.19/7.29 % Search class: FGHSM-SMLM33-MFFFFFNN
% 12.19/7.29 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 12.19/7.29 % Scheduled 13 strats onto 1 cores with 297 seconds (297 total)
% 12.19/7.29 % Starting SubtermCWHack with 27s (1) cores
% 12.19/7.29 % SubtermCWHack with pid 1029415 completed with status 0
% 12.19/7.29 % Result found by SubtermCWHack
% 12.19/7.29 % Preprocessing class: FMLLSMSLSSSNFFN.
% 12.19/7.29 % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 12.19/7.29 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 12.19/7.29 % Starting new_bool_3 with 297s (1) cores
% 12.19/7.29 % Starting new_bool_1 with 297s (1) cores
% 12.19/7.29 % Starting sh5l with 297s (1) cores
% 12.19/7.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 12.19/7.29 % SinE strategy is gf500_gu_R04_F100_L20000
% 12.19/7.29 % Search class: FGHSM-SMLM33-MFFFFFNN
% 12.19/7.29 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 12.19/7.29 % Scheduled 13 strats onto 1 cores with 297 seconds (297 total)
% 12.19/7.29 % Starting SubtermCWHack with 27s (1) cores
% 12.19/7.29 % Preprocessing time : 0.131 s
% 12.19/7.29
% 12.19/7.29 % Proof found!
% 12.19/7.29 % SZS status Theorem
% 12.19/7.29 % SZS output start CNFRefutation
% See solution above
% 12.19/7.29 % Parsed axioms : 55597
% 12.19/7.29 % Removed by relevancy pruning/SinE : 54398
% 12.19/7.29 % Initial clauses : 1856
% 12.19/7.29 % Removed in clause preprocessing : 143
% 12.19/7.29 % Initial clauses in saturation : 1713
% 12.19/7.29 % Processed clauses : 4628
% 12.19/7.29 % ...of these trivial : 412
% 12.19/7.29 % ...subsumed : 1449
% 12.19/7.29 % ...remaining for further processing : 2767
% 12.19/7.29 % Other redundant clauses eliminated : 34
% 12.19/7.29 % Clauses deleted for lack of memory : 0
% 12.19/7.29 % Backward-subsumed : 203
% 12.19/7.29 % Backward-rewritten : 243
% 12.19/7.29 % Generated clauses : 17946
% 12.19/7.29 % ...of the previous two non-redundant : 16036
% 12.19/7.29 % ...aggressively subsumed : 0
% 12.19/7.29 % Contextual simplify-reflections : 9
% 12.19/7.29 % Paramodulations : 17904
% 12.19/7.29 % Factorizations : 6
% 12.19/7.29 % NegExts : 0
% 12.19/7.29 % Equation resolutions : 34
% 12.19/7.29 % Disequality decompositions : 0
% 12.19/7.29 % Total rewrite steps : 2564
% 12.19/7.29 % ...of those cached : 2141
% 12.19/7.29 % Propositional unsat checks : 0
% 12.19/7.29 % Propositional check models : 0
% 12.19/7.29 % Propositional check unsatisfiable : 0
% 12.19/7.29 % Propositional clauses : 0
% 12.19/7.29 % Propositional clauses after purity: 0
% 12.19/7.29 % Propositional unsat core size : 0
% 12.19/7.29 % Propositional preprocessing time : 0.000
% 12.19/7.29 % Propositional encoding time : 0.000
% 12.19/7.29 % Propositional solver time : 0.000
% 12.19/7.29 % Success case prop preproc time : 0.000
% 12.19/7.29 % Success case prop encoding time : 0.000
% 12.19/7.29 % Success case prop solver time : 0.000
% 12.19/7.29 % Current number of processed clauses : 2313
% 12.19/7.29 % Positive orientable unit clauses : 549
% 12.19/7.29 % Positive unorientable unit clauses: 0
% 12.19/7.29 % Negative unit clauses : 3
% 12.19/7.29 % Non-unit-clauses : 1761
% 12.19/7.29 % Current number of unprocessed clauses: 10575
% 12.19/7.29 % ...number of literals in the above : 34497
% 12.19/7.29 % Current number of archived formulas : 0
% 12.19/7.29 % Current number of archived clauses : 448
% 12.19/7.29 % Clause-clause subsumption calls (NU) : 2012666
% 12.19/7.29 % Rec. Clause-clause subsumption calls : 1817306
% 12.19/7.29 % Non-unit clause-clause subsumptions : 1497
% 12.19/7.29 % Unit Clause-clause subsumption calls : 34547
% 12.19/7.29 % Rewrite failures with RHS unbound : 0
% 12.19/7.29 % BW rewrite match attempts : 558
% 12.19/7.29 % BW rewrite match successes : 188
% 12.19/7.29 % Condensation attempts : 0
% 12.19/7.29 % Condensation successes : 0
% 12.19/7.29 % Termbank termtop insertions : 948235
% 12.19/7.29 % Search garbage collected termcells : 317708
% 12.19/7.29
% 12.19/7.29 % -------------------------------------------------
% 12.19/7.29 % User time : 2.225 s
% 12.19/7.29 % System time : 0.617 s
% 12.19/7.29 % Total time : 2.842 s
% 12.19/7.29 % Maximum resident set size: 138072 pages
% 12.19/7.29
% 12.19/7.29 % -------------------------------------------------
% 12.19/7.29 % User time : 5.744 s
% 12.19/7.29 % System time : 0.809 s
% 12.19/7.29 % Total time : 6.553 s
% 12.19/7.29 % Maximum resident set size: 63744 pages
% 12.19/7.29 % E exiting
%------------------------------------------------------------------------------