%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR101+6 : 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 : 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 : Sun Sep 27 07:07:26 AM UTC 2026
% Result : Theorem 2.16s 1.15s
% Output : CNFRefutation 2.16s
% 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_26635,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_26635) ).
fof(kb_SUMO_26636,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_26636) ).
fof(kb_SUMO_28461,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_28461) ).
fof(prove_from_ALL,conjecture,
! [V_X] :
( s__instance(V_X,s__Class32_2)
=> s__instance(V_X,s__Class32_1) ),
file('theBenchmark.p',prove_from_ALL) ).
fof(prove_from_ALL_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_ALL]) ).
cnf(c_14,plain,
( s__instance(A,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26635]) ).
cnf(c_15,plain,
( s__instance(B,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26635]) ).
cnf(c_16,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_26636]) ).
cnf(c_20,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_28461]) ).
fof(local_4,axiom,
s__subclass(s__Class32_1,s__Animal),
file('theBenchmark.p',local_4) ).
cnf(c_25,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_26,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_29,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_30,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(clausify,[status(thm)],[local_9]) ).
fof(nnf_8,plain,
? [V_X] :
( ~ s__instance(V_X,s__Class32_1)
& s__instance(V_X,s__Class32_2) ),
inference(fof_nnf,[status(thm)],[prove_from_ALL_neg]) ).
fof(sk_prove_from_ALL_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_8]) ).
cnf(c_31,negated_conjecture,
s__instance(sK0,s__Class32_2),
inference(split_conjunct,[status(thm)],[sk_prove_from_ALL_neg]) ).
cnf(c_32,negated_conjecture,
~ s__instance(sK0,s__Class32_1),
inference(split_conjunct,[status(thm)],[sk_prove_from_ALL_neg]) ).
cnf(c_38,plain,
s__instance(s__Class32_1,s__SetOrClass),
inference(resolve,[status(thm)],[c_14,c_25]) ).
cnf(c_39,plain,
s__instance(s__Class32_2,s__SetOrClass),
inference(resolve,[status(thm)],[c_14,c_26]) ).
cnf(c_40,plain,
s__instance(s__Class32_3,s__SetOrClass),
inference(resolve,[status(thm)],[c_15,c_29]) ).
cnf(c_58,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_16,c_38]) ).
cnf(c_59,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_58,c_39]) ).
cnf(c_60,negated_conjecture,
( s__instance(sK0,s__Class32_1)
| ~ s__subclass(s__Class32_2,s__Class32_1) ),
inference(resolve,[status(thm)],[c_59,c_31]) ).
cnf(c_54,negated_conjecture,
~ s__subclass(s__Class32_2,s__Class32_1),
inference(resolve,[status(thm)],[c_60,c_32]) ).
cnf(c_61,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_20,c_38]) ).
cnf(c_62,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_61,c_40]) ).
cnf(c_63,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_62,c_39]) ).
cnf(c_64,plain,
( s__subclass(s__Class32_2,s__Class32_1)
| ~ s__subclass(s__Class32_3,s__Class32_1) ),
inference(resolve,[status(thm)],[c_63,c_29]) ).
cnf(c_65,plain,
s__subclass(s__Class32_2,s__Class32_1),
inference(resolve,[status(thm)],[c_64,c_30]) ).
cnf(c_57,plain,
$false,
inference(resolve,[status(thm)],[c_54,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR101+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 27 00:54:51 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 3908258 was started by sandbox2 on n013,
% 0.08/0.36 % Sun Sep 27 00:54:51 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.47 WARNING: token truncated at 4095 chars (line 64008)
% 0.14/0.47 WARNING: token truncated at 4095 chars (line 64302)
% 0.14/0.47 WARNING: token truncated at 4095 chars (line 64389)
% 0.14/0.47 WARNING: token truncated at 4095 chars (line 65430)
% 0.14/0.47 WARNING: token truncated at 4095 chars (line 65625)
% 0.14/0.47 WARNING: token truncated at 4095 chars (line 65856)
% 2.16/1.15
% 2.16/1.15 % SInE (scan): 19 to sos (tol 1.5x), 0 to usable (tol 2.0x), 55576 zapped, of 55595 axioms (depth 3).
% 2.16/1.15
% 2.16/1.15 % From the command line: assign(max_seconds, 300).
% 2.16/1.15
% 2.16/1.15 % SZS status Theorem for theBenchmark
% 2.16/1.15
% 2.16/1.15 % Proof 1 at 0.10 (+ 0.08) seconds.
% 2.16/1.15 % Length of proof is 19.
% 2.16/1.15 % Level of proof is 4.
% 2.16/1.15 % Maximum clause weight is 123.000.
% 2.16/1.15 % Given clauses 24.
% 2.16/1.15
% 2.16/1.15 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------