↑ Up

FindProof---0.1.THM-Prf.s

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

% 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 : Fri Sep 25 03:05:03 PM UTC 2026

% Result   : Theorem 21.04s 3.64s
% Output   : Proof 21.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   27 (  10 unt;   0 def)
%            Number of atoms       :  112 (  10 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  128 (  43   ~;  41   |;  34   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   21 (   0 sgn  12   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f95,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( ( duplicatefreeP(U)
                      & ! [Z] :
                          ( ssItem(Z)
                         => ( ( memberP(U,Z)
                              & memberP(V,Z) )
                            | ( ~ memberP(U,Z)
                              & ~ memberP(V,Z) ) ) ) )
                    | ? [Y] :
                        ( ( ( memberP(X,Y)
                            & ~ memberP(W,Y) )
                          | ( memberP(W,Y)
                            & ~ memberP(X,Y) ) )
                        & ssItem(Y) )
                    | ~ duplicatefreeP(W)
                    | U != W
                    | V != X ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f95_neg,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( ( duplicatefreeP(U)
                        & ! [Z] :
                            ( ssItem(Z)
                           => ( ( memberP(U,Z)
                                & memberP(V,Z) )
                              | ( ~ memberP(U,Z)
                                & ~ memberP(V,Z) ) ) ) )
                      | ? [Y] :
                          ( ( ( memberP(X,Y)
                              & ~ memberP(W,Y) )
                            | ( memberP(W,Y)
                              & ~ memberP(X,Y) ) )
                          & ssItem(Y) )
                      | ~ duplicatefreeP(W)
                      | U != W
                      | V != X ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f95]) ).

fof(f95_nnf,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ( ~ duplicatefreeP(U)
                    | ? [Z] :
                        ( ( ~ memberP(U,Z)
                          | ~ memberP(V,Z) )
                        & ( memberP(U,Z)
                          | memberP(V,Z) )
                        & ssItem(Z) ) )
                  & ! [Y] :
                      ( ( ( ~ memberP(X,Y)
                          | memberP(W,Y) )
                        & ( ~ memberP(W,Y)
                          | memberP(X,Y) ) )
                      | ~ ssItem(Y) )
                  & duplicatefreeP(W)
                  & U = W
                  & V = X
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f95_neg]) ).

fof(f95_sk,plain,
    ! [Y] :
      ( ( ~ duplicatefreeP(sk47)
        | ( ( ~ memberP(sk47,sk51)
            | ~ memberP(sk48,sk51) )
          & ( memberP(sk47,sk51)
            | memberP(sk48,sk51) )
          & ssItem(sk51) ) )
      & ( ( ( ~ memberP(sk50,Y)
            | memberP(sk49,Y) )
          & ( ~ memberP(sk49,Y)
            | memberP(sk50,Y) ) )
        | ~ ssItem(Y) )
      & duplicatefreeP(sk49)
      & sk47 = sk49
      & sk48 = sk50
      & ssList(sk50)
      & ssList(sk49)
      & ssList(sk48)
      & ssList(sk47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50,sk51])],[f95_nnf]) ).

cnf(c194,plain,
    sk48 = sk50,
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(c195,plain,
    sk47 = sk49,
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(c199,plain,
    ( ~ duplicatefreeP(sk47)
    | ssItem(sk51) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(c196,plain,
    duplicatefreeP(sk49),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p207,plain,
    duplicatefreeP(sk47),
    inference(superposition,[status(thm)],[c195,c196]) ).

cnf(p221,plain,
    ssItem(sk51),
    inference(resolution,[status(thm)],[c199,p207]) ).

cnf(c198,plain,
    ( ~ memberP(sk50,X4)
    | memberP(sk49,X4)
    | ~ ssItem(X4) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p222,plain,
    ( ~ memberP(sk50,sk51)
    | memberP(sk49,sk51) ),
    inference(resolution,[status(thm)],[p221,c198]) ).

cnf(p231,plain,
    ( ~ memberP(sk48,sk51)
    | memberP(sk49,sk51) ),
    inference(superposition,[status(thm)],[c194,p222]) ).

cnf(c200,plain,
    ( ~ duplicatefreeP(sk47)
    | memberP(sk47,sk51)
    | memberP(sk48,sk51) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p216,plain,
    ( memberP(sk47,sk51)
    | memberP(sk48,sk51) ),
    inference(resolution,[status(thm)],[c200,p207]) ).

cnf(p237,plain,
    ( memberP(sk47,sk51)
    | memberP(sk49,sk51) ),
    inference(resolution,[status(thm)],[p231,p216]) ).

cnf(p238,plain,
    ( memberP(sk47,sk51)
    | memberP(sk47,sk51) ),
    inference(superposition,[status(thm)],[c195,p237]) ).

cnf(p240,plain,
    memberP(sk47,sk51),
    inference(factoring,[status(thm)],[p238]) ).

cnf(c197,plain,
    ( ~ memberP(sk49,X4)
    | memberP(sk50,X4)
    | ~ ssItem(X4) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p225,plain,
    ( ~ memberP(sk49,sk51)
    | memberP(sk50,sk51) ),
    inference(resolution,[status(thm)],[p221,c197]) ).

cnf(p232,plain,
    ( ~ memberP(sk47,sk51)
    | memberP(sk50,sk51) ),
    inference(superposition,[status(thm)],[c195,p225]) ).

cnf(p250,plain,
    memberP(sk50,sk51),
    inference(resolution,[status(thm)],[p240,p232]) ).

cnf(p251,plain,
    memberP(sk48,sk51),
    inference(superposition,[status(thm)],[c194,p250]) ).

cnf(c201,plain,
    ( ~ duplicatefreeP(sk47)
    | ~ memberP(sk47,sk51)
    | ~ memberP(sk48,sk51) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p253,plain,
    ( ~ duplicatefreeP(sk47)
    | ~ memberP(sk47,sk51) ),
    inference(resolution,[status(thm)],[p251,c201]) ).

cnf(p258,plain,
    ~ duplicatefreeP(sk47),
    inference(resolution,[status(thm)],[p253,p240]) ).

cnf(p259,plain,
    $false,
    inference(resolution,[status(thm)],[p258,p207]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC001+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Thu Sep 24 15:56:54 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 21.04/3.64  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.04/3.64  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------