↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 24.29s 3.68s
% Output   : Proof 24.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   67 (  10 equ)
%            Maximal formula atoms :   15 (   6 avg)
%            Number of connectives :   80 (  24   ~;  20   |;  28   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   8 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   :   16 (   0 sgn  10   !;   6   ?)

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

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

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

cnf(c197,plain,
    segmentP(sk50,sk49),
    inference(cnf_transformation,[status(esa)],[f95_sk]) ).

cnf(p204,plain,
    segmentP(sk48,sk49),
    inference(superposition,[status(thm)],[c194,c197]) ).

cnf(p206,plain,
    segmentP(sk48,sk47),
    inference(superposition,[status(thm)],[c195,p204]) ).

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

cnf(p209,plain,
    $false,
    inference(resolution,[status(thm)],[p206,c200]) ).

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