↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET027+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n012.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 : Fri Sep 25 02:41:35 PM UTC 2026

% Result   : Theorem 25.52s 4.06s
% Output   : Proof 25.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   44 (  15   ~;  15   |;  10   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  15   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,axiom,
    ! [X,Y] :
      ( subclass(X,Y)
    <=> ! [U] :
          ( member(U,X)
         => member(U,Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_defn) ).

fof(f0_nnf,plain,
    ! [X,Y] :
      ( ( ? [U] :
            ( ~ member(U,Y)
            & member(U,X) )
        | subclass(X,Y) )
      & ( ! [U] :
            ( member(U,Y)
            | ~ member(U,X) )
        | ~ subclass(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y,U] :
      ( ( ( ~ member(sk0(X,Y),Y)
          & member(sk0(X,Y),X) )
        | subclass(X,Y) )
      & ( member(U,Y)
        | ~ member(U,X)
        | ~ subclass(X,Y) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).

cnf(c2,plain,
    ( ~ member(sk0(X0,X1),X1)
    | subclass(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(c1,plain,
    ( member(sk0(X0,X1),X0)
    | subclass(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

fof(f43,conjecture,
    ! [X,Y,Z] :
      ( ( subclass(Y,Z)
        & subclass(X,Y) )
     => subclass(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).

fof(f43_neg,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( ( subclass(Y,Z)
          & subclass(X,Y) )
       => subclass(X,Z) ),
    inference(negated_conjecture,[status(cth)],[f43]) ).

fof(f43_nnf,plain,
    ? [X,Y,Z] :
      ( ~ subclass(X,Z)
      & subclass(Y,Z)
      & subclass(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f43_neg]) ).

fof(f43_sk,plain,
    ( ~ subclass(sk7,sk9)
    & subclass(sk8,sk9)
    & subclass(sk7,sk8) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk7,sk8,sk9])],[f43_nnf]) ).

cnf(c89,plain,
    subclass(sk7,sk8),
    inference(cnf_transformation,[status(esa)],[f43_sk]) ).

cnf(c0,plain,
    ( member(X2,X1)
    | ~ member(X2,X0)
    | ~ subclass(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p93,plain,
    ( member(X0,sk8)
    | ~ member(X0,sk7) ),
    inference(resolution,[status(thm)],[c89,c0]) ).

cnf(p96,plain,
    ( member(sk0(sk7,X0),sk8)
    | subclass(sk7,X0) ),
    inference(resolution,[status(thm)],[c1,p93]) ).

cnf(c90,plain,
    subclass(sk8,sk9),
    inference(cnf_transformation,[status(esa)],[f43_sk]) ).

cnf(p94,plain,
    ( member(X0,sk9)
    | ~ member(X0,sk8) ),
    inference(resolution,[status(thm)],[c90,c0]) ).

cnf(p98,plain,
    ( member(sk0(sk7,X0),sk9)
    | subclass(sk7,X0) ),
    inference(resolution,[status(thm)],[p96,p94]) ).

cnf(p100,plain,
    ( subclass(sk7,sk9)
    | subclass(sk7,sk9) ),
    inference(resolution,[status(thm)],[c2,p98]) ).

cnf(p101,plain,
    subclass(sk7,sk9),
    inference(factoring,[status(thm)],[p100]) ).

cnf(c91,plain,
    ~ subclass(sk7,sk9),
    inference(cnf_transformation,[status(esa)],[f43_sk]) ).

cnf(p102,plain,
    $false,
    inference(resolution,[status(thm)],[p101,c91]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SET027+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.02  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Thu Sep 24 09:16:36 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 25.52/4.06  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.52/4.06  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------