%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SYN965+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n029.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:53:44 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [Z] :
    ! [X] :
    ? [Y] :
      ( ( p(Y,X)
       => ? [W] : p(W,Y) )
      & ( ( p(Z,Y)
          & p(Y,Z) )
       => p(Y,X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ? [Z] :
      ! [X] :
      ? [Y] :
        ( ( p(Y,X)
         => ? [W] : p(W,Y) )
        & ( ( p(Z,Y)
            & p(Y,Z) )
         => p(Y,X) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ! [Z] :
    ? [X] :
    ! [Y] :
      ( ( p(Y,X)
        & ! [W] : ~ p(W,Y) )
      | ( p(Z,Y)
        & p(Y,Z)
        & ~ p(Y,X) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ! [X,Y] :
      ( pd0_0(Y,X)
     => ( p(Y,X)
        & ! [W] : ~ p(W,Y) ) ),
    introduced(predicate_definition,[f3]) ).

fof(f5,plain,
    ! [Z] :
    ? [X] :
    ! [Y] :
      ( pd0_0(Y,X)
      | ( p(Z,Y)
        & p(Y,Z)
        & ~ p(Y,X) ) ),
    inference(formula_renaming,[status(thm)],[f3,f4]) ).

fof(f6,plain,
    ! [Z,Y] :
      ( pd0_0(Y,sk0_0(Z))
      | ( p(Z,Y)
        & p(Y,Z)
        & ~ p(Y,sk0_0(Z)) ) ),
    inference(skolemization,[status(esa)],[f5]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( pd0_0(X0,sk0_0(X1))
      | p(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( pd0_0(X0,sk0_0(X1))
      | ~ p(X0,sk0_0(X1)) ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f10,plain,
    ! [X,Y] :
      ( ~ pd0_0(Y,X)
      | ( p(Y,X)
        & ! [W] : ~ p(W,Y) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f4]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ pd0_0(X0,X1)
      | p(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( ~ pd0_0(X0,X1)
      | ~ p(X2,X0) ),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f13,plain,
    ! [X0,X1,X2] :
      ( ~ p(X0,sk0_0(X1))
      | ~ p(X2,X0) ),
    inference(resolution,[status(thm)],[f9,f12]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( ~ p(X0,X1)
      | pd0_0(X1,sk0_0(sk0_0(X2))) ),
    inference(resolution,[status(thm)],[f13,f8]) ).

fof(f15,plain,
    ! [X0,X1] : ~ p(X0,X1),
    inference(forward_subsumption_resolution,[status(thm)],[f14,f12]) ).

fof(f17,plain,
    ! [X0,X1] : ~ pd0_0(X0,X1),
    inference(backward_subsumption_resolution,[status(thm)],[f11,f15]) ).

fof(f18,plain,
    ! [X0,X1] : pd0_0(X0,sk0_0(X1)),
    inference(backward_subsumption_resolution,[status(thm)],[f8,f15]) ).

fof(f20,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f18,f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN965+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.36  % Computer : n029.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Mon Apr 29 22:16:04 EDT 2024
% 0.13/0.36  % CPUTime  : 
% 0.13/0.37  % Drodi V3.6.0
% 0.13/0.38  % Refutation found
% 0.13/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39  % Elapsed time: 0.017718 seconds
% 0.13/0.39  % CPU time: 0.024473 seconds
% 0.13/0.39  % Total memory used: 1.630 MB
% 0.13/0.39  % Net memory used: 1.529 MB
%------------------------------------------------------------------------------