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

% Computer : n021.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:35:04 EDT 2023

% Result   : Theorem 0.17s 0.58s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   50 (  20   ~;  18   |;   8   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   41 (;  38   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [X] :
          ( member(X,A)
         => member(X,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [X,A] :
      ( member(X,power_set(A))
    <=> subset(X,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,conjecture,
    ! [A] : member(A,power_set(A)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ ! [A] : member(A,power_set(A)),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [X] :
          ( ~ member(X,A)
          | member(X,B) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f1]) ).

fof(f15,plain,
    ! [A,B] :
      ( ( ~ subset(A,B)
        | ! [X] :
            ( ~ member(X,A)
            | member(X,B) ) )
      & ( subset(A,B)
        | ? [X] :
            ( member(X,A)
            & ~ member(X,B) ) ) ),
    inference(NNF_transformation,[status(esa)],[f14]) ).

fof(f16,plain,
    ( ! [A,B] :
        ( ~ subset(A,B)
        | ! [X] :
            ( ~ member(X,A)
            | member(X,B) ) )
    & ! [A,B] :
        ( subset(A,B)
        | ? [X] :
            ( member(X,A)
            & ~ member(X,B) ) ) ),
    inference(miniscoping,[status(esa)],[f15]) ).

fof(f17,plain,
    ( ! [A,B] :
        ( ~ subset(A,B)
        | ! [X] :
            ( ~ member(X,A)
            | member(X,B) ) )
    & ! [A,B] :
        ( subset(A,B)
        | ( member(sk0_0(B,A),A)
          & ~ member(sk0_0(B,A),B) ) ) ),
    inference(skolemization,[status(esa)],[f16]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sk0_0(X1,X0),X0) ),
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ member(sk0_0(X1,X0),X1) ),
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f26,plain,
    ! [X,A] :
      ( ( ~ member(X,power_set(A))
        | subset(X,A) )
      & ( member(X,power_set(A))
        | ~ subset(X,A) ) ),
    inference(NNF_transformation,[status(esa)],[f3]) ).

fof(f27,plain,
    ( ! [X,A] :
        ( ~ member(X,power_set(A))
        | subset(X,A) )
    & ! [X,A] :
        ( member(X,power_set(A))
        | ~ subset(X,A) ) ),
    inference(miniscoping,[status(esa)],[f26]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( member(X0,power_set(X1))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f27]) ).

fof(f68,plain,
    ? [A] : ~ member(A,power_set(A)),
    inference(pre_NNF_transformation,[status(esa)],[f13]) ).

fof(f69,plain,
    ~ member(sk0_3,power_set(sk0_3)),
    inference(skolemization,[status(esa)],[f68]) ).

fof(f70,plain,
    ~ member(sk0_3,power_set(sk0_3)),
    inference(cnf_transformation,[status(esa)],[f69]) ).

fof(f99,plain,
    ! [X0] :
      ( subset(X0,X0)
      | subset(X0,X0) ),
    inference(resolution,[status(thm)],[f20,f19]) ).

fof(f100,plain,
    ! [X0] : subset(X0,X0),
    inference(duplicate_literals_removal,[status(esa)],[f99]) ).

fof(f101,plain,
    ! [X0] : member(X0,power_set(X0)),
    inference(resolution,[status(thm)],[f100,f29]) ).

fof(f102,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f70,f101]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : SET705+4 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.14  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.35  % Computer : n021.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8042.1875MB
% 0.11/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Tue May 30 10:13:52 EDT 2023
% 0.11/0.35  % CPUTime  : 
% 0.11/0.36  % Drodi V3.5.1
% 0.17/0.58  % Refutation found
% 0.17/0.58  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.58  % Elapsed time: 0.011869 seconds
% 0.17/0.58  % CPU time: 0.013101 seconds
% 0.17/0.58  % Memory used: 2.926 MB
%------------------------------------------------------------------------------