%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR086+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 : n017.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:16 AM UTC 2026
% Result : Theorem 0.36s 0.86s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 14 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 77 ( 33 ~; 29 |; 10 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 26 ( 1 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_4789,axiom,
! [V__LOOP] :
( s__instance(V__LOOP,s__GraphArc)
=> ( s__instance(V__LOOP,s__GraphLoop)
<=> ? [V__NODE] :
( s__links(V__NODE,V__NODE,V__LOOP)
& s__instance(V__NODE,s__GraphNode) ) ) ),
file('theBenchmark.p',kb_SUMO_4789) ).
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(prove_from_SUMO_MILO,conjecture,
? [V_NODE] : s__links(V_NODE,V_NODE,s__Arc13_1),
file('theBenchmark.p',prove_from_SUMO_MILO) ).
fof(prove_from_SUMO_MILO_neg,negated_conjecture,
~ ? [V_NODE] : s__links(V_NODE,V_NODE,s__Arc13_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_87,plain,
( s__instance(A,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26]) ).
cnf(c_89,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]) ).
fof(kb_SUMO_4782,axiom,
s__subclass(s__GraphArc,s__GraphElement),
file('theBenchmark.p',kb_SUMO_4782) ).
cnf(c_269,plain,
s__subclass(s__GraphArc,s__GraphElement),
inference(clausify,[status(thm)],[kb_SUMO_4782]) ).
fof(kb_SUMO_4786,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('theBenchmark.p',kb_SUMO_4786) ).
cnf(c_273,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(clausify,[status(thm)],[kb_SUMO_4786]) ).
fof(nnf_34,plain,
! [V__LOOP] :
( ( ( ! [V__NODE] :
( ~ s__links(V__NODE,V__NODE,V__LOOP)
| ~ s__instance(V__NODE,s__GraphNode) )
| s__instance(V__LOOP,s__GraphLoop) )
& ( ? [X0] :
( s__links(X0,X0,V__LOOP)
& s__instance(X0,s__GraphNode) )
| ~ s__instance(V__LOOP,s__GraphLoop) ) )
| ~ s__instance(V__LOOP,s__GraphArc) ),
inference(fof_nnf,[status(thm)],[kb_SUMO_4789]) ).
fof(sk_kb_SUMO_4789_sk,plain,
! [V__LOOP] :
( ( ( ! [V__NODE] :
( ~ s__links(V__NODE,V__NODE,V__LOOP)
| ~ s__instance(V__NODE,s__GraphNode) )
| s__instance(V__LOOP,s__GraphLoop) )
& ( ( s__links(sK0(V__LOOP),sK0(V__LOOP),V__LOOP)
& s__instance(sK0(V__LOOP),s__GraphNode) )
| ~ s__instance(V__LOOP,s__GraphLoop) ) )
| ~ s__instance(V__LOOP,s__GraphArc) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0(V__LOOP))],[nnf_34]) ).
fof(sk_kb_SUMO_4789,plain,
( ! [VAR_0,VAR_1] :
( ~ s__links(VAR_1,VAR_1,VAR_0)
| ~ s__instance(VAR_1,s__GraphNode)
| s__instance(VAR_0,s__GraphLoop)
| ~ s__instance(VAR_0,s__GraphArc) )
& ! [VAR_0] :
( s__links(sK0(VAR_0),sK0(VAR_0),VAR_0)
| ~ s__instance(VAR_0,s__GraphLoop)
| ~ s__instance(VAR_0,s__GraphArc) )
& ! [VAR_0] :
( s__instance(sK0(VAR_0),s__GraphNode)
| ~ s__instance(VAR_0,s__GraphLoop)
| ~ s__instance(VAR_0,s__GraphArc) ) ),
inference(cnf_transformation,[status(thm)],[sk_kb_SUMO_4789_sk]) ).
cnf(c_275,plain,
( s__links(sK0(A),sK0(A),A)
| ~ s__instance(A,s__GraphLoop)
| ~ s__instance(A,s__GraphArc) ),
inference(split_conjunct,[status(thm)],[sk_kb_SUMO_4789]) ).
fof(local_1,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('theBenchmark.p',local_1) ).
cnf(c_286,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(clausify,[status(thm)],[local_1]) ).
cnf(c_287,negated_conjecture,
~ s__links(A,A,s__Arc13_1),
inference(clausify,[status(thm)],[prove_from_SUMO_MILO_neg]) ).
cnf(c_307,plain,
( s__instance(s__Arc13_1,A)
| ~ s__subclass(s__GraphLoop,A)
| ~ s__instance(s__GraphLoop,s__SetOrClass)
| ~ s__instance(A,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_286,c_89]) ).
cnf(c_882,plain,
( s__links(sK0(s__Arc13_1),sK0(s__Arc13_1),s__Arc13_1)
| ~ s__instance(s__Arc13_1,s__GraphArc) ),
inference(resolve,[status(thm)],[c_275,c_286]) ).
cnf(c_355,negated_conjecture,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(resolve,[status(thm)],[c_287,c_882]) ).
cnf(c_816,plain,
s__instance(s__GraphArc,s__SetOrClass),
inference(resolve,[status(thm)],[c_269,c_87]) ).
cnf(c_883,plain,
( s__instance(s__Arc13_1,s__GraphArc)
| ~ s__subclass(s__GraphLoop,s__GraphArc)
| ~ s__instance(s__GraphLoop,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_816,c_307]) ).
cnf(c_884,plain,
( s__instance(s__Arc13_1,s__GraphArc)
| ~ s__instance(s__GraphLoop,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_273,c_883]) ).
cnf(c_827,plain,
~ s__instance(s__GraphLoop,s__SetOrClass),
inference(resolve,[status(thm)],[c_355,c_884]) ).
cnf(c_885,plain,
s__instance(s__GraphLoop,s__SetOrClass),
inference(resolve,[status(thm)],[c_273,c_87]) ).
cnf(c_881,plain,
$false,
inference(resolve,[status(thm)],[c_827,c_885]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR086+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.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 00:42:05 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 2013698 was started by sandbox2 on n017,
% 0.10/0.38 % Sun Sep 27 00:42:05 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.36/0.86
% 0.36/0.86 % SInE (scan): 138 to sos (tol 1.5x), 33 to usable (tol 2.0x), 37811 zapped, of 37982 axioms (depth 3).
% 0.36/0.86
% 0.36/0.86 % From the command line: assign(max_seconds, 300).
% 0.36/0.86
% 0.36/0.86 % SZS status Theorem for theBenchmark
% 0.36/0.86
% 0.36/0.86 % Proof 1 at 0.11 (+ 0.07) seconds.
% 0.36/0.86 % Length of proof is 16.
% 0.36/0.86 % Level of proof is 4.
% 0.36/0.86 % Maximum clause weight is 108.000.
% 0.36/0.86 % Given clauses 228.
% 0.36/0.86
% 0.36/0.86 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------