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

% Computer : n017.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:51 EDT 2023

% Result   : Theorem 0.06s 0.28s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   5 unt;   0 def)
%            Number of atoms       :   61 (   9 equ)
%            Maximal formula atoms :   14 (   6 avg)
%            Number of connectives :   74 (  22   ~;  18   |;  26   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   9 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   16 (;  10   !;   6   ?)

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

fof(f97,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | ~ frontsegP(X,W)
                      | ~ totalorderedP(W)
                      | ? [Y] :
                          ( ssList(Y)
                          & neq(W,Y)
                          & frontsegP(X,Y)
                          & segmentP(Y,W)
                          & totalorderedP(Y) )
                      | totalorderedP(U) ) ) ) ) ),
    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
                  & frontsegP(X,W)
                  & totalorderedP(W)
                  & ! [Y] :
                      ( ~ ssList(Y)
                      | ~ neq(W,Y)
                      | ~ frontsegP(X,Y)
                      | ~ segmentP(Y,W)
                      | ~ totalorderedP(Y) )
                  & ~ totalorderedP(U) ) ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f97]) ).

fof(f416,plain,
    ( ssList(sk0_47)
    & ssList(sk0_48)
    & ssList(sk0_49)
    & ssList(sk0_50)
    & sk0_48 = sk0_50
    & sk0_47 = sk0_49
    & frontsegP(sk0_50,sk0_49)
    & totalorderedP(sk0_49)
    & ! [Y] :
        ( ~ ssList(Y)
        | ~ neq(sk0_49,Y)
        | ~ frontsegP(sk0_50,Y)
        | ~ segmentP(Y,sk0_49)
        | ~ totalorderedP(Y) )
    & ~ totalorderedP(sk0_47) ),
    inference(skolemization,[status(esa)],[f415]) ).

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

fof(f424,plain,
    totalorderedP(sk0_49),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f426,plain,
    ~ totalorderedP(sk0_47),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f459,plain,
    totalorderedP(sk0_47),
    inference(forward_demodulation,[status(thm)],[f422,f424]) ).

fof(f460,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f426,f459]) ).

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