↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : CSR099+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 : n013.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:24 AM UTC 2026

% Result   : Theorem 0.23s 0.52s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   37 (   9 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   32 (  14   ~;  12   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   10 (   2 sgn   4   !;   0   ?)

% 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_1220,axiom,
    ! [V__INST1,V__INST2] :
      ( ( s__instance(V__INST1,s__SetOrClass)
        & s__instance(V__INST2,s__SetOrClass) )
     => ( ( s__subclass(V__INST2,V__INST1)
          & s__subclass(V__INST1,V__INST2) )
       => V__INST1 = V__INST2 ) ),
    file('theBenchmark.p',kb_SUMO_1220) ).

fof(prove_from_SUMO,conjecture,
    s__Class30_1 = s__Reptile,
    file('theBenchmark.p',prove_from_SUMO) ).

fof(prove_from_SUMO_neg,negated_conjecture,
    s__Class30_1 != s__Reptile,
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

fof(local_3,axiom,
    s__subclass(s__Reptile,s__Class30_1),
    file('theBenchmark.p',local_3) ).

cnf(c_148,plain,
    s__subclass(s__Reptile,s__Class30_1),
    inference(clausify,[status(thm)],[local_3]) ).

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

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

cnf(c_157,plain,
    ( B = A
    | ~ s__subclass(A,B)
    | ~ s__subclass(B,A)
    | ~ s__instance(B,s__SetOrClass)
    | ~ s__instance(A,s__SetOrClass) ),
    inference(clausify,[status(thm)],[kb_SUMO_1220]) ).

fof(local_2,axiom,
    s__subclass(s__Class30_1,s__Reptile),
    file('theBenchmark.p',local_2) ).

cnf(c_175,plain,
    s__subclass(s__Class30_1,s__Reptile),
    inference(clausify,[status(thm)],[local_2]) ).

cnf(c_176,negated_conjecture,
    s__Class30_1 != s__Reptile,
    inference(clausify,[status(thm)],[prove_from_SUMO_neg]) ).

cnf(c_193,plain,
    s__instance(s__Reptile,s__SetOrClass),
    inference(resolve,[status(thm)],[c_149,c_148]) ).

cnf(c_201,plain,
    s__instance(s__Class30_1,s__SetOrClass),
    inference(resolve,[status(thm)],[c_150,c_148]) ).

cnf(c_371,plain,
    ( s__Class30_1 = s__Reptile
    | ~ s__subclass(s__Reptile,s__Class30_1)
    | ~ s__instance(s__Class30_1,s__SetOrClass)
    | ~ s__instance(s__Reptile,s__SetOrClass) ),
    inference(resolve,[status(thm)],[c_157,c_175]) ).

cnf(c_372,plain,
    ( s__Class30_1 = s__Reptile
    | ~ s__subclass(s__Reptile,s__Class30_1)
    | ~ s__instance(s__Class30_1,s__SetOrClass) ),
    inference(resolve,[status(thm)],[c_193,c_371]) ).

cnf(c_373,plain,
    ( s__Class30_1 = s__Reptile
    | ~ s__subclass(s__Reptile,s__Class30_1) ),
    inference(resolve,[status(thm)],[c_201,c_372]) ).

cnf(c_374,plain,
    s__Class30_1 = s__Reptile,
    inference(resolve,[status(thm)],[c_148,c_373]) ).

cnf(c_370,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_176,c_374]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : CSR099+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.38  % Computer : n013.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 00:53:36 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38  % Process 3904143 was started by sandbox2 on n013,
% 0.11/0.38  % Sun Sep 27 00:53:36 2026
% 0.11/0.38  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.23/0.52  
% 0.23/0.52  % SInE (scan): 69 to sos (tol 1.5x), 19 to usable (tol 2.0x), 7132 zapped, of 7220 axioms (depth 3).
% 0.23/0.52  
% 0.23/0.52  % From the command line: assign(max_seconds, 300).
% 0.23/0.52  
% 0.23/0.52  % SZS status Theorem for theBenchmark
% 0.23/0.52  
% 0.23/0.52  % Proof 1 at 0.04 (+ 0.02) seconds.
% 0.23/0.52  % Length of proof is 12.
% 0.23/0.52  % Level of proof is 3.
% 0.23/0.52  % Maximum clause weight is 120.000.
% 0.23/0.52  % Given clauses 22.
% 0.23/0.52  
% 0.23/0.52  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------