↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWC255+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 : n015.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:48 PM UTC 2026

% Result   : Theorem 23.61s 3.82s
% Output   : Proof 23.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   8 unt;   0 def)
%            Number of atoms       :   64 (  10 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :   68 (  22   ~;  18   |;  20   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   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   :   12 (   0 sgn   8   !;   4   ?)

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

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

fof(f95_sk,plain,
    ( ( ( ~ neq(sk50,nil)
        & neq(sk48,nil) )
      | ( ~ singletonP(sk47)
        & singletonP(sk49)
        & neq(sk48,nil) ) )
    & sk47 = sk49
    & sk48 = sk50
    & ssList(sk50)
    & ssList(sk49)
    & ssList(sk48)
    & ssList(sk47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50])],[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,
    ( ~ neq(sk50,nil)
    | singletonP(sk49) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p342,plain,
    ( ~ neq(sk48,nil)
    | singletonP(sk49) ),
    inference(superposition,[status(thm)],[c194,c199]) ).

cnf(c198,plain,
    ( neq(sk48,nil)
    | singletonP(sk49) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p362,plain,
    ( singletonP(sk49)
    | singletonP(sk49) ),
    inference(resolution,[status(thm)],[p342,c198]) ).

cnf(p363,plain,
    singletonP(sk49),
    inference(factoring,[status(thm)],[p362]) ).

cnf(p378,plain,
    singletonP(sk47),
    inference(superposition,[status(thm)],[c195,p363]) ).

cnf(c201,plain,
    ( ~ neq(sk50,nil)
    | ~ singletonP(sk47) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p381,plain,
    ~ neq(sk50,nil),
    inference(resolution,[status(thm)],[p378,c201]) ).

cnf(p393,plain,
    ~ neq(sk48,nil),
    inference(superposition,[status(thm)],[c194,p381]) ).

cnf(c200,plain,
    ( neq(sk48,nil)
    | ~ singletonP(sk47) ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p380,plain,
    neq(sk48,nil),
    inference(resolution,[status(thm)],[p378,c200]) ).

cnf(p400,plain,
    $false,
    inference(resolution,[status(thm)],[p393,p380]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC255+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 : n015.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:18:10 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 23.61/3.82  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 23.61/3.82  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------