%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR099+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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:24 AM UTC 2026
% Result : Theorem 0.47s 0.85s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 13 unt; 0 def)
% Number of atoms : 41 ( 10 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 36 ( 16 ~; 14 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 8 ( 1 sgn 4 !; 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_1443,axiom,
! [V__INST1,V__INST2] :
( ( s__instance(V__INST1,s__SetOrClass)
& s__instance(V__INST2,s__SetOrClass) )
=> ( ( s__subclass(V__INST2,V__INST1)
& s__subclass(V__INST1,V__INST2) )
=> V__INST1 = V__INST2 ) ),
file('theBenchmark.p',kb_SUMO_1443) ).
fof(prove_from_SUMO_MILO,conjecture,
s__Class30_1 = s__Reptile,
file('theBenchmark.p',prove_from_SUMO_MILO) ).
fof(prove_from_SUMO_MILO_neg,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_203,plain,
( s__instance(A,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26]) ).
cnf(c_211,plain,
( B = A
| ~ s__subclass(A,B)
| ~ s__subclass(B,A)
| ~ s__instance(B,s__SetOrClass)
| ~ s__instance(A,s__SetOrClass) ),
inference(clausify,[status(thm)],[kb_SUMO_1443]) ).
fof(kb_SUMO_7294,axiom,
s__subclass(s__Reptile,s__ColdBloodedVertebrate),
file('theBenchmark.p',kb_SUMO_7294) ).
cnf(c_231,plain,
s__subclass(s__Reptile,s__ColdBloodedVertebrate),
inference(clausify,[status(thm)],[kb_SUMO_7294]) ).
fof(local_2,axiom,
s__subclass(s__Class30_1,s__Reptile),
file('theBenchmark.p',local_2) ).
cnf(c_239,plain,
s__subclass(s__Class30_1,s__Reptile),
inference(clausify,[status(thm)],[local_2]) ).
fof(local_3,axiom,
s__subclass(s__Reptile,s__Class30_1),
file('theBenchmark.p',local_3) ).
cnf(c_240,plain,
s__subclass(s__Reptile,s__Class30_1),
inference(clausify,[status(thm)],[local_3]) ).
cnf(c_241,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(clausify,[status(thm)],[prove_from_SUMO_MILO_neg]) ).
cnf(c_301,plain,
s__instance(s__Reptile,s__SetOrClass),
inference(resolve,[status(thm)],[c_231,c_203]) ).
cnf(c_312,plain,
s__instance(s__Class30_1,s__SetOrClass),
inference(resolve,[status(thm)],[c_239,c_203]) ).
cnf(c_432,plain,
( s__Reptile = s__Class30_1
| ~ s__subclass(s__Class30_1,s__Reptile)
| ~ s__instance(s__Reptile,s__SetOrClass)
| ~ s__instance(s__Class30_1,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_211,c_240]) ).
cnf(c_433,plain,
( s__Class30_1 = s__Reptile
| ~ s__subclass(s__Class30_1,s__Reptile)
| ~ s__instance(s__Reptile,s__SetOrClass)
| ~ s__instance(s__Class30_1,s__SetOrClass) ),
inference(copy,[status(thm)],[c_432]) ).
cnf(c_434,plain,
( s__Class30_1 = s__Reptile
| ~ s__subclass(s__Class30_1,s__Reptile)
| ~ s__instance(s__Reptile,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_312,c_433]) ).
cnf(c_435,plain,
( s__Class30_1 = s__Reptile
| ~ s__subclass(s__Class30_1,s__Reptile) ),
inference(resolve,[status(thm)],[c_301,c_434]) ).
cnf(c_436,plain,
s__Class30_1 = s__Reptile,
inference(resolve,[status(thm)],[c_239,c_435]) ).
cnf(c_431,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_241,c_436]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR099+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 % Computer : n006.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 00:54:26 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.40 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.40 % Process 2466399 was started by sandbox on n006,
% 0.12/0.40 % Sun Sep 27 00:54:26 2026
% 0.12/0.40 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.47/0.85
% 0.47/0.85 % SInE (scan): 104 to sos (tol 1.5x), 22 to usable (tol 2.0x), 16625 zapped, of 16751 axioms (depth 3).
% 0.47/0.85
% 0.47/0.85 % From the command line: assign(max_seconds, 300).
% 0.47/0.85
% 0.47/0.85 % SZS status Theorem for theBenchmark
% 0.47/0.85
% 0.47/0.85 % Proof 1 at 0.09 (+ 0.04) seconds.
% 0.47/0.85 % Length of proof is 12.
% 0.47/0.85 % Level of proof is 3.
% 0.47/0.85 % Maximum clause weight is 120.000.
% 0.47/0.85 % Given clauses 24.
% 0.47/0.85
% 0.47/0.85 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------