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

% Computer : n008.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:51 EDT 2023

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (   9 unt;   0 def)
%            Number of atoms       :   90 (  38 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   84 (  29   ~;  29   |;  20   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   35 (;  29   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [U,X,Y] :
      ( member(U,unordered_pair(X,Y))
    <=> ( member(U,universal_class)
        & ( U = X
          | U = Y ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f44,conjecture,
    ! [X,Y,Z] :
      ( ( member(X,universal_class)
        & member(Y,universal_class)
        & unordered_pair(X,Z) = unordered_pair(Y,Z) )
     => X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f45,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( ( member(X,universal_class)
          & member(Y,universal_class)
          & unordered_pair(X,Z) = unordered_pair(Y,Z) )
       => X = Y ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f59,plain,
    ! [U,X,Y] :
      ( ( ~ member(U,unordered_pair(X,Y))
        | ( member(U,universal_class)
          & ( U = X
            | U = Y ) ) )
      & ( member(U,unordered_pair(X,Y))
        | ~ member(U,universal_class)
        | ( U != X
          & U != Y ) ) ),
    inference(NNF_transformation,[status(esa)],[f4]) ).

fof(f60,plain,
    ( ! [U,X,Y] :
        ( ~ member(U,unordered_pair(X,Y))
        | ( member(U,universal_class)
          & ( U = X
            | U = Y ) ) )
    & ! [U,X,Y] :
        ( member(U,unordered_pair(X,Y))
        | ~ member(U,universal_class)
        | ( U != X
          & U != Y ) ) ),
    inference(miniscoping,[status(esa)],[f59]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,unordered_pair(X1,X2))
      | X0 = X1
      | X0 = X2 ),
    inference(cnf_transformation,[status(esa)],[f60]) ).

fof(f63,plain,
    ! [X0,X1,X2] :
      ( member(X0,unordered_pair(X1,X2))
      | ~ member(X0,universal_class)
      | X0 != X1 ),
    inference(cnf_transformation,[status(esa)],[f60]) ).

fof(f191,plain,
    ? [X,Y,Z] :
      ( member(X,universal_class)
      & member(Y,universal_class)
      & unordered_pair(X,Z) = unordered_pair(Y,Z)
      & X != Y ),
    inference(pre_NNF_transformation,[status(esa)],[f45]) ).

fof(f192,plain,
    ? [X,Y] :
      ( member(X,universal_class)
      & member(Y,universal_class)
      & ? [Z] : unordered_pair(X,Z) = unordered_pair(Y,Z)
      & X != Y ),
    inference(miniscoping,[status(esa)],[f191]) ).

fof(f193,plain,
    ( member(sk0_7,universal_class)
    & member(sk0_8,universal_class)
    & unordered_pair(sk0_7,sk0_9) = unordered_pair(sk0_8,sk0_9)
    & sk0_7 != sk0_8 ),
    inference(skolemization,[status(esa)],[f192]) ).

fof(f194,plain,
    member(sk0_7,universal_class),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f195,plain,
    member(sk0_8,universal_class),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f196,plain,
    unordered_pair(sk0_7,sk0_9) = unordered_pair(sk0_8,sk0_9),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f197,plain,
    sk0_7 != sk0_8,
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f200,plain,
    ! [X0,X1] :
      ( member(X0,unordered_pair(X0,X1))
      | ~ member(X0,universal_class) ),
    inference(destructive_equality_resolution,[status(esa)],[f63]) ).

fof(f206,plain,
    ! [X0] :
      ( ~ member(X0,unordered_pair(sk0_7,sk0_9))
      | X0 = sk0_8
      | X0 = sk0_9 ),
    inference(paramodulation,[status(thm)],[f196,f62]) ).

fof(f208,plain,
    ! [X0] : member(sk0_8,unordered_pair(sk0_8,X0)),
    inference(resolution,[status(thm)],[f200,f195]) ).

fof(f209,plain,
    ! [X0] : member(sk0_7,unordered_pair(sk0_7,X0)),
    inference(resolution,[status(thm)],[f200,f194]) ).

fof(f219,plain,
    member(sk0_8,unordered_pair(sk0_7,sk0_9)),
    inference(paramodulation,[status(thm)],[f196,f208]) ).

fof(f229,plain,
    ( spl0_4
  <=> sk0_8 = sk0_7 ),
    introduced(split_symbol_definition) ).

fof(f230,plain,
    ( sk0_8 = sk0_7
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f229]) ).

fof(f232,plain,
    ( spl0_5
  <=> sk0_8 = sk0_9 ),
    introduced(split_symbol_definition) ).

fof(f233,plain,
    ( sk0_8 = sk0_9
    | ~ spl0_5 ),
    inference(component_clause,[status(thm)],[f232]) ).

fof(f235,plain,
    ( sk0_8 = sk0_7
    | sk0_8 = sk0_9 ),
    inference(resolution,[status(thm)],[f219,f62]) ).

fof(f236,plain,
    ( spl0_4
    | spl0_5 ),
    inference(split_clause,[status(thm)],[f235,f229,f232]) ).

fof(f238,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f230,f197]) ).

fof(f239,plain,
    ~ spl0_4,
    inference(contradiction_clause,[status(thm)],[f238]) ).

fof(f261,plain,
    ( spl0_6
  <=> sk0_7 = sk0_9 ),
    introduced(split_symbol_definition) ).

fof(f262,plain,
    ( sk0_7 = sk0_9
    | ~ spl0_6 ),
    inference(component_clause,[status(thm)],[f261]) ).

fof(f264,plain,
    ( sk0_7 = sk0_8
    | sk0_7 = sk0_9 ),
    inference(resolution,[status(thm)],[f206,f209]) ).

fof(f265,plain,
    ( spl0_4
    | spl0_6 ),
    inference(split_clause,[status(thm)],[f264,f229,f261]) ).

fof(f307,plain,
    ( sk0_7 = sk0_8
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(forward_demodulation,[status(thm)],[f233,f262]) ).

fof(f308,plain,
    ( $false
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[status(thm)],[f307,f197]) ).

fof(f309,plain,
    ( ~ spl0_5
    | ~ spl0_6 ),
    inference(contradiction_clause,[status(thm)],[f308]) ).

fof(f310,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f236,f239,f265,f309]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET072+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.12/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n008.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:16:23 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 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.38  % Elapsed time: 0.028251 seconds
% 0.13/0.38  % CPU time: 0.041165 seconds
% 0.13/0.38  % Memory used: 15.119 MB
%------------------------------------------------------------------------------