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

% Computer : n027.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:42 EDT 2024

% Result   : Theorem 0.21s 0.37s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  18   ~;  14   |;  11   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   16 (  14   !;   2   ?)

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

fof(f12,conjecture,
    ! [A,B] :
      ( ( subset(A,B)
        & subset(B,A) )
     => equal_set(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ ! [A,B] :
        ( ( subset(A,B)
          & subset(B,A) )
       => equal_set(A,B) ),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f21,plain,
    ! [A,B] :
      ( ( ~ equal_set(A,B)
        | ( subset(A,B)
          & subset(B,A) ) )
      & ( equal_set(A,B)
        | ~ subset(A,B)
        | ~ subset(B,A) ) ),
    inference(NNF_transformation,[status(esa)],[f2]) ).

fof(f22,plain,
    ( ! [A,B] :
        ( ~ equal_set(A,B)
        | ( subset(A,B)
          & subset(B,A) ) )
    & ! [A,B] :
        ( equal_set(A,B)
        | ~ subset(A,B)
        | ~ subset(B,A) ) ),
    inference(miniscoping,[status(esa)],[f21]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f22]) ).

fof(f68,plain,
    ? [A,B] :
      ( subset(A,B)
      & subset(B,A)
      & ~ equal_set(A,B) ),
    inference(pre_NNF_transformation,[status(esa)],[f13]) ).

fof(f69,plain,
    ( subset(sk0_3,sk0_4)
    & subset(sk0_4,sk0_3)
    & ~ equal_set(sk0_3,sk0_4) ),
    inference(skolemization,[status(esa)],[f68]) ).

fof(f70,plain,
    subset(sk0_3,sk0_4),
    inference(cnf_transformation,[status(esa)],[f69]) ).

fof(f71,plain,
    subset(sk0_4,sk0_3),
    inference(cnf_transformation,[status(esa)],[f69]) ).

fof(f72,plain,
    ~ equal_set(sk0_3,sk0_4),
    inference(cnf_transformation,[status(esa)],[f69]) ).

fof(f76,plain,
    ( spl0_0
  <=> equal_set(sk0_3,sk0_4) ),
    introduced(split_symbol_definition) ).

fof(f77,plain,
    ( equal_set(sk0_3,sk0_4)
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f76]) ).

fof(f79,plain,
    ( spl0_1
  <=> subset(sk0_3,sk0_4) ),
    introduced(split_symbol_definition) ).

fof(f81,plain,
    ( ~ subset(sk0_3,sk0_4)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f79]) ).

fof(f82,plain,
    ( equal_set(sk0_3,sk0_4)
    | ~ subset(sk0_3,sk0_4) ),
    inference(resolution,[status(thm)],[f25,f71]) ).

fof(f83,plain,
    ( spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f82,f76,f79]) ).

fof(f94,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f81,f70]) ).

fof(f95,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f94]) ).

fof(f96,plain,
    ( $false
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f77,f72]) ).

fof(f97,plain,
    ~ spl0_0,
    inference(contradiction_clause,[status(thm)],[f96]) ).

fof(f98,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f83,f95,f97]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SET019+4 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.14  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Apr 29 22:18:02 EDT 2024
% 0.14/0.36  % CPUTime  : 
% 0.14/0.37  % Drodi V3.6.0
% 0.21/0.37  % Refutation found
% 0.21/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.38  % Elapsed time: 0.019564 seconds
% 0.21/0.38  % CPU time: 0.026203 seconds
% 0.21/0.38  % Total memory used: 9.494 MB
% 0.21/0.38  % Net memory used: 9.401 MB
%------------------------------------------------------------------------------