%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR101+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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 : Sun Sep 27 07:07:25 AM UTC 2026
% Result : Theorem 0.46s 0.72s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 74 ( 32 ~; 27 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 27 ( 2 sgn 10 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_26,axiom,
! [V__X,V__Y] :
( s__subclass(V__X,V__Y)
=> ( s__instance(V__Y,s__SetOrClass)
& s__instance(V__X,s__SetOrClass) ) ),
file('theBenchmark.p',kb_SUMO_26) ).
fof(kb_SUMO_27,axiom,
! [V__X,V__Y,V__Z] :
( ( s__instance(V__X,s__SetOrClass)
& s__instance(V__Y,s__SetOrClass) )
=> ( ( s__instance(V__Z,V__X)
& s__subclass(V__X,V__Y) )
=> s__instance(V__Z,V__Y) ) ),
file('theBenchmark.p',kb_SUMO_27) ).
fof(kb_SUMO_1539,axiom,
! [V__INST1,V__INST2,V__INST3] :
( ( s__instance(V__INST1,s__SetOrClass)
& s__instance(V__INST2,s__SetOrClass)
& s__instance(V__INST3,s__SetOrClass) )
=> ( ( s__subclass(V__INST2,V__INST3)
& s__subclass(V__INST1,V__INST2) )
=> s__subclass(V__INST1,V__INST3) ) ),
file('theBenchmark.p',kb_SUMO_1539) ).
fof(prove_from_SUMO_MILO,conjecture,
! [V_X] :
( s__instance(V_X,s__Class32_2)
=> s__instance(V_X,s__Class32_1) ),
file('theBenchmark.p',prove_from_SUMO_MILO) ).
fof(prove_from_SUMO_MILO_neg,negated_conjecture,
~ ! [V_X] :
( s__instance(V_X,s__Class32_2)
=> s__instance(V_X,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_27,plain,
( s__instance(A,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26]) ).
cnf(c_28,plain,
( s__instance(B,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26]) ).
cnf(c_29,plain,
( s__instance(C,A)
| ~ s__instance(C,B)
| ~ s__subclass(B,A)
| ~ s__instance(B,s__SetOrClass)
| ~ s__instance(A,s__SetOrClass) ),
inference(clausify,[status(thm)],[kb_SUMO_27]) ).
cnf(c_58,plain,
( s__subclass(C,A)
| ~ s__subclass(B,A)
| ~ s__subclass(C,B)
| ~ s__instance(C,s__SetOrClass)
| ~ s__instance(B,s__SetOrClass)
| ~ s__instance(A,s__SetOrClass) ),
inference(clausify,[status(thm)],[kb_SUMO_1539]) ).
fof(local_4,axiom,
s__subclass(s__Class32_1,s__Animal),
file('theBenchmark.p',local_4) ).
cnf(c_140,plain,
s__subclass(s__Class32_1,s__Animal),
inference(clausify,[status(thm)],[local_4]) ).
fof(local_5,axiom,
s__subclass(s__Class32_2,s__Animal),
file('theBenchmark.p',local_5) ).
cnf(c_141,plain,
s__subclass(s__Class32_2,s__Animal),
inference(clausify,[status(thm)],[local_5]) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('theBenchmark.p',local_8) ).
cnf(c_144,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(clausify,[status(thm)],[local_8]) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('theBenchmark.p',local_9) ).
cnf(c_145,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(clausify,[status(thm)],[local_9]) ).
fof(nnf_26,plain,
? [V_X] :
( ~ s__instance(V_X,s__Class32_1)
& s__instance(V_X,s__Class32_2) ),
inference(fof_nnf,[status(thm)],[prove_from_SUMO_MILO_neg]) ).
fof(sk_prove_from_SUMO_MILO_neg,plain,
( ~ s__instance(sK0,s__Class32_1)
& s__instance(sK0,s__Class32_2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(V_X,sK0)],[nnf_26]) ).
cnf(c_146,negated_conjecture,
s__instance(sK0,s__Class32_2),
inference(split_conjunct,[status(thm)],[sk_prove_from_SUMO_MILO_neg]) ).
cnf(c_147,negated_conjecture,
~ s__instance(sK0,s__Class32_1),
inference(split_conjunct,[status(thm)],[sk_prove_from_SUMO_MILO_neg]) ).
cnf(c_149,plain,
s__instance(s__Class32_1,s__SetOrClass),
inference(resolve,[status(thm)],[c_27,c_140]) ).
cnf(c_150,plain,
s__instance(s__Class32_2,s__SetOrClass),
inference(resolve,[status(thm)],[c_27,c_141]) ).
cnf(c_151,plain,
s__instance(s__Class32_3,s__SetOrClass),
inference(resolve,[status(thm)],[c_28,c_144]) ).
cnf(c_176,plain,
( s__instance(B,s__Class32_1)
| ~ s__instance(B,A)
| ~ s__subclass(A,s__Class32_1)
| ~ s__instance(A,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_29,c_149]) ).
cnf(c_177,plain,
( s__instance(A,s__Class32_1)
| ~ s__instance(A,s__Class32_2)
| ~ s__subclass(s__Class32_2,s__Class32_1) ),
inference(resolve,[status(thm)],[c_176,c_150]) ).
cnf(c_178,negated_conjecture,
( s__instance(sK0,s__Class32_1)
| ~ s__subclass(s__Class32_2,s__Class32_1) ),
inference(resolve,[status(thm)],[c_177,c_146]) ).
cnf(c_168,negated_conjecture,
~ s__subclass(s__Class32_2,s__Class32_1),
inference(resolve,[status(thm)],[c_178,c_147]) ).
cnf(c_179,plain,
( s__subclass(B,s__Class32_1)
| ~ s__subclass(A,s__Class32_1)
| ~ s__subclass(B,A)
| ~ s__instance(B,s__SetOrClass)
| ~ s__instance(A,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_58,c_149]) ).
cnf(c_180,plain,
( s__subclass(A,s__Class32_1)
| ~ s__subclass(s__Class32_3,s__Class32_1)
| ~ s__subclass(A,s__Class32_3)
| ~ s__instance(A,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_179,c_151]) ).
cnf(c_181,plain,
( s__subclass(s__Class32_2,s__Class32_1)
| ~ s__subclass(s__Class32_3,s__Class32_1)
| ~ s__subclass(s__Class32_2,s__Class32_3) ),
inference(resolve,[status(thm)],[c_180,c_150]) ).
cnf(c_182,plain,
( s__subclass(s__Class32_2,s__Class32_1)
| ~ s__subclass(s__Class32_3,s__Class32_1) ),
inference(resolve,[status(thm)],[c_181,c_144]) ).
cnf(c_174,plain,
s__subclass(s__Class32_2,s__Class32_1),
inference(resolve,[status(thm)],[c_182,c_145]) ).
cnf(c_175,plain,
$false,
inference(resolve,[status(thm)],[c_174,c_168]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR101+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n014.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 27 00:54:47 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.34 % Process 259009 was started by sandbox2 on n014,
% 0.08/0.34 % Sun Sep 27 00:54:47 2026
% 0.08/0.34 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.46/0.72
% 0.46/0.72 % SInE (scan): 99 to sos (tol 1.5x), 16 to usable (tol 2.0x), 37875 zapped, of 37990 axioms (depth 3).
% 0.46/0.72
% 0.46/0.72 % From the command line: assign(max_seconds, 300).
% 0.46/0.72
% 0.46/0.72 % SZS status Theorem for theBenchmark
% 0.46/0.72
% 0.46/0.72 % Proof 1 at 0.06 (+ 0.06) seconds.
% 0.46/0.72 % Length of proof is 20.
% 0.46/0.72 % Level of proof is 4.
% 0.46/0.72 % Maximum clause weight is 3.000.
% 0.46/0.72 % Given clauses 15.
% 0.46/0.72
% 0.46/0.72 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------