TSTP Solution File: SET024+1 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n001.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:37 EDT 2023

% Result   : Theorem 0.16s 0.59s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   41 (  13 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   42 (  17   ~;  13   |;   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (;  22   !;   1   ?)

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

fof(f6,axiom,
    ! [X] : singleton(X) = unordered_pair(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f45,negated_conjecture,
    ~ ! [X] :
        ( member(X,universal_class)
       => member(X,singleton(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(f63,plain,
    ! [X0,X1,X2] :
      ( member(X0,unordered_pair(X1,X2))
      | ~ member(X0,universal_class)
      | X0 != X1 ),
    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] :
      ( member(X,universal_class)
      & ~ member(X,singleton(X)) ),
    inference(pre_NNF_transformation,[status(esa)],[f45]) ).

fof(f192,plain,
    ( member(sk0_7,universal_class)
    & ~ member(sk0_7,singleton(sk0_7)) ),
    inference(skolemization,[status(esa)],[f191]) ).

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

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

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

fof(f268,plain,
    ! [X0] :
      ( member(X0,singleton(X0))
      | ~ member(X0,universal_class) ),
    inference(paramodulation,[status(thm)],[f66,f197]) ).

fof(f421,plain,
    ~ member(sk0_7,universal_class),
    inference(resolution,[status(thm)],[f268,f194]) ).

fof(f422,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f421,f193]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem  : SET024+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.05/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.32  % Computer : n001.cluster.edu
% 0.09/0.32  % Model    : x86_64 x86_64
% 0.09/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32  % Memory   : 8042.1875MB
% 0.09/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32  % CPULimit : 300
% 0.09/0.32  % WCLimit  : 300
% 0.09/0.32  % DateTime : Tue May 30 10:46:15 EDT 2023
% 0.09/0.32  % CPUTime  : 
% 0.09/0.33  % Drodi V3.5.1
% 0.16/0.59  % Refutation found
% 0.16/0.59  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.59  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.59  % Elapsed time: 0.038894 seconds
% 0.16/0.59  % CPU time: 0.018390 seconds
% 0.16/0.59  % Memory used: 3.921 MB
%------------------------------------------------------------------------------