↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWC358+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 : 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 : Fri Sep 25 03:06:07 PM UTC 2026

% Result   : Theorem 9.85s 3.70s
% Output   : Proof 9.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   29 (  14 unt;   0 def)
%            Number of atoms       :   84 (  29 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   78 (  23   ~;  24   |;  22   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 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   :   16 (   0 sgn  11   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f54,axiom,
    ! [U] :
      ( ssList(U)
     => segmentP(U,U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).

fof(f54_nnf,plain,
    ! [U] :
      ( segmentP(U,U)
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f54]) ).

fof(f54_sk,plain,
    ! [U] :
      ( segmentP(U,U)
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f54_nnf]) ).

cnf(c134,plain,
    ( segmentP(X0,X0)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f54_sk]) ).

fof(f16,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

fof(f16_nnf,plain,
    ssList(nil),
    inference(nnf_transformation,[status(thm)],[f16]) ).

cnf(c83,plain,
    ssList(nil),
    inference(cnf_transformation,[status(esa)],[f16_nnf]) ).

cnf(p239,plain,
    segmentP(nil,nil),
    inference(resolution,[status(thm)],[c134,c83]) ).

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

fof(f95_nnf,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ( ( segmentP(X,W)
                      & neq(W,nil) )
                    | ( nil = W
                      & nil = X ) )
                  & ~ segmentP(V,U)
                  & 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,
    ( ( ( segmentP(sk50,sk49)
        & neq(sk49,nil) )
      | ( nil = sk49
        & nil = sk50 ) )
    & ~ segmentP(sk48,sk47)
    & 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(c195,plain,
    sk47 = sk49,
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

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

cnf(c199,plain,
    ( segmentP(sk50,sk49)
    | nil = sk50 ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p203,plain,
    ( segmentP(sk48,sk49)
    | nil = sk50 ),
    inference(superposition,[status(thm)],[c194,c199]) ).

cnf(p208,plain,
    ( segmentP(sk48,sk47)
    | nil = sk50 ),
    inference(superposition,[status(thm)],[c195,p203]) ).

cnf(c197,plain,
    ~ segmentP(sk48,sk47),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p210,plain,
    nil = sk50,
    inference(resolution,[status(thm)],[p208,c197]) ).

cnf(p211,plain,
    sk48 = nil,
    inference(superposition,[status(thm)],[p210,c194]) ).

cnf(c201,plain,
    ( segmentP(sk50,sk49)
    | nil = sk49 ),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p206,plain,
    ( segmentP(sk48,sk49)
    | nil = sk49 ),
    inference(superposition,[status(thm)],[c194,c201]) ).

cnf(p209,plain,
    ( segmentP(sk48,sk47)
    | nil = sk49 ),
    inference(superposition,[status(thm)],[c195,p206]) ).

cnf(p215,plain,
    ( segmentP(nil,sk47)
    | nil = sk49 ),
    inference(demodulation,[status(thm)],[p211,p209]) ).

cnf(p213,plain,
    ~ segmentP(nil,sk47),
    inference(demodulation,[status(thm)],[p211,c197]) ).

cnf(p216,plain,
    nil = sk49,
    inference(resolution,[status(thm)],[p215,p213]) ).

cnf(p217,plain,
    sk47 = nil,
    inference(superposition,[status(thm)],[p216,c195]) ).

cnf(p218,plain,
    ~ segmentP(nil,nil),
    inference(demodulation,[status(thm)],[p217,p213]) ).

cnf(p244,plain,
    $false,
    inference(resolution,[status(thm)],[p239,p218]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC358+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.02/0.36  % Computer : n013.cluster.edu
% 0.02/0.36  % Model    : x86_64 x86_64
% 0.02/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.36  % Memory   : 8046.5625MB
% 0.02/0.36  % OS       : Linux 6.8.0-71-generic
% 0.02/0.36  % CPULimit : 300
% 0.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Thu Sep 24 17:48:21 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.85/3.70  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.85/3.70  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------