%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWV189+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n002.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:52 EDT 2023

% Result   : Theorem 0.14s 0.39s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  11 unt;   0 def)
%            Number of atoms       :   90 (  14 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   84 (  29   ~;  24   |;  18   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-3 aty)
%            Number of variables   :   34 (;  32   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X,Y,Z] :
      ( ( leq(X,Y)
        & leq(Y,Z) )
     => leq(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [X,Y] :
      ( gt(Y,X)
     => leq(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    ( ! [A] :
        ( ( leq(n0,A)
          & leq(A,n4) )
       => a_select3(center_init,A,n0) = init )
   => ! [B] :
        ( ( leq(n0,B)
          & leq(B,tptp_minus_1) )
       => ! [C] :
            ( ( leq(n0,C)
              & leq(C,n4) )
           => a_select3(q_init,B,C) = init ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ! [A] :
          ( ( leq(n0,A)
            & leq(A,n4) )
         => a_select3(center_init,A,n0) = init )
     => ! [B] :
          ( ( leq(n0,B)
            & leq(B,tptp_minus_1) )
         => ! [C] :
              ( ( leq(n0,C)
                & leq(C,n4) )
             => a_select3(q_init,B,C) = init ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f58,axiom,
    gt(n0,tptp_minus_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f78,axiom,
    ! [X] :
      ( ( leq(n0,X)
        & leq(X,n0) )
     => X = n0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f91,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f93,plain,
    ! [X,Y,Z] :
      ( ~ leq(X,Y)
      | ~ leq(Y,Z)
      | leq(X,Z) ),
    inference(pre_NNF_transformation,[status(esa)],[f5]) ).

fof(f94,plain,
    ! [X,Z] :
      ( ! [Y] :
          ( ~ leq(X,Y)
          | ~ leq(Y,Z) )
      | leq(X,Z) ),
    inference(miniscoping,[status(esa)],[f93]) ).

fof(f95,plain,
    ! [X0,X1,X2] :
      ( ~ leq(X0,X1)
      | ~ leq(X1,X2)
      | leq(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f94]) ).

fof(f104,plain,
    ! [X,Y] :
      ( ~ gt(Y,X)
      | leq(X,Y) ),
    inference(pre_NNF_transformation,[status(esa)],[f8]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( ~ gt(X0,X1)
      | leq(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f104]) ).

fof(f244,plain,
    ( ! [A] :
        ( ~ leq(n0,A)
        | ~ leq(A,n4)
        | a_select3(center_init,A,n0) = init )
    & ? [B] :
        ( leq(n0,B)
        & leq(B,tptp_minus_1)
        & ? [C] :
            ( leq(n0,C)
            & leq(C,n4)
            & a_select3(q_init,B,C) != init ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f54]) ).

fof(f245,plain,
    ( ! [A] :
        ( ~ leq(n0,A)
        | ~ leq(A,n4)
        | a_select3(center_init,A,n0) = init )
    & leq(n0,sk0_23)
    & leq(sk0_23,tptp_minus_1)
    & leq(n0,sk0_24)
    & leq(sk0_24,n4)
    & a_select3(q_init,sk0_23,sk0_24) != init ),
    inference(skolemization,[status(esa)],[f244]) ).

fof(f247,plain,
    leq(n0,sk0_23),
    inference(cnf_transformation,[status(esa)],[f245]) ).

fof(f248,plain,
    leq(sk0_23,tptp_minus_1),
    inference(cnf_transformation,[status(esa)],[f245]) ).

fof(f255,plain,
    gt(n0,tptp_minus_1),
    inference(cnf_transformation,[status(esa)],[f58]) ).

fof(f277,plain,
    ! [X] :
      ( ~ leq(n0,X)
      | ~ leq(X,n0)
      | X = n0 ),
    inference(pre_NNF_transformation,[status(esa)],[f78]) ).

fof(f278,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,n0)
      | X0 = n0 ),
    inference(cnf_transformation,[status(esa)],[f277]) ).

fof(f320,plain,
    ! [X0] :
      ( ~ leq(X0,sk0_23)
      | leq(X0,tptp_minus_1) ),
    inference(resolution,[status(thm)],[f95,f248]) ).

fof(f349,plain,
    leq(n0,tptp_minus_1),
    inference(resolution,[status(thm)],[f320,f247]) ).

fof(f379,plain,
    ( spl0_0
  <=> leq(tptp_minus_1,n0) ),
    introduced(split_symbol_definition) ).

fof(f381,plain,
    ( ~ leq(tptp_minus_1,n0)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f379]) ).

fof(f382,plain,
    ( spl0_1
  <=> tptp_minus_1 = n0 ),
    introduced(split_symbol_definition) ).

fof(f383,plain,
    ( tptp_minus_1 = n0
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f382]) ).

fof(f385,plain,
    ( ~ leq(tptp_minus_1,n0)
    | tptp_minus_1 = n0 ),
    inference(resolution,[status(thm)],[f278,f349]) ).

fof(f386,plain,
    ( ~ spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f385,f379,f382]) ).

fof(f919,plain,
    leq(tptp_minus_1,n0),
    inference(resolution,[status(thm)],[f105,f255]) ).

fof(f920,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f919,f381]) ).

fof(f921,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f920]) ).

fof(f968,plain,
    ( gt(n0,n0)
    | ~ spl0_1 ),
    inference(backward_demodulation,[status(thm)],[f383,f255]) ).

fof(f969,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f968,f91]) ).

fof(f970,plain,
    ~ spl0_1,
    inference(contradiction_clause,[status(thm)],[f969]) ).

fof(f971,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f386,f921,f970]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV189+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35  % Computer : n002.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue May 30 11:56:28 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.14/0.37  % Drodi V3.5.1
% 0.14/0.39  % Refutation found
% 0.14/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.25/0.65  % Elapsed time: 0.072889 seconds
% 0.25/0.65  % CPU time: 0.053315 seconds
% 0.25/0.65  % Memory used: 8.087 MB
%------------------------------------------------------------------------------