↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWC367+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 : n018.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:57 PM UTC 2026

% Result   : Theorem 0.09s 5.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (  14 unt;   1 def)
%            Number of atoms       :   94 (  32 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :   98 (  32   ~;  24   |;  32   &)
%                                         (   1 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 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   :   31 (  23   !;   8   ?)

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

fof(f49,axiom,
    ! [U] :
      ( ssList(U)
     => rearsegP(U,U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f304,plain,
    ! [U] :
      ( rearsegP(U,U)
      | ~ ssList(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f49]) ).

fof(f305,plain,
    ! [X0] :
      ( rearsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f304]) ).

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

fof(f416,definition,
    ! [W,X] :
      ( sP0_prd(X,W)
    <=> ( nil = W
        & nil = X ) ),
    introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).

fof(f417,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ( ( rearsegP(X,W)
                      & neq(W,nil) )
                    | sP0_prd(X,W) )
                  & ~ rearsegP(V,U)
                  & U = W
                  & V = X
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(formula_renaming,[status(thm)],[f415,f416]) ).

fof(f418,plain,
    ( ( ( rearsegP(sK50_skl,sK49_skl)
        & neq(sK49_skl,nil) )
      | sP0_prd(sK50_skl,sK49_skl) )
    & ~ rearsegP(sK48_skl,sK47_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)],[f417]) ).

fof(f423,plain,
    sK48_skl = sK50_skl,
    inference(cnf_transformation,[status(thm)],[f418]) ).

fof(f424,plain,
    sK47_skl = sK49_skl,
    inference(cnf_transformation,[status(thm)],[f418]) ).

fof(f425,plain,
    ~ rearsegP(sK48_skl,sK47_skl),
    inference(cnf_transformation,[status(thm)],[f418]) ).

fof(f427,plain,
    ( rearsegP(sK50_skl,sK49_skl)
    | sP0_prd(sK50_skl,sK49_skl) ),
    inference(cnf_transformation,[status(thm)],[f418]) ).

fof(f428,plain,
    ! [W,X] :
      ( ( nil != W
        | nil != X
        | sP0_prd(X,W) )
      & ( ( nil = W
          & nil = X )
        | ~ sP0_prd(X,W) ) ),
    inference(NNF_transformation,[status(thm)],[f416]) ).

fof(f429,plain,
    ( ! [W,X] :
        ( nil != W
        | nil != X
        | sP0_prd(X,W) )
    & ! [W,X] :
        ( ( nil = W
          & nil = X )
        | ~ sP0_prd(X,W) ) ),
    inference(miniscoping,[status(thm)],[f428]) ).

fof(f430,plain,
    ! [X0,X1] :
      ( nil = X0
      | ~ sP0_prd(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f429]) ).

fof(f431,plain,
    ! [X0,X1] :
      ( nil = X1
      | ~ sP0_prd(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f429]) ).

fof(f466,plain,
    ~ rearsegP(sK50_skl,sK47_skl),
    inference(forward_demodulation,[status(thm)],[f423,f425]) ).

fof(f467,plain,
    ~ rearsegP(sK50_skl,sK49_skl),
    inference(forward_demodulation,[status(thm)],[f424,f466]) ).

fof(f473,plain,
    sP0_prd(sK50_skl,sK49_skl),
    inference(forward_subsumption_resolution,[status(thm)],[f427,f467]) ).

fof(f474,plain,
    nil = sK49_skl,
    inference(resolution,[status(thm)],[f473,f431]) ).

fof(f475,plain,
    nil = sK50_skl,
    inference(resolution,[status(thm)],[f473,f430]) ).

fof(f477,plain,
    ~ rearsegP(sK50_skl,nil),
    inference(backward_demodulation,[status(thm)],[f474,f467]) ).

fof(f483,plain,
    ~ rearsegP(nil,nil),
    inference(forward_demodulation,[status(thm)],[f475,f477]) ).

fof(f487,plain,
    ~ ssList(nil),
    inference(resolution,[status(thm)],[f305,f483]) ).

fof(f488,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f487,f223]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC367+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36  % Computer : n018.cluster.edu
% 0.09/5.36  % Model    : x86_64 x86_64
% 0.09/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36  % Memory   : 8046.5625MB
% 0.09/5.36  % OS       : Linux 6.8.0-71-generic
% 0.09/5.36  % CPULimit : 300
% 0.09/5.36  % WCLimit  : 300
% 0.09/5.36  % DateTime : Mon Sep 21 08:21:04 UTC 2026
% 0.09/5.36  % CPUTime  : 
% 0.09/5.38  % Drodi V4.1.1
% 0.09/5.39  % Refutation found
% 0.09/5.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/5.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.42  % Elapsed time: 0.052882 seconds
% 0.14/5.42  % CPU time: 0.138874 seconds
% 0.14/5.42  % Total memory used: 75.845 MB
% 0.14/5.42  % Net memory used: 75.735 MB
%------------------------------------------------------------------------------