↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 46.79s 12.22s
% Output   : Proof 46.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   28 (  11 unt;   0 def)
%            Number of atoms       :   93 (  48 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   95 (  30   ~;  30   |;  24   &)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  14   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f45,axiom,
    ! [U] :
      ( ssList(U)
     => ( frontsegP(nil,U)
      <=> nil = U ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).

fof(f45_nnf,plain,
    ! [U] :
      ( ( ( nil != U
          | frontsegP(nil,U) )
        & ( nil = U
          | ~ frontsegP(nil,U) ) )
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f45]) ).

fof(f45_sk,plain,
    ! [U] :
      ( ( ( nil != U
          | frontsegP(nil,U) )
        & ( nil = U
          | ~ frontsegP(nil,U) ) )
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f45_nnf]) ).

cnf(c123,plain,
    ( nil = X0
    | ~ frontsegP(nil,X0)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f45_sk]) ).

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

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

fof(f95_sk,plain,
    ( ( ( frontsegP(sk50,sk49)
        & neq(sk49,nil) )
      | ( nil = sk49
        & nil = sk50 ) )
    & nil != sk47
    & sk47 = sk49
    & sk48 = sk50
    & nil = sk48
    & ssList(sk50)
    & ssList(sk49)
    & ssList(sk48)
    & ssList(sk47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50])],[f95_nnf]) ).

cnf(c190,plain,
    ssList(sk47),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p12545,plain,
    ( nil = sk47
    | ~ frontsegP(nil,sk47) ),
    inference(resolution,[status(thm)],[c123,c190]) ).

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

fof(f27,axiom,
    ! [U] :
      ( ssList(U)
     => app(nil,U) = U ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).

fof(f27_nnf,plain,
    ! [U] :
      ( app(nil,U) = U
      | ~ ssList(U) ),
    inference(nnf_transformation,[status(thm)],[f27]) ).

fof(f27_sk,plain,
    ! [U] :
      ( app(nil,U) = U
      | ~ ssList(U) ),
    inference(skolemisation,[status(esa)],[f27_nnf]) ).

cnf(c97,plain,
    ( app(nil,X0) = X0
    | ~ ssList(X0) ),
    inference(cnf_transformation,[status(esa)],[f27_sk]) ).

cnf(c192,plain,
    ssList(sk49),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p11329,plain,
    app(nil,sk49) = sk49,
    inference(resolution,[status(thm)],[c97,c192]) ).

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

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

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

cnf(p212,plain,
    nil = sk50,
    inference(superposition,[status(thm)],[c194,c195]) ).

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

cnf(p1036,plain,
    ( frontsegP(nil,sk49)
    | nil = sk49 ),
    inference(superposition,[status(thm)],[p212,c201]) ).

cnf(p11434,plain,
    ( frontsegP(nil,sk47)
    | nil = sk47 ),
    inference(demodulation,[status(thm)],[p11431,p1036]) ).

cnf(p14325,plain,
    ( nil = sk47
    | nil = sk47 ),
    inference(resolution,[status(thm)],[p12545,p11434]) ).

cnf(p14563,plain,
    nil = sk47,
    inference(factoring,[status(thm)],[p14325]) ).

cnf(c197,plain,
    nil != sk47,
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p14564,plain,
    $false,
    inference(resolution,[status(thm)],[p14563,c197]) ).

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