↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : CSR086+3 : 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 : n001.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 76.66s 12.08s
% Output   : CNFRefutation 76.66s
% 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_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_32710,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_32710) ).

fof(prove_from_ALL,conjecture,
    ? [V_NODE] : s__links(V_NODE,V_NODE,s__Arc13_1),
    file('theBenchmark.p',prove_from_ALL) ).

fof(prove_from_ALL_neg,negated_conjecture,
    ~ ? [V_NODE] : s__links(V_NODE,V_NODE,s__Arc13_1),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

cnf(c_997,plain,
    ( s__instance(A,s__SetOrClass)
    | ~ s__subclass(A,B) ),
    inference(clausify,[status(thm)],[kb_SUMO_26635]) ).

cnf(c_999,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]) ).

fof(kb_SUMO_32703,axiom,
    s__subclass(s__GraphArc,s__GraphElement),
    file('theBenchmark.p',kb_SUMO_32703) ).

cnf(c_1081,plain,
    s__subclass(s__GraphArc,s__GraphElement),
    inference(clausify,[status(thm)],[kb_SUMO_32703]) ).

fof(kb_SUMO_32707,axiom,
    s__subclass(s__GraphLoop,s__GraphArc),
    file('theBenchmark.p',kb_SUMO_32707) ).

cnf(c_1085,plain,
    s__subclass(s__GraphLoop,s__GraphArc),
    inference(clausify,[status(thm)],[kb_SUMO_32707]) ).

fof(nnf_64,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_32710]) ).

fof(sk_kb_SUMO_32710_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_64]) ).

fof(sk_kb_SUMO_32710,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_32710_sk]) ).

cnf(c_1087,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_32710]) ).

fof(local_1,axiom,
    s__instance(s__Arc13_1,s__GraphLoop),
    file('theBenchmark.p',local_1) ).

cnf(c_1131,plain,
    s__instance(s__Arc13_1,s__GraphLoop),
    inference(clausify,[status(thm)],[local_1]) ).

cnf(c_1132,negated_conjecture,
    ~ s__links(A,A,s__Arc13_1),
    inference(clausify,[status(thm)],[prove_from_ALL_neg]) ).

cnf(c_19972,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_1087,c_1131]) ).

cnf(c_1388,negated_conjecture,
    ~ s__instance(s__Arc13_1,s__GraphArc),
    inference(resolve,[status(thm)],[c_1132,c_19972]) ).

cnf(c_16630,plain,
    s__instance(s__GraphArc,s__SetOrClass),
    inference(resolve,[status(thm)],[c_1081,c_997]) ).

cnf(c_19973,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_1085,c_999]) ).

cnf(c_16699,plain,
    ( s__instance(A,s__GraphArc)
    | ~ s__instance(A,s__GraphLoop)
    | ~ s__instance(s__GraphLoop,s__SetOrClass) ),
    inference(resolve,[status(thm)],[c_16630,c_19973]) ).

cnf(c_16700,plain,
    s__instance(s__GraphLoop,s__SetOrClass),
    inference(resolve,[status(thm)],[c_1085,c_997]) ).

cnf(c_16702,plain,
    ( s__instance(A,s__GraphArc)
    | ~ s__instance(A,s__GraphLoop) ),
    inference(resolve,[status(thm)],[c_16700,c_16699]) ).

cnf(c_19974,plain,
    s__instance(s__Arc13_1,s__GraphArc),
    inference(resolve,[status(thm)],[c_16702,c_1131]) ).

cnf(c_19971,plain,
    $false,
    inference(resolve,[status(thm)],[c_1388,c_19974]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR086+3 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n001.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 00:52:16 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 3026098 was started by sandbox on n001,
% 0.10/0.37  % Sun Sep 27 00:52:16 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.42  WARNING: token truncated at 4095 chars (line 64008)
% 0.10/0.42  WARNING: token truncated at 4095 chars (line 64302)
% 0.10/0.42  WARNING: token truncated at 4095 chars (line 64389)
% 0.10/0.42  WARNING: token truncated at 4095 chars (line 65430)
% 0.10/0.43  WARNING: token truncated at 4095 chars (line 65625)
% 0.10/0.43  WARNING: token truncated at 4095 chars (line 65856)
% 76.66/12.08  
% 76.66/12.08  % SInE (scan): 583 to sos (tol 1.5x), 67 to usable (tol 2.0x), 144452 zapped, of 145102 axioms (depth 3).
% 76.66/12.08  
% 76.66/12.08  % From the command line: assign(max_seconds, 300).
% 76.66/12.08  
% 76.66/12.08  % given #500 (T,wt=8): 1673 s__instance(s__Artery,s__SetOrClass).  [resolve(997,a,749,a)].
% 76.66/12.08  
% 76.66/12.08  % given #1000 (F,wt=8): 15995 -s__properPart(s__ArabianSea,s__ArabianSea).  [resolve(15927,a,464,a)].
% 76.66/12.08  
% 76.66/12.08  % given #1500 (T,wt=8): 17345 s__instance(s__Ankle,s__Abstract).  [resolve(2652,a,1624,a)].
% 76.66/12.08  
% 76.66/12.08  % given #2000 (F,wt=11): 19625 -s__reflexiveOn(s__larger__m,s__RoadJunction) | -s__instance(s__SouthernOcean,s__RoadJunction).  [resolve(9443,b,1679,a)].
% 76.66/12.08  
% 76.66/12.08  % given #2500 (T,wt=11): 7116 -s__subclass(s__Transitway,s__TransitwayJunction) | s__TransitwayJunction = s__Transitway.  [resolve(1013,c,699,a),unit_del(a,1672),unit_del(b,1623)].
% 76.66/12.08  
% 76.66/12.08  % SZS status Theorem for theBenchmark
% 76.66/12.08  
% 76.66/12.08  % Proof 1 at 8.72 (+ 2.02) seconds.
% 76.66/12.08  % Length of proof is 17.
% 76.66/12.08  % Level of proof is 5.
% 76.66/12.08  % Maximum clause weight is 120.000.
% 76.66/12.08  % Given clauses 2775.
% 76.66/12.08  
% 76.66/12.08  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------