%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWC349+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:40:08 EDT 2023

% Result   : Theorem 0.19s 0.36s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   8 unt;   0 def)
%            Number of atoms       :   50 (  15 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   51 (  16   ~;  10   |;  16   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   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   :   15 (;  11   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f45,axiom,
    ! [U] :
      ( ssList(U)
     => frontsegP(U,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f294,plain,
    ! [U] :
      ( ~ ssList(U)
      | frontsegP(U,nil) ),
    inference(pre_NNF_transformation,[status(esa)],[f45]) ).

fof(f295,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | frontsegP(X0,nil) ),
    inference(cnf_transformation,[status(esa)],[f294]) ).

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

fof(f416,plain,
    ( ssList(sk0_47)
    & ssList(sk0_48)
    & ssList(sk0_49)
    & ssList(sk0_50)
    & nil = sk0_49
    & sk0_48 = sk0_50
    & sk0_47 = sk0_49
    & neq(sk0_48,nil)
    & ~ frontsegP(sk0_48,sk0_47) ),
    inference(skolemization,[status(esa)],[f415]) ).

fof(f418,plain,
    ssList(sk0_48),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f421,plain,
    nil = sk0_49,
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f423,plain,
    sk0_47 = sk0_49,
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f425,plain,
    ~ frontsegP(sk0_48,sk0_47),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f458,plain,
    sk0_47 = nil,
    inference(forward_demodulation,[status(thm)],[f421,f423]) ).

fof(f460,plain,
    ~ frontsegP(sk0_48,nil),
    inference(forward_demodulation,[status(thm)],[f458,f425]) ).

fof(f461,plain,
    ~ ssList(sk0_48),
    inference(resolution,[status(thm)],[f295,f460]) ).

fof(f462,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f461,f418]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC349+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n031.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue May 30 11:47:52 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % Drodi V3.5.1
% 0.19/0.36  % Refutation found
% 0.19/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.37  % Elapsed time: 0.029364 seconds
% 0.19/0.37  % CPU time: 0.044108 seconds
% 0.19/0.37  % Memory used: 16.050 MB
%------------------------------------------------------------------------------