%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR086+1 : 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 : n005.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.54s 0.55s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% 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 : 76 ( 32 ~; 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 : 28 ( 1 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_3603,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_3603) ).
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,conjecture,
? [V_NODE] : s__links(V_NODE,V_NODE,s__Arc13_1),
file('theBenchmark.p',prove_from_SUMO) ).
fof(prove_from_SUMO_neg,negated_conjecture,
~ ? [V_NODE] : s__links(V_NODE,V_NODE,s__Arc13_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
cnf(c_78,plain,
( s__instance(A,s__SetOrClass)
| ~ s__subclass(A,B) ),
inference(clausify,[status(thm)],[kb_SUMO_26]) ).
cnf(c_80,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_3596,axiom,
s__subclass(s__GraphArc,s__GraphElement),
file('theBenchmark.p',kb_SUMO_3596) ).
cnf(c_232,plain,
s__subclass(s__GraphArc,s__GraphElement),
inference(clausify,[status(thm)],[kb_SUMO_3596]) ).
fof(kb_SUMO_3600,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('theBenchmark.p',kb_SUMO_3600) ).
cnf(c_236,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(clausify,[status(thm)],[kb_SUMO_3600]) ).
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_3603]) ).
fof(sk_kb_SUMO_3603_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_3603,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_3603_sk]) ).
cnf(c_238,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_3603]) ).
fof(local_1,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('theBenchmark.p',local_1) ).
cnf(c_249,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(clausify,[status(thm)],[local_1]) ).
cnf(c_250,negated_conjecture,
~ s__links(A,A,s__Arc13_1),
inference(clausify,[status(thm)],[prove_from_SUMO_neg]) ).
cnf(c_661,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_238,c_249]) ).
cnf(c_345,negated_conjecture,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(resolve,[status(thm)],[c_250,c_661]) ).
cnf(c_551,plain,
s__instance(s__GraphArc,s__SetOrClass),
inference(resolve,[status(thm)],[c_232,c_78]) ).
cnf(c_662,plain,
( s__instance(A,s__GraphArc)
| ~ s__instance(A,s__GraphLoop)
| ~ s__instance(s__GraphLoop,s__SetOrClass)
| ~ s__instance(s__GraphArc,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_236,c_80]) ).
cnf(c_566,plain,
( s__instance(A,s__GraphArc)
| ~ s__instance(A,s__GraphLoop)
| ~ s__instance(s__GraphLoop,s__SetOrClass) ),
inference(resolve,[status(thm)],[c_551,c_662]) ).
cnf(c_567,plain,
s__instance(s__GraphLoop,s__SetOrClass),
inference(resolve,[status(thm)],[c_236,c_78]) ).
cnf(c_569,plain,
( s__instance(A,s__GraphArc)
| ~ s__instance(A,s__GraphLoop) ),
inference(resolve,[status(thm)],[c_567,c_566]) ).
cnf(c_663,plain,
s__instance(s__Arc13_1,s__GraphArc),
inference(resolve,[status(thm)],[c_569,c_249]) ).
cnf(c_660,plain,
$false,
inference(resolve,[status(thm)],[c_345,c_663]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR086+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n005.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 00:46:32 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37 % Process 3461819 was started by sandbox on n005,
% 0.08/0.37 % Sun Sep 27 00:46:32 2026
% 0.08/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.54/0.55
% 0.54/0.55 % SInE (scan): 119 to sos (tol 1.5x), 24 to usable (tol 2.0x), 14645 zapped, of 14788 axioms (depth 3).
% 0.54/0.55
% 0.54/0.55 % From the command line: assign(max_seconds, 300).
% 0.54/0.55
% 0.54/0.55 % SZS status Theorem for theBenchmark
% 0.54/0.55
% 0.54/0.55 % Proof 1 at 0.07 (+ 0.04) seconds.
% 0.54/0.55 % Length of proof is 17.
% 0.54/0.55 % Level of proof is 5.
% 0.54/0.55 % Maximum clause weight is 108.000.
% 0.54/0.55 % Given clauses 111.
% 0.54/0.55
% 0.54/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------