%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR100+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 : n009.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.13s 5.66s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 33 ( 19 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 31 ~; 27 |; 6 &)
% ( 0 <=>; 5 =>; 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 : 24 ( 2 sgn 8 !; 0 ?)
% 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,
s__instance(s__Animal31,s__Class31_1),
file('theBenchmark.p',prove_from_SUMO_MILO) ).
fof(prove_from_SUMO_MILO_neg,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_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__Class31_1,s__Animal),
file('theBenchmark.p',local_4) ).
cnf(c_140,plain,
s__subclass(s__Class31_1,s__Animal),
inference(clausify,[status(thm)],[local_4]) ).
fof(local_7,axiom,
s__subclass(s__Class31_1,s__Class31_2),
file('theBenchmark.p',local_7) ).
cnf(c_143,plain,
s__subclass(s__Class31_1,s__Class31_2),
inference(clausify,[status(thm)],[local_7]) ).
fof(local_8,axiom,
s__subclass(s__Class31_2,s__Class31_3),
file('theBenchmark.p',local_8) ).
cnf(c_144,plain,
s__subclass(s__Class31_2,s__Class31_3),
inference(clausify,[status(thm)],[local_8]) ).
fof(local_9,axiom,
s__subclass(s__Class31_3,s__Class31_1),
file('theBenchmark.p',local_9) ).
cnf(c_145,plain,
s__subclass(s__Class31_3,s__Class31_1),
inference(clausify,[status(thm)],[local_9]) ).
fof(local_10,axiom,
s__instance(s__Animal31,s__Class31_2),
file('theBenchmark.p',local_10) ).
cnf(c_146,plain,
s__instance(s__Animal31,s__Class31_2),
inference(clausify,[status(thm)],[local_10]) ).
cnf(c_147,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(clausify,[status(thm)],[prove_from_SUMO_MILO_neg]) ).
cnf(c_149,plain,
s__instance(s__Class31_1,s__SetOrClass),
inference(resolve,[status(thm)],[c_27,c_140]) ).
cnf(c_150,plain,
s__instance(s__Class31_2,s__SetOrClass),
inference(resolve,[status(thm)],[c_28,c_143]) ).
cnf(c_151,plain,
s__instance(s__Class31_3,s__SetOrClass),
inference(resolve,[status(thm)],[c_27,c_145]) ).
cnf(c_178,plain,
( s__instance(B,s__Class31_1)
| ~ s__instance(B,A)
| ~ s__subclass(A,s__Class31_1)
| ~ s__instance(A,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_29,c_149]) ).
cnf(c_179,plain,
( s__instance(A,s__Class31_1)
| ~ s__instance(A,s__Class31_2)
| ~ s__subclass(s__Class31_2,s__Class31_1) ),
inference(resolve,[status(thm)],[c_178,c_150]) ).
cnf(c_180,plain,
( s__instance(s__Animal31,s__Class31_1)
| ~ s__subclass(s__Class31_2,s__Class31_1) ),
inference(resolve,[status(thm)],[c_179,c_146]) ).
cnf(c_164,negated_conjecture,
~ s__subclass(s__Class31_2,s__Class31_1),
inference(resolve,[status(thm)],[c_180,c_147]) ).
cnf(c_181,plain,
( s__subclass(B,s__Class31_1)
| ~ s__subclass(A,s__Class31_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_182,plain,
( s__subclass(A,s__Class31_1)
| ~ s__subclass(s__Class31_3,s__Class31_1)
| ~ s__subclass(A,s__Class31_3)
| ~ s__instance(A,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_181,c_151]) ).
cnf(c_183,plain,
( s__subclass(s__Class31_2,s__Class31_1)
| ~ s__subclass(s__Class31_3,s__Class31_1)
| ~ s__subclass(s__Class31_2,s__Class31_3) ),
inference(resolve,[status(thm)],[c_182,c_150]) ).
cnf(c_184,plain,
( s__subclass(s__Class31_2,s__Class31_1)
| ~ s__subclass(s__Class31_2,s__Class31_3) ),
inference(resolve,[status(thm)],[c_183,c_145]) ).
cnf(c_185,plain,
~ s__subclass(s__Class31_2,s__Class31_3),
inference(resolve,[status(thm)],[c_184,c_164]) ).
cnf(c_177,plain,
$false,
inference(resolve,[status(thm)],[c_144,c_185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR100+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.37 % Computer : n009.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sun Sep 27 00:54:35 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.37 % Process 1503968 was started by sandbox2 on n009,
% 0.09/5.37 % Sun Sep 27 00:54:35 2026
% 0.09/5.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/5.66
% 0.13/5.66 % SInE (scan): 100 to sos (tol 1.5x), 16 to usable (tol 2.0x), 37875 zapped, of 37991 axioms (depth 3).
% 0.13/5.66
% 0.13/5.66 % From the command line: assign(max_seconds, 300).
% 0.13/5.66
% 0.13/5.66 % Assigning unary symbol s__ListLengthFn kb_weight 0 and highest precedence (70).
% 0.13/5.66
% 0.13/5.66 % SZS status Theorem for theBenchmark
% 0.13/5.66
% 0.13/5.66 % Proof 1 at 0.06 (+ 0.05) seconds.
% 0.13/5.66 % Length of proof is 19.
% 0.13/5.66 % Level of proof is 4.
% 0.13/5.66 % Maximum clause weight is 108.000.
% 0.13/5.66 % Given clauses 18.
% 0.13/5.66
% 0.13/5.66 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------