%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWC208+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n031.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 31 12:39:40 EDT 2023

% Result   : Theorem 0.08s 0.27s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (   7 unt;   0 def)
%            Number of atoms       :  105 (  26 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  110 (  36   ~;  31   |;  32   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   24 (;  16   !;   8   ?)

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

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

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

fof(f416,plain,
    ! [W,X] :
      ( pd0_0(X,W)
     => ( nil = X
        & nil = W ) ),
    introduced(predicate_definition,[f415]) ).

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

fof(f418,plain,
    ( ssList(sk0_47)
    & ssList(sk0_48)
    & ssList(sk0_49)
    & ssList(sk0_50)
    & sk0_48 = sk0_50
    & sk0_47 = sk0_49
    & neq(sk0_48,nil)
    & ~ neq(sk0_47,nil)
    & ( pd0_0(sk0_50,sk0_49)
      | ( neq(sk0_49,nil)
        & frontsegP(sk0_50,sk0_49) ) ) ),
    inference(skolemization,[status(esa)],[f417]) ).

fof(f423,plain,
    sk0_48 = sk0_50,
    inference(cnf_transformation,[status(esa)],[f418]) ).

fof(f424,plain,
    sk0_47 = sk0_49,
    inference(cnf_transformation,[status(esa)],[f418]) ).

fof(f425,plain,
    neq(sk0_48,nil),
    inference(cnf_transformation,[status(esa)],[f418]) ).

fof(f426,plain,
    ~ neq(sk0_47,nil),
    inference(cnf_transformation,[status(esa)],[f418]) ).

fof(f427,plain,
    ( pd0_0(sk0_50,sk0_49)
    | neq(sk0_49,nil) ),
    inference(cnf_transformation,[status(esa)],[f418]) ).

fof(f429,plain,
    ! [W,X] :
      ( ~ pd0_0(X,W)
      | ( nil = X
        & nil = W ) ),
    inference(pre_NNF_transformation,[status(esa)],[f416]) ).

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

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

fof(f432,plain,
    ( spl0_0
  <=> pd0_0(sk0_50,sk0_49) ),
    introduced(split_symbol_definition) ).

fof(f433,plain,
    ( pd0_0(sk0_50,sk0_49)
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f432]) ).

fof(f435,plain,
    ( spl0_1
  <=> neq(sk0_49,nil) ),
    introduced(split_symbol_definition) ).

fof(f436,plain,
    ( neq(sk0_49,nil)
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f435]) ).

fof(f438,plain,
    ( spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f427,f432,f435]) ).

fof(f486,plain,
    ( pd0_0(sk0_48,sk0_49)
    | ~ spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f423,f433]) ).

fof(f487,plain,
    ( pd0_0(sk0_48,sk0_47)
    | ~ spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f424,f486]) ).

fof(f488,plain,
    ( nil = sk0_47
    | ~ spl0_0 ),
    inference(resolution,[status(thm)],[f487,f431]) ).

fof(f489,plain,
    ( nil = sk0_48
    | ~ spl0_0 ),
    inference(resolution,[status(thm)],[f487,f430]) ).

fof(f491,plain,
    ( ~ neq(nil,nil)
    | ~ spl0_0 ),
    inference(backward_demodulation,[status(thm)],[f488,f426]) ).

fof(f494,plain,
    ( neq(nil,nil)
    | ~ spl0_0 ),
    inference(backward_demodulation,[status(thm)],[f489,f425]) ).

fof(f503,plain,
    ( $false
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f494,f491]) ).

fof(f504,plain,
    ~ spl0_0,
    inference(contradiction_clause,[status(thm)],[f503]) ).

fof(f509,plain,
    ( neq(sk0_47,nil)
    | ~ spl0_1 ),
    inference(backward_demodulation,[status(thm)],[f424,f436]) ).

fof(f510,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f426,f509]) ).

fof(f511,plain,
    ~ spl0_1,
    inference(contradiction_clause,[status(thm)],[f510]) ).

fof(f512,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f438,f504,f511]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SWC208+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.08  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.26  % Computer : n031.cluster.edu
% 0.08/0.26  % Model    : x86_64 x86_64
% 0.08/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26  % Memory   : 8042.1875MB
% 0.08/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26  % CPULimit : 300
% 0.08/0.26  % WCLimit  : 300
% 0.08/0.26  % DateTime : Tue May 30 11:44:52 EDT 2023
% 0.08/0.26  % CPUTime  : 
% 0.08/0.27  % Drodi V3.5.1
% 0.08/0.27  % Refutation found
% 0.08/0.27  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.27  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.28  % Elapsed time: 0.018457 seconds
% 0.11/0.28  % CPU time: 0.029507 seconds
% 0.11/0.28  % Memory used: 18.119 MB
%------------------------------------------------------------------------------