↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n006.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:39:56 PM UTC 2026

% Result   : Theorem 0.10s 0.39s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (   4 unt;   4 def)
%            Number of atoms       :  150 (  34 equ)
%            Maximal formula atoms :   13 (   4 avg)
%            Number of connectives :  175 (  60   ~;  55   |;  46   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   4 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-4 aty)
%            Number of variables   :   85 (  69   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( ( ( neq(X,nil)
                        | ~ neq(V,nil) )
                      & ( ! [Z] :
                            ( ssItem(Z)
                           => app(W,cons(Z,nil)) != X )
                        | ? [Y] :
                            ( app(U,cons(Y,nil)) = V
                            & ssItem(Y) )
                        | ~ neq(V,nil) ) )
                    | U != W
                    | V != X ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f97,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( ( ( neq(X,nil)
                          | ~ neq(V,nil) )
                        & ( ! [Z] :
                              ( ssItem(Z)
                             => app(W,cons(Z,nil)) != X )
                          | ? [Y] :
                              ( app(U,cons(Y,nil)) = V
                              & ssItem(Y) )
                          | ~ neq(V,nil) ) )
                      | U != W
                      | V != X ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

fof(f416,definition,
    ! [U,V,W,X] :
      ( sP0_prd(X,W,V,U)
    <=> ( ? [Z] :
            ( app(W,cons(Z,nil)) = X
            & ssItem(Z) )
        & ! [Y] :
            ( app(U,cons(Y,nil)) != V
            | ~ ssItem(Y) )
        & neq(V,nil) ) ),
    introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).

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

fof(f418,plain,
    ( ( ( ~ neq(sK50_skl,nil)
        & neq(sK48_skl,nil) )
      | sP0_prd(sK50_skl,sK49_skl,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,
    ( neq(sK48_skl,nil)
    | sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
    inference(cnf_transformation,[status(thm)],[f418]) ).

fof(f426,plain,
    ( ~ neq(sK50_skl,nil)
    | sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
    inference(cnf_transformation,[status(thm)],[f418]) ).

fof(f427,plain,
    ! [U,V,W,X] :
      ( ( ! [Z] :
            ( app(W,cons(Z,nil)) != X
            | ~ ssItem(Z) )
        | ? [Y] :
            ( app(U,cons(Y,nil)) = V
            & ssItem(Y) )
        | ~ neq(V,nil)
        | sP0_prd(X,W,V,U) )
      & ( ( ? [Z] :
              ( app(W,cons(Z,nil)) = X
              & ssItem(Z) )
          & ! [Y] :
              ( app(U,cons(Y,nil)) != V
              | ~ ssItem(Y) )
          & neq(V,nil) )
        | ~ sP0_prd(X,W,V,U) ) ),
    inference(NNF_transformation,[status(thm)],[f416]) ).

fof(f428,plain,
    ( ! [U,V,W,X] :
        ( ! [Z] :
            ( app(W,cons(Z,nil)) != X
            | ~ ssItem(Z) )
        | ? [Y] :
            ( app(U,cons(Y,nil)) = V
            & ssItem(Y) )
        | ~ neq(V,nil)
        | sP0_prd(X,W,V,U) )
    & ! [U,V,W,X] :
        ( ( ? [Z] :
              ( app(W,cons(Z,nil)) = X
              & ssItem(Z) )
          & ! [Y] :
              ( app(U,cons(Y,nil)) != V
              | ~ ssItem(Y) )
          & neq(V,nil) )
        | ~ sP0_prd(X,W,V,U) ) ),
    inference(miniscoping,[status(thm)],[f427]) ).

fof(f429,plain,
    ( ! [U,V,W,X] :
        ( ! [Z] :
            ( app(W,cons(Z,nil)) != X
            | ~ ssItem(Z) )
        | ( app(U,cons(sK52_skl(X,W,V,U),nil)) = V
          & ssItem(sK52_skl(X,W,V,U)) )
        | ~ neq(V,nil)
        | sP0_prd(X,W,V,U) )
    & ! [U,V,W,X] :
        ( ( app(W,cons(sK51_skl(X,W,V,U),nil)) = X
          & ssItem(sK51_skl(X,W,V,U))
          & ! [Y] :
              ( app(U,cons(Y,nil)) != V
              | ~ ssItem(Y) )
          & neq(V,nil) )
        | ~ sP0_prd(X,W,V,U) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK51_skl,sK52_skl]),skolemize(Z,sK51_skl(X,W,V,U)),skolemize(Y,sK52_skl(X,W,V,U))],[f428]) ).

fof(f431,plain,
    ! [X0,X1,X2,X3,X4] :
      ( app(X3,cons(X4,nil)) != X2
      | ~ ssItem(X4)
      | ~ sP0_prd(X0,X1,X2,X3) ),
    inference(cnf_transformation,[status(thm)],[f429]) ).

fof(f432,plain,
    ! [X0,X1,X2,X3] :
      ( ssItem(sK51_skl(X0,X1,X2,X3))
      | ~ sP0_prd(X0,X1,X2,X3) ),
    inference(cnf_transformation,[status(thm)],[f429]) ).

fof(f433,plain,
    ! [X0,X1,X2,X3] :
      ( app(X1,cons(sK51_skl(X0,X1,X2,X3),nil)) = X0
      | ~ sP0_prd(X0,X1,X2,X3) ),
    inference(cnf_transformation,[status(thm)],[f429]) ).

fof(f436,definition,
    ( sQ0_spl
  <=> sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f437,plain,
    ( ~ sQ0_spl
    | sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
    inference(component_clause,[status(thm)],[f436]) ).

fof(f439,definition,
    ( sQ1_spl
  <=> neq(sK48_skl,nil) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f440,plain,
    ( ~ sQ1_spl
    | neq(sK48_skl,nil) ),
    inference(component_clause,[status(thm)],[f439]) ).

fof(f442,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f425,f436,f439]) ).

fof(f443,definition,
    ( sQ2_spl
  <=> neq(sK50_skl,nil) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f445,plain,
    ( sQ2_spl
    | ~ neq(sK50_skl,nil) ),
    inference(component_clause,[status(thm)],[f443]) ).

fof(f446,plain,
    ( ~ sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f426,f436,f443]) ).

fof(f469,plain,
    ( ~ sQ0_spl
    | sP0_prd(sK48_skl,sK49_skl,sK48_skl,sK47_skl) ),
    inference(forward_demodulation,[status(thm)],[f423,f437]) ).

fof(f470,plain,
    ( ~ sQ0_spl
    | sP0_prd(sK48_skl,sK47_skl,sK48_skl,sK47_skl) ),
    inference(forward_demodulation,[status(thm)],[f424,f469]) ).

fof(f536,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ~ ssItem(sK51_skl(X0,X1,X2,X3))
      | ~ sP0_prd(X4,X5,X0,X1)
      | ~ sP0_prd(X0,X1,X2,X3) ),
    inference(resolution,[status(thm)],[f433,f431]) ).

fof(f541,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ~ sP0_prd(X4,X5,X0,X1)
      | ~ sP0_prd(X0,X1,X2,X3) ),
    inference(forward_subsumption_resolution,[status(thm)],[f536,f432]) ).

fof(f560,plain,
    ! [X0,X1] :
      ( ~ sQ0_spl
      | ~ sP0_prd(sK48_skl,sK47_skl,X0,X1) ),
    inference(resolution,[status(thm)],[f541,f470]) ).

fof(f561,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f470,f560]) ).

fof(f562,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f561]) ).

fof(f563,plain,
    ( sQ2_spl
    | ~ neq(sK48_skl,nil) ),
    inference(forward_demodulation,[status(thm)],[f423,f445]) ).

fof(f587,plain,
    ( sQ2_spl
    | ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f563,f440]) ).

fof(f588,plain,
    ( sQ2_spl
    | ~ sQ1_spl ),
    inference(contradiction_clause,[status(thm)],[f587]) ).

fof(f589,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f442,f446,f562,f588]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC097+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n006.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 07:55:29 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.39  % Refutation found
% 0.10/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.42  % Elapsed time: 0.050815 seconds
% 0.10/0.42  % CPU time: 0.161648 seconds
% 0.10/0.42  % Total memory used: 110.814 MB
% 0.10/0.42  % Net memory used: 110.645 MB
%------------------------------------------------------------------------------