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

% Computer : n015.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:39 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   60 (  30   ~;  18   |;  10   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   11 (   7   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ~ ? [X] :
        ~ ( ~ ! [Y] :
                ( ~ r1(X,Y)
                | ~ ( p201(Y)
                    & p101(Y) ) )
          | ! [Y] :
              ( ~ r1(X,Y)
              | ~ ( p201(Y)
                  & p101(Y) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f4,plain,
    ( ! [Y] :
        ( ~ r1(sk0_0,Y)
        | ~ p201(Y)
        | ~ p101(Y) )
    & r1(sk0_0,sk0_1)
    & p201(sk0_1)
    & p101(sk0_1) ),
    inference(skolemization,[status(esa)],[f3]) ).

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

fof(f6,plain,
    r1(sk0_0,sk0_1),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f7,plain,
    p201(sk0_1),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f8,plain,
    p101(sk0_1),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f9,plain,
    ( spl0_0
  <=> p201(sk0_1) ),
    introduced(split_symbol_definition) ).

fof(f11,plain,
    ( ~ p201(sk0_1)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f9]) ).

fof(f12,plain,
    ( spl0_1
  <=> p101(sk0_1) ),
    introduced(split_symbol_definition) ).

fof(f14,plain,
    ( ~ p101(sk0_1)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f12]) ).

fof(f15,plain,
    ( ~ p201(sk0_1)
    | ~ p101(sk0_1) ),
    inference(resolution,[status(thm)],[f5,f6]) ).

fof(f16,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f15,f9,f12]) ).

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

fof(f18,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f17]) ).

fof(f19,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f14,f8]) ).

fof(f20,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f19]) ).

fof(f21,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f16,f18,f20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL648+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n015.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:46:32 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.015932 seconds
% 0.13/0.37  % CPU time: 0.016389 seconds
% 0.13/0.37  % Total memory used: 3.652 MB
% 0.13/0.37  % Net memory used: 3.540 MB
%------------------------------------------------------------------------------