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

% Computer : n031.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:33:43 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [Z] :
    ? [Y] :
    ! [X] :
      ( element(X,Y)
    <=> ( element(X,Z)
        & ~ element(X,X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,conjecture,
    ~ ? [Z] :
      ! [X] : element(X,Z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    ~ ~ ? [Z] :
        ! [X] : element(X,Z),
    inference(negated_conjecture,[status(cth)],[f2]) ).

fof(f4,plain,
    ! [Z] :
    ? [Y] :
    ! [X] :
      ( ( ~ element(X,Y)
        | ( element(X,Z)
          & ~ element(X,X) ) )
      & ( element(X,Y)
        | ~ element(X,Z)
        | element(X,X) ) ),
    inference(NNF_transformation,[status(esa)],[f1]) ).

fof(f5,plain,
    ! [Z] :
    ? [Y] :
      ( ! [X] :
          ( ~ element(X,Y)
          | ( element(X,Z)
            & ~ element(X,X) ) )
      & ! [X] :
          ( element(X,Y)
          | ~ element(X,Z)
          | element(X,X) ) ),
    inference(miniscoping,[status(esa)],[f4]) ).

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

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

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

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

fof(f10,plain,
    ! [X] : element(X,sk0_1),
    inference(skolemization,[status(esa)],[f3]) ).

fof(f11,plain,
    ! [X0] : element(X0,sk0_1),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f12,plain,
    ! [X0] :
      ( element(X0,sk0_0(sk0_1))
      | element(X0,X0) ),
    inference(resolution,[status(thm)],[f9,f11]) ).

fof(f27,plain,
    ( spl0_3
  <=> element(sk0_0(sk0_0(sk0_1)),sk0_0(sk0_0(sk0_1))) ),
    introduced(split_symbol_definition) ).

fof(f28,plain,
    ( element(sk0_0(sk0_0(sk0_1)),sk0_0(sk0_0(sk0_1)))
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f27]) ).

fof(f252,plain,
    ! [X0] :
      ( element(sk0_0(X0),X0)
      | element(sk0_0(X0),sk0_0(sk0_1)) ),
    inference(resolution,[status(thm)],[f7,f12]) ).

fof(f255,plain,
    ( element(sk0_0(sk0_0(sk0_1)),sk0_0(sk0_0(sk0_1)))
    | element(sk0_0(sk0_0(sk0_1)),sk0_0(sk0_0(sk0_1))) ),
    inference(resolution,[status(thm)],[f252,f9]) ).

fof(f256,plain,
    spl0_3,
    inference(split_clause,[status(thm)],[f255,f27]) ).

fof(f261,plain,
    ~ element(sk0_0(sk0_0(sk0_1)),sk0_0(sk0_0(sk0_1))),
    inference(resolution,[status(thm)],[f8,f252]) ).

fof(f262,plain,
    ( $false
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f261,f28]) ).

fof(f263,plain,
    ~ spl0_3,
    inference(contradiction_clause,[status(thm)],[f262]) ).

fof(f264,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f256,f263]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET045+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n031.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue May 30 10:38:22 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.21/0.41  % Refutation found
% 0.21/0.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.41  % Elapsed time: 0.057849 seconds
% 0.21/0.41  % CPU time: 0.041740 seconds
% 0.21/0.41  % Memory used: 1.039 MB
%------------------------------------------------------------------------------