%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : LCL684+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n004.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 : Tue Apr 30 20:27:54 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   69 (  36   ~;  23   |;   8   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   16 (  13   !;   3   ?)

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

fof(f3,conjecture,
    ~ ? [X] :
        ~ ( ~ ! [Y] :
                ( ~ r1(X,Y)
                | ! [X] :
                    ( ~ r1(Y,X)
                    | ~ ( p201(X)
                        & p101(X) ) ) )
          | ~ ( p201(X)
              & p101(X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( ~ ! [Y] :
                  ( ~ r1(X,Y)
                  | ! [X] :
                      ( ~ r1(Y,X)
                      | ~ ( p201(X)
                          & p101(X) ) ) )
            | ~ ( p201(X)
                & p101(X) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f5,plain,
    ! [X0] : r1(X0,X0),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f9,plain,
    ? [X] :
      ( ! [Y] :
          ( ~ r1(X,Y)
          | ! [X] :
              ( ~ r1(Y,X)
              | ~ p201(X)
              | ~ p101(X) ) )
      & p201(X)
      & p101(X) ),
    inference(pre_NNF_transformation,[status(esa)],[f4]) ).

fof(f10,plain,
    ( ! [Y] :
        ( ~ r1(sk0_0,Y)
        | ! [X] :
            ( ~ r1(Y,X)
            | ~ p201(X)
            | ~ p101(X) ) )
    & p201(sk0_0)
    & p101(sk0_0) ),
    inference(skolemization,[status(esa)],[f9]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ r1(sk0_0,X0)
      | ~ r1(X0,X1)
      | ~ p201(X1)
      | ~ p101(X1) ),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f12,plain,
    p201(sk0_0),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f13,plain,
    p101(sk0_0),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ r1(sk0_0,X0)
      | ~ p201(X0)
      | ~ p101(X0) ),
    inference(resolution,[status(thm)],[f5,f11]) ).

fof(f15,plain,
    ( spl0_0
  <=> p201(sk0_0) ),
    introduced(split_symbol_definition) ).

fof(f17,plain,
    ( ~ p201(sk0_0)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f15]) ).

fof(f18,plain,
    ( spl0_1
  <=> p101(sk0_0) ),
    introduced(split_symbol_definition) ).

fof(f20,plain,
    ( ~ p101(sk0_0)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f18]) ).

fof(f21,plain,
    ( ~ p201(sk0_0)
    | ~ p101(sk0_0) ),
    inference(resolution,[status(thm)],[f14,f5]) ).

fof(f22,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f21,f15,f18]) ).

fof(f23,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f17,f12]) ).

fof(f24,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f23]) ).

fof(f25,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f20,f13]) ).

fof(f26,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f25]) ).

fof(f27,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f22,f24,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LCL684+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr 29 20:12:18 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 0.13/0.36  % Refutation found
% 0.13/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37  % Elapsed time: 0.017107 seconds
% 0.13/0.37  % CPU time: 0.017950 seconds
% 0.13/0.37  % Total memory used: 3.652 MB
% 0.13/0.37  % Net memory used: 3.564 MB
%------------------------------------------------------------------------------