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

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

% Result   : Theorem 0.14s 0.39s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   42 (  23 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   41 (  15   ~;  14   |;   9   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   27 (  25   !;   2   ?)

% 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(f6,axiom,
    ! [X] : singleton(X) = unordered_pair(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f45,negated_conjecture,
    ~ ! [X,Y] :
        ( member(Y,singleton(X))
       => Y = X ),
    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(f66,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[status(esa)],[f6]) ).

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

fof(f192,plain,
    ( member(sk0_8,singleton(sk0_7))
    & sk0_8 != sk0_7 ),
    inference(skolemization,[status(esa)],[f191]) ).

fof(f193,plain,
    member(sk0_8,singleton(sk0_7)),
    inference(cnf_transformation,[status(esa)],[f192]) ).

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

fof(f251,plain,
    ! [X0,X1] :
      ( ~ member(X0,singleton(X1))
      | X0 = X1
      | X0 = X1 ),
    inference(paramodulation,[status(thm)],[f66,f62]) ).

fof(f252,plain,
    ! [X0,X1] :
      ( ~ member(X0,singleton(X1))
      | X0 = X1 ),
    inference(duplicate_literals_removal,[status(esa)],[f251]) ).

fof(f261,plain,
    sk0_8 = sk0_7,
    inference(resolution,[status(thm)],[f252,f193]) ).

fof(f262,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f261,f194]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SET081+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.08/0.15  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.37  % Computer : n014.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 300
% 0.14/0.37  % DateTime : Mon Apr 29 21:42:19 EDT 2024
% 0.14/0.37  % CPUTime  : 
% 0.14/0.38  % Drodi V3.6.0
% 0.14/0.39  % Refutation found
% 0.14/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41  % Elapsed time: 0.024408 seconds
% 0.14/0.41  % CPU time: 0.033888 seconds
% 0.14/0.41  % Total memory used: 13.459 MB
% 0.14/0.41  % Net memory used: 13.440 MB
%------------------------------------------------------------------------------