↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : CSR101+4 : 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 : n014.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 0.30s 0.47s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  16 unt;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   51 (  23   ~;  18   |;   5   &)
%                                         (   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   :   23 (   2 sgn   7   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
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_X] :
      ( s__instance(V_X,s__Class32_2)
     => s__instance(V_X,s__Class32_1) ),
    file('theBenchmark.p',prove_from_SUMO) ).

fof(prove_from_SUMO_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_SUMO]) ).

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

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

cnf(c_44,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(local_4,axiom,
    s__subclass(s__Class32_1,s__Animal),
    file('theBenchmark.p',local_4) ).

cnf(c_55,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_56,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_59,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_60,plain,
    s__subclass(s__Class32_3,s__Class32_1),
    inference(clausify,[status(thm)],[local_9]) ).

fof(nnf_22,plain,
    ? [V_X] :
      ( ~ s__instance(V_X,s__Class32_1)
      & s__instance(V_X,s__Class32_2) ),
    inference(fof_nnf,[status(thm)],[prove_from_SUMO_neg]) ).

fof(sk_prove_from_SUMO_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_22]) ).

cnf(c_61,negated_conjecture,
    s__instance(sK0,s__Class32_2),
    inference(split_conjunct,[status(thm)],[sk_prove_from_SUMO_neg]) ).

cnf(c_62,negated_conjecture,
    ~ s__instance(sK0,s__Class32_1),
    inference(split_conjunct,[status(thm)],[sk_prove_from_SUMO_neg]) ).

cnf(c_65,plain,
    s__instance(s__Class32_1,s__SetOrClass),
    inference(resolve,[status(thm)],[c_42,c_55]) ).

cnf(c_66,plain,
    s__instance(s__Class32_2,s__SetOrClass),
    inference(resolve,[status(thm)],[c_42,c_56]) ).

cnf(c_67,plain,
    s__instance(s__Class32_3,s__SetOrClass),
    inference(resolve,[status(thm)],[c_43,c_59]) ).

cnf(c_83,plain,
    ( s__instance(B,s__Class32_3)
    | ~ s__instance(B,A)
    | ~ s__subclass(A,s__Class32_3)
    | ~ s__instance(A,s__SetOrClass) ),
    inference(resolve,[status(thm)],[c_44,c_67]) ).

cnf(c_84,plain,
    ( s__instance(A,s__Class32_3)
    | ~ s__instance(A,s__Class32_2)
    | ~ s__subclass(s__Class32_2,s__Class32_3) ),
    inference(resolve,[status(thm)],[c_83,c_66]) ).

cnf(c_85,plain,
    ( s__instance(A,s__Class32_3)
    | ~ s__instance(A,s__Class32_2) ),
    inference(resolve,[status(thm)],[c_84,c_59]) ).

cnf(c_76,negated_conjecture,
    s__instance(sK0,s__Class32_3),
    inference(resolve,[status(thm)],[c_85,c_61]) ).

cnf(c_86,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_44,c_65]) ).

cnf(c_87,plain,
    ( s__instance(A,s__Class32_1)
    | ~ s__instance(A,s__Class32_3)
    | ~ s__subclass(s__Class32_3,s__Class32_1) ),
    inference(resolve,[status(thm)],[c_86,c_67]) ).

cnf(c_88,plain,
    ( s__instance(A,s__Class32_1)
    | ~ s__instance(A,s__Class32_3) ),
    inference(resolve,[status(thm)],[c_87,c_60]) ).

cnf(c_81,negated_conjecture,
    ~ s__instance(sK0,s__Class32_3),
    inference(resolve,[status(thm)],[c_88,c_62]) ).

cnf(c_82,plain,
    $false,
    inference(resolve,[status(thm)],[c_81,c_76]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR101+4 : 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 : n014.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:55:01 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 259404 was started by sandbox2 on n014,
% 0.08/0.36  % Sun Sep 27 00:55:01 2026
% 0.08/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.30/0.47  
% 0.30/0.47  % SInE (scan): 31 to sos (tol 1.5x), 3 to usable (tol 2.0x), 7192 zapped, of 7226 axioms (depth 3).
% 0.30/0.47  
% 0.30/0.47  % From the command line: assign(max_seconds, 300).
% 0.30/0.47  
% 0.30/0.47  % SZS status Theorem for theBenchmark
% 0.30/0.47  
% 0.30/0.47  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.30/0.47  % Length of proof is 18.
% 0.30/0.47  % Level of proof is 4.
% 0.30/0.47  % Maximum clause weight is 115.000.
% 0.30/0.47  % Given clauses 19.
% 0.30/0.47  
% 0.30/0.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------