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

% Computer : n020.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:55 EDT 2024

% Result   : Theorem 0.14s 0.36s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   7 unt;   0 def)
%            Number of atoms       :   49 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   44 (  18   ~;  14   |;   7   &)
%                                         (   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   :   15 (  14   !;   1   ?)

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

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

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

fof(f8,negated_conjecture,
    ~ ! [B] :
        ( subset(B,empty_set)
       => B = empty_set ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

fof(f9,plain,
    ! [X0] : subset(empty_set,X0),
    inference(cnf_transformation,[status(esa)],[f1]) ).

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

fof(f19,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)],[f18]) ).

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

fof(f29,plain,
    ? [B] :
      ( subset(B,empty_set)
      & B != empty_set ),
    inference(pre_NNF_transformation,[status(esa)],[f8]) ).

fof(f30,plain,
    ( subset(sk0_2,empty_set)
    & sk0_2 != empty_set ),
    inference(skolemization,[status(esa)],[f29]) ).

fof(f31,plain,
    subset(sk0_2,empty_set),
    inference(cnf_transformation,[status(esa)],[f30]) ).

fof(f32,plain,
    sk0_2 != empty_set,
    inference(cnf_transformation,[status(esa)],[f30]) ).

fof(f36,plain,
    ( spl0_0
  <=> empty_set = sk0_2 ),
    introduced(split_symbol_definition) ).

fof(f37,plain,
    ( empty_set = sk0_2
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f36]) ).

fof(f39,plain,
    ( spl0_1
  <=> subset(empty_set,sk0_2) ),
    introduced(split_symbol_definition) ).

fof(f41,plain,
    ( ~ subset(empty_set,sk0_2)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f39]) ).

fof(f42,plain,
    ( empty_set = sk0_2
    | ~ subset(empty_set,sk0_2) ),
    inference(resolution,[status(thm)],[f22,f31]) ).

fof(f43,plain,
    ( spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f42,f36,f39]) ).

fof(f44,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f41,f9]) ).

fof(f45,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f44]) ).

fof(f46,plain,
    ( $false
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f37,f32]) ).

fof(f47,plain,
    ~ spl0_0,
    inference(contradiction_clause,[status(thm)],[f46]) ).

fof(f48,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f43,f45,f47]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET063+3 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % 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 21:41:17 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  % Drodi V3.6.0
% 0.14/0.36  % Refutation found
% 0.14/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.37  % Elapsed time: 0.018401 seconds
% 0.14/0.37  % CPU time: 0.021853 seconds
% 0.14/0.37  % Total memory used: 7.822 MB
% 0.14/0.37  % Net memory used: 7.706 MB
%------------------------------------------------------------------------------