↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWC116+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n016.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 : Thu Sep 24 02:40:02 PM UTC 2026

% Result   : Theorem 0.22s 5.55s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   33 (  10 unt;   0 def)
%            Number of atoms       :  119 (  44 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  141 (  55   ~;  45   |;  29   &)
%                                         (   2 <=>;  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   :   20 (  16   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ( neq(U,V)
          <=> U != V ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f96,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( ( ( ~ segmentP(X,W)
                        | ~ neq(W,nil) )
                      & neq(X,nil) )
                    | ( segmentP(V,U)
                      & neq(U,nil) )
                    | ( nil = U
                      & nil = V )
                    | ( nil = X
                      & nil != W )
                    | U != W
                    | V != X ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f97,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( ( ( ~ segmentP(X,W)
                          | ~ neq(W,nil) )
                        & neq(X,nil) )
                      | ( segmentP(V,U)
                        & neq(U,nil) )
                      | ( nil = U
                        & nil = V )
                      | ( nil = X
                        & nil != W )
                      | U != W
                      | V != X ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f217,plain,
    ! [U] :
      ( ! [V] :
          ( ( neq(U,V)
          <=> U != V )
          | ~ ssList(V) )
      | ~ ssList(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f15]) ).

fof(f218,plain,
    ! [U] :
      ( ! [V] :
          ( ( ( U = V
              | neq(U,V) )
            & ( U != V
              | ~ neq(U,V) ) )
          | ~ ssList(V) )
      | ~ ssList(U) ),
    inference(NNF_transformation,[status(thm)],[f217]) ).

fof(f220,plain,
    ! [X0,X1] :
      ( X0 = X1
      | neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f218]) ).

fof(f223,plain,
    ssList(nil),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f415,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ( ( segmentP(X,W)
                      & neq(W,nil) )
                    | ~ neq(X,nil) )
                  & ( ~ segmentP(V,U)
                    | ~ neq(U,nil) )
                  & ( nil != U
                    | nil != V )
                  & ( nil != X
                    | nil = W )
                  & U = W
                  & V = X
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f97]) ).

fof(f416,plain,
    ( ( ( segmentP(sK50_skl,sK49_skl)
        & neq(sK49_skl,nil) )
      | ~ neq(sK50_skl,nil) )
    & ( ~ segmentP(sK48_skl,sK47_skl)
      | ~ neq(sK47_skl,nil) )
    & ( nil != sK47_skl
      | nil != sK48_skl )
    & ( nil != sK50_skl
      | nil = sK49_skl )
    & sK47_skl = sK49_skl
    & sK48_skl = sK50_skl
    & ssList(sK50_skl)
    & ssList(sK49_skl)
    & ssList(sK48_skl)
    & ssList(sK47_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl,sK49_skl,sK50_skl]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl)],[f415]) ).

fof(f418,plain,
    ssList(sK48_skl),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f421,plain,
    sK48_skl = sK50_skl,
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f422,plain,
    sK47_skl = sK49_skl,
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f423,plain,
    ( nil != sK50_skl
    | nil = sK49_skl ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f424,plain,
    ( nil != sK47_skl
    | nil != sK48_skl ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f425,plain,
    ( ~ segmentP(sK48_skl,sK47_skl)
    | ~ neq(sK47_skl,nil) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f426,plain,
    ( neq(sK49_skl,nil)
    | ~ neq(sK50_skl,nil) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f427,plain,
    ( segmentP(sK50_skl,sK49_skl)
    | ~ neq(sK50_skl,nil) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f464,plain,
    ( nil != sK50_skl
    | nil = sK47_skl ),
    inference(forward_demodulation,[status(thm)],[f422,f423]) ).

fof(f465,plain,
    ( nil != sK48_skl
    | nil = sK47_skl ),
    inference(forward_demodulation,[status(thm)],[f421,f464]) ).

fof(f466,plain,
    nil != sK48_skl,
    inference(forward_subsumption_resolution,[status(thm)],[f424,f465]) ).

fof(f470,plain,
    ( neq(sK49_skl,nil)
    | ~ neq(sK48_skl,nil) ),
    inference(forward_demodulation,[status(thm)],[f421,f426]) ).

fof(f471,plain,
    ( neq(sK47_skl,nil)
    | ~ neq(sK48_skl,nil) ),
    inference(forward_demodulation,[status(thm)],[f422,f470]) ).

fof(f472,plain,
    ( segmentP(sK50_skl,sK49_skl)
    | ~ neq(sK48_skl,nil) ),
    inference(forward_demodulation,[status(thm)],[f421,f427]) ).

fof(f473,plain,
    ( segmentP(sK48_skl,sK49_skl)
    | ~ neq(sK48_skl,nil) ),
    inference(forward_demodulation,[status(thm)],[f421,f472]) ).

fof(f474,plain,
    ( segmentP(sK48_skl,sK47_skl)
    | ~ neq(sK48_skl,nil) ),
    inference(forward_demodulation,[status(thm)],[f422,f473]) ).

fof(f475,plain,
    ( ~ neq(sK47_skl,nil)
    | ~ neq(sK48_skl,nil) ),
    inference(resolution,[status(thm)],[f474,f425]) ).

fof(f476,plain,
    ~ neq(sK48_skl,nil),
    inference(forward_subsumption_resolution,[status(thm)],[f475,f471]) ).

fof(f477,plain,
    ( sK48_skl = nil
    | ~ ssList(nil)
    | ~ ssList(sK48_skl) ),
    inference(resolution,[status(thm)],[f476,f220]) ).

fof(f478,plain,
    ( sK48_skl = nil
    | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[status(thm)],[f477,f418]) ).

fof(f488,plain,
    sK48_skl != sK48_skl,
    inference(backward_demodulation,[status(thm)],[f493,f466]) ).

fof(f493,plain,
    sK48_skl = nil,
    inference(forward_subsumption_resolution,[status(thm)],[f478,f223]) ).

fof(f494,plain,
    $false,
    inference(trivial_equality_resolution,[status(thm)],[f488]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC116+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/5.50  % Computer : n016.cluster.edu
% 0.19/5.50  % Model    : x86_64 x86_64
% 0.19/5.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.50  % Memory   : 8046.5625MB
% 0.19/5.50  % OS       : Linux 6.8.0-71-generic
% 0.19/5.50  % CPULimit : 300
% 0.22/5.50  % WCLimit  : 300
% 0.22/5.50  % DateTime : Mon Sep 21 08:01:44 UTC 2026
% 0.22/5.50  % CPUTime  : 
% 0.22/5.53  % Drodi V4.1.1
% 0.22/5.55  % Refutation found
% 0.22/5.55  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.22/5.55  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/5.65  % Elapsed time: 0.143204 seconds
% 0.23/5.65  % CPU time: 0.121033 seconds
% 0.23/5.65  % Total memory used: 6.976 MB
% 0.23/5.65  % Net memory used: 6.966 MB
%------------------------------------------------------------------------------