%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR100+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 : n020.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.87s
% 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_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,
s__instance(s__Animal31,s__Class31_1),
file('theBenchmark.p',prove_from_ALL) ).
fof(prove_from_ALL_neg,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_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__Class31_1,s__Animal),
file('theBenchmark.p',local_4) ).
cnf(c_25,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_28,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_29,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_30,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_31,plain,
s__instance(s__Animal31,s__Class31_2),
inference(clausify,[status(thm)],[local_10]) ).
cnf(c_32,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(clausify,[status(thm)],[prove_from_ALL_neg]) ).
cnf(c_36,plain,
s__instance(s__Class31_1,s__SetOrClass),
inference(resolve,[status(thm)],[c_14,c_25]) ).
cnf(c_37,plain,
s__instance(s__Class31_2,s__SetOrClass),
inference(resolve,[status(thm)],[c_15,c_28]) ).
cnf(c_38,plain,
s__instance(s__Class31_3,s__SetOrClass),
inference(resolve,[status(thm)],[c_14,c_30]) ).
cnf(c_55,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_16,c_36]) ).
cnf(c_56,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_55,c_37]) ).
cnf(c_57,plain,
( s__instance(s__Animal31,s__Class31_1)
| ~ s__subclass(s__Class31_2,s__Class31_1) ),
inference(resolve,[status(thm)],[c_56,c_31]) ).
cnf(c_41,negated_conjecture,
~ s__subclass(s__Class31_2,s__Class31_1),
inference(resolve,[status(thm)],[c_57,c_32]) ).
cnf(c_58,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_20,c_36]) ).
cnf(c_59,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_58,c_38]) ).
cnf(c_60,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_59,c_37]) ).
cnf(c_61,plain,
( s__subclass(s__Class31_2,s__Class31_1)
| ~ s__subclass(s__Class31_2,s__Class31_3) ),
inference(resolve,[status(thm)],[c_60,c_30]) ).
cnf(c_53,plain,
~ s__subclass(s__Class31_2,s__Class31_3),
inference(resolve,[status(thm)],[c_61,c_41]) ).
cnf(c_54,plain,
$false,
inference(resolve,[status(thm)],[c_53,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR100+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.09/5.36 % Computer : n020.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sun Sep 27 00:55:40 UTC 2026
% 0.09/5.36 % CPUTime :
% 0.09/5.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.36 % Process 2909086 was started by sandbox2 on n020,
% 0.09/5.36 % Sun Sep 27 00:55:40 2026
% 0.09/5.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/5.42 WARNING: token truncated at 4095 chars (line 64008)
% 0.13/5.42 WARNING: token truncated at 4095 chars (line 64302)
% 0.13/5.42 WARNING: token truncated at 4095 chars (line 64389)
% 0.13/5.42 WARNING: token truncated at 4095 chars (line 65430)
% 0.13/5.42 WARNING: token truncated at 4095 chars (line 65625)
% 0.13/5.42 WARNING: token truncated at 4095 chars (line 65856)
% 0.13/5.87
% 0.13/5.87 % SInE (scan): 20 to sos (tol 1.5x), 0 to usable (tol 2.0x), 55576 zapped, of 55596 axioms (depth 3).
% 0.13/5.87
% 0.13/5.87 % From the command line: assign(max_seconds, 300).
% 0.13/5.87
% 0.13/5.87 % SZS status Theorem for theBenchmark
% 0.13/5.87
% 0.13/5.87 % Proof 1 at 0.09 (+ 0.08) seconds.
% 0.13/5.87 % Length of proof is 20.
% 0.13/5.87 % Level of proof is 5.
% 0.13/5.87 % Maximum clause weight is 120.000.
% 0.13/5.87 % Given clauses 25.
% 0.13/5.87
% 0.13/5.87 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------