%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SEU188+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n026.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:36:10 EDT 2023

% Result   : Theorem 0.12s 0.35s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   41 (   8 unt;   0 def)
%            Number of atoms       :   96 (  23 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   93 (  38   ~;  37   |;   6   &)
%                                         (   5 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   6 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   12 (;  11   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f20,axiom,
    ! [A] :
      ( ( ~ empty(A)
        & relation(A) )
     => ~ empty(relation_dom(A)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f21,axiom,
    ! [A] :
      ( ( ~ empty(A)
        & relation(A) )
     => ~ empty(relation_rng(A)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f31,conjecture,
    ! [A] :
      ( relation(A)
     => ( ( relation_dom(A) = empty_set
          | relation_rng(A) = empty_set )
       => A = empty_set ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f32,negated_conjecture,
    ~ ! [A] :
        ( relation(A)
       => ( ( relation_dom(A) = empty_set
            | relation_rng(A) = empty_set )
         => A = empty_set ) ),
    inference(negated_conjecture,[status(cth)],[f31]) ).

fof(f33,axiom,
    ! [A] :
      ( empty(A)
     => A = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f60,plain,
    empty(empty_set),
    inference(cnf_transformation,[status(esa)],[f15]) ).

fof(f66,plain,
    ! [A] :
      ( empty(A)
      | ~ relation(A)
      | ~ empty(relation_dom(A)) ),
    inference(pre_NNF_transformation,[status(esa)],[f20]) ).

fof(f67,plain,
    ! [X0] :
      ( empty(X0)
      | ~ relation(X0)
      | ~ empty(relation_dom(X0)) ),
    inference(cnf_transformation,[status(esa)],[f66]) ).

fof(f68,plain,
    ! [A] :
      ( empty(A)
      | ~ relation(A)
      | ~ empty(relation_rng(A)) ),
    inference(pre_NNF_transformation,[status(esa)],[f21]) ).

fof(f69,plain,
    ! [X0] :
      ( empty(X0)
      | ~ relation(X0)
      | ~ empty(relation_rng(X0)) ),
    inference(cnf_transformation,[status(esa)],[f68]) ).

fof(f93,plain,
    ? [A] :
      ( relation(A)
      & ( relation_dom(A) = empty_set
        | relation_rng(A) = empty_set )
      & A != empty_set ),
    inference(pre_NNF_transformation,[status(esa)],[f32]) ).

fof(f94,plain,
    ( relation(sk0_13)
    & ( relation_dom(sk0_13) = empty_set
      | relation_rng(sk0_13) = empty_set )
    & sk0_13 != empty_set ),
    inference(skolemization,[status(esa)],[f93]) ).

fof(f95,plain,
    relation(sk0_13),
    inference(cnf_transformation,[status(esa)],[f94]) ).

fof(f96,plain,
    ( relation_dom(sk0_13) = empty_set
    | relation_rng(sk0_13) = empty_set ),
    inference(cnf_transformation,[status(esa)],[f94]) ).

fof(f97,plain,
    sk0_13 != empty_set,
    inference(cnf_transformation,[status(esa)],[f94]) ).

fof(f98,plain,
    ! [A] :
      ( ~ empty(A)
      | A = empty_set ),
    inference(pre_NNF_transformation,[status(esa)],[f33]) ).

fof(f99,plain,
    ! [X0] :
      ( ~ empty(X0)
      | X0 = empty_set ),
    inference(cnf_transformation,[status(esa)],[f98]) ).

fof(f106,plain,
    ( spl0_0
  <=> relation_dom(sk0_13) = empty_set ),
    introduced(split_symbol_definition) ).

fof(f107,plain,
    ( relation_dom(sk0_13) = empty_set
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f106]) ).

fof(f109,plain,
    ( spl0_1
  <=> relation_rng(sk0_13) = empty_set ),
    introduced(split_symbol_definition) ).

fof(f110,plain,
    ( relation_rng(sk0_13) = empty_set
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f109]) ).

fof(f112,plain,
    ( spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f96,f106,f109]) ).

fof(f138,plain,
    ( spl0_2
  <=> relation(sk0_13) ),
    introduced(split_symbol_definition) ).

fof(f140,plain,
    ( ~ relation(sk0_13)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f138]) ).

fof(f146,plain,
    ( spl0_4
  <=> empty(sk0_13) ),
    introduced(split_symbol_definition) ).

fof(f147,plain,
    ( empty(sk0_13)
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f146]) ).

fof(f149,plain,
    ( spl0_5
  <=> empty(empty_set) ),
    introduced(split_symbol_definition) ).

fof(f151,plain,
    ( ~ empty(empty_set)
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f149]) ).

fof(f152,plain,
    ( empty(sk0_13)
    | ~ relation(sk0_13)
    | ~ empty(empty_set)
    | ~ spl0_0 ),
    inference(paramodulation,[status(thm)],[f107,f67]) ).

fof(f153,plain,
    ( spl0_4
    | ~ spl0_2
    | ~ spl0_5
    | ~ spl0_0 ),
    inference(split_clause,[status(thm)],[f152,f146,f138,f149,f106]) ).

fof(f166,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f140,f95]) ).

fof(f167,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f166]) ).

fof(f176,plain,
    ( empty(sk0_13)
    | ~ relation(sk0_13)
    | ~ empty(empty_set)
    | ~ spl0_1 ),
    inference(paramodulation,[status(thm)],[f110,f69]) ).

fof(f177,plain,
    ( spl0_4
    | ~ spl0_2
    | ~ spl0_5
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f176,f146,f138,f149,f109]) ).

fof(f178,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f151,f60]) ).

fof(f179,plain,
    spl0_5,
    inference(contradiction_clause,[status(thm)],[f178]) ).

fof(f182,plain,
    ( sk0_13 = empty_set
    | ~ spl0_4 ),
    inference(resolution,[status(thm)],[f147,f99]) ).

fof(f183,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f182,f97]) ).

fof(f184,plain,
    ~ spl0_4,
    inference(contradiction_clause,[status(thm)],[f183]) ).

fof(f185,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f112,f153,f167,f177,f179,f184]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU188+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue May 30 09:25:43 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % Drodi V3.5.1
% 0.12/0.35  % Refutation found
% 0.12/0.35  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.37  % Elapsed time: 0.023341 seconds
% 0.12/0.37  % CPU time: 0.035254 seconds
% 0.12/0.37  % Memory used: 14.588 MB
%------------------------------------------------------------------------------