TSTP Solution File: SET044+1 by Drodi---3.6.0

View Problem - Process Solution

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

% Computer : n017.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:38:49 EDT 2024

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

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

fof(f2,negated_conjecture,
    ~ ( ? [Y] :
        ! [X] :
          ( element(X,Y)
        <=> element(X,X) )
     => ~ ! [X1] :
          ? [Y1] :
          ! [Z] :
            ( element(Z,Y1)
          <=> ~ element(Z,X1) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ? [Y] :
      ! [X] :
        ( element(X,Y)
      <=> element(X,X) )
    & ! [X1] :
      ? [Y1] :
      ! [Z] :
        ( element(Z,Y1)
      <=> ~ element(Z,X1) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

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

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

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

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

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

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

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

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

fof(f13,plain,
    element(sk0_1(sk0_0),sk0_0),
    inference(factoring,[status(esa)],[f11]) ).

fof(f14,plain,
    element(sk0_1(sk0_0),sk0_1(sk0_0)),
    inference(resolution,[status(thm)],[f7,f13]) ).

fof(f26,plain,
    ~ element(sk0_1(sk0_0),sk0_0),
    inference(resolution,[status(thm)],[f14,f9]) ).

fof(f27,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f26,f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET044+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n017.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 : Mon Apr 29 21:21:03 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.6.0
% 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.023052 seconds
% 0.13/0.38  % CPU time: 0.039396 seconds
% 0.13/0.38  % Total memory used: 1.889 MB
% 0.13/0.38  % Net memory used: 1.769 MB
%------------------------------------------------------------------------------