↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWC375+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 : n026.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:06:10 PM UTC 2026

% Result   : Theorem 25.15s 3.65s
% Output   : Proof 25.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   65 (  18 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   68 (  20   ~;  16   |;  22   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   15 (   0 sgn  10   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f95,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( ! [Y] :
                        ( ssItem(Y)
                       => ( ( memberP(U,Y)
                            & memberP(V,Y) )
                          | ( ~ memberP(U,Y)
                            & ~ memberP(V,Y) ) ) )
                    | X != 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)
                   => ( ! [Y] :
                          ( ssItem(Y)
                         => ( ( memberP(U,Y)
                              & memberP(V,Y) )
                            | ( ~ memberP(U,Y)
                              & ~ memberP(V,Y) ) ) )
                      | X != W
                      | U != W
                      | V != X ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f95]) ).

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

fof(f95_sk,plain,
    ( ( ~ memberP(sk47,sk51)
      | ~ memberP(sk48,sk51) )
    & ( memberP(sk47,sk51)
      | memberP(sk48,sk51) )
    & ssItem(sk51)
    & sk50 = 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(c195,plain,
    sk47 = sk49,
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

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

cnf(p201,plain,
    sk49 = sk47,
    inference(superposition,[status(thm)],[c195,c196]) ).

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

cnf(p200,plain,
    sk48 = sk49,
    inference(superposition,[status(thm)],[c196,c194]) ).

cnf(p203,plain,
    sk48 = sk47,
    inference(demodulation,[status(thm)],[p201,p200]) ).

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

cnf(p205,plain,
    ( ~ memberP(sk47,sk51)
    | ~ memberP(sk47,sk51) ),
    inference(superposition,[status(thm)],[p203,c199]) ).

cnf(p207,plain,
    ~ memberP(sk47,sk51),
    inference(factoring,[status(thm)],[p205]) ).

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

cnf(p204,plain,
    ( memberP(sk47,sk51)
    | memberP(sk47,sk51) ),
    inference(superposition,[status(thm)],[p203,c198]) ).

cnf(p206,plain,
    memberP(sk47,sk51),
    inference(factoring,[status(thm)],[p204]) ).

cnf(p208,plain,
    $false,
    inference(resolution,[status(thm)],[p207,p206]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC375+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 : n026.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 17:57:56 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 25.15/3.65  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.15/3.65  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------