%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SET583+3 : TPTP v8.1.2. Released v2.2.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 : Wed May 31 12:34:43 EDT 2023

% Result   : Theorem 0.20s 0.37s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :   52 (  14 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 (   3 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(f1,axiom,
    ! [B,C] :
      ( B = C
    <=> ( subset(B,C)
        & subset(C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,conjecture,
    ! [B,C] :
      ( ( subset(B,C)
        & subset(C,B) )
     => B = C ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ~ ! [B,C] :
        ( ( subset(B,C)
          & subset(C,B) )
       => B = C ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ! [B,C] :
      ( ( B != C
        | ( subset(B,C)
          & subset(C,B) ) )
      & ( B = C
        | ~ subset(B,C)
        | ~ subset(C,B) ) ),
    inference(NNF_transformation,[status(esa)],[f1]) ).

fof(f7,plain,
    ( ! [B,C] :
        ( B != C
        | ( subset(B,C)
          & subset(C,B) ) )
    & ! [B,C] :
        ( B = C
        | ~ subset(B,C)
        | ~ subset(C,B) ) ),
    inference(miniscoping,[status(esa)],[f6]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f19,plain,
    ? [B,C] :
      ( subset(B,C)
      & subset(C,B)
      & B != C ),
    inference(pre_NNF_transformation,[status(esa)],[f5]) ).

fof(f20,plain,
    ( subset(sk0_1,sk0_2)
    & subset(sk0_2,sk0_1)
    & sk0_1 != sk0_2 ),
    inference(skolemization,[status(esa)],[f19]) ).

fof(f21,plain,
    subset(sk0_1,sk0_2),
    inference(cnf_transformation,[status(esa)],[f20]) ).

fof(f22,plain,
    subset(sk0_2,sk0_1),
    inference(cnf_transformation,[status(esa)],[f20]) ).

fof(f23,plain,
    sk0_1 != sk0_2,
    inference(cnf_transformation,[status(esa)],[f20]) ).

fof(f26,plain,
    ( spl0_0
  <=> sk0_1 = sk0_2 ),
    introduced(split_symbol_definition) ).

fof(f27,plain,
    ( sk0_1 = sk0_2
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f26]) ).

fof(f34,plain,
    ( spl0_2
  <=> subset(sk0_2,sk0_1) ),
    introduced(split_symbol_definition) ).

fof(f36,plain,
    ( ~ subset(sk0_2,sk0_1)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f34]) ).

fof(f37,plain,
    ( sk0_2 = sk0_1
    | ~ subset(sk0_2,sk0_1) ),
    inference(resolution,[status(thm)],[f10,f21]) ).

fof(f38,plain,
    ( spl0_0
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f37,f26,f34]) ).

fof(f39,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f36,f22]) ).

fof(f40,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f39]) ).

fof(f41,plain,
    ( $false
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f27,f23]) ).

fof(f42,plain,
    ~ spl0_0,
    inference(contradiction_clause,[status(thm)],[f41]) ).

fof(f43,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f38,f40,f42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET583+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/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 : Tue May 30 09:38:55 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.20/0.37  % Refutation found
% 0.20/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.37  % Elapsed time: 0.022262 seconds
% 0.20/0.37  % CPU time: 0.028015 seconds
% 0.20/0.37  % Memory used: 11.345 MB
%------------------------------------------------------------------------------