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

% Computer : n007.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:54 EDT 2023

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   9 unt;   0 def)
%            Number of atoms       :   46 (  21 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  13   ~;   8   |;   8   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (;  14   !;   4   ?)

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

fof(f6,axiom,
    ! [B,C] : intersection(B,C) = intersection(C,B),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f11,negated_conjecture,
    ~ ! [B,C] :
        ( ( subset(B,C)
          & intersection(C,B) = empty_set )
       => B = empty_set ),
    inference(negated_conjecture,[status(cth)],[f10]) ).

fof(f12,plain,
    ! [B,C] :
      ( ~ subset(B,C)
      | intersection(B,C) = B ),
    inference(pre_NNF_transformation,[status(esa)],[f1]) ).

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

fof(f32,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f46,plain,
    ? [B,C] :
      ( subset(B,C)
      & intersection(C,B) = empty_set
      & B != empty_set ),
    inference(pre_NNF_transformation,[status(esa)],[f11]) ).

fof(f47,plain,
    ? [B] :
      ( ? [C] :
          ( subset(B,C)
          & intersection(C,B) = empty_set )
      & B != empty_set ),
    inference(miniscoping,[status(esa)],[f46]) ).

fof(f48,plain,
    ( subset(sk0_3,sk0_4)
    & intersection(sk0_4,sk0_3) = empty_set
    & sk0_3 != empty_set ),
    inference(skolemization,[status(esa)],[f47]) ).

fof(f49,plain,
    subset(sk0_3,sk0_4),
    inference(cnf_transformation,[status(esa)],[f48]) ).

fof(f50,plain,
    intersection(sk0_4,sk0_3) = empty_set,
    inference(cnf_transformation,[status(esa)],[f48]) ).

fof(f51,plain,
    sk0_3 != empty_set,
    inference(cnf_transformation,[status(esa)],[f48]) ).

fof(f62,plain,
    empty_set = intersection(sk0_3,sk0_4),
    inference(paramodulation,[status(thm)],[f50,f32]) ).

fof(f68,plain,
    ( spl0_2
  <=> subset(sk0_3,sk0_4) ),
    introduced(split_symbol_definition) ).

fof(f70,plain,
    ( ~ subset(sk0_3,sk0_4)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f68]) ).

fof(f71,plain,
    ( spl0_3
  <=> empty_set = sk0_3 ),
    introduced(split_symbol_definition) ).

fof(f72,plain,
    ( empty_set = sk0_3
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f71]) ).

fof(f74,plain,
    ( ~ subset(sk0_3,sk0_4)
    | empty_set = sk0_3 ),
    inference(paramodulation,[status(thm)],[f62,f13]) ).

fof(f75,plain,
    ( ~ spl0_2
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f74,f68,f71]) ).

fof(f76,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f70,f49]) ).

fof(f77,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f76]) ).

fof(f78,plain,
    ( $false
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f72,f51]) ).

fof(f79,plain,
    ~ spl0_3,
    inference(contradiction_clause,[status(thm)],[f78]) ).

fof(f80,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f75,f77,f79]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n007.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 10:00:32 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37  % Elapsed time: 0.022607 seconds
% 0.13/0.37  % CPU time: 0.030305 seconds
% 0.13/0.37  % Memory used: 14.309 MB
%------------------------------------------------------------------------------