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

% Computer : n032.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:11 EDT 2023

% Result   : Theorem 0.12s 0.29s
% 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(f57,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

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

fof(f367,plain,
    empty(empty_set),
    inference(cnf_transformation,[status(esa)],[f57]) ).

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

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

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

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

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

fof(f622,plain,
    ( relation(sk0_49)
    & ( relation_dom(sk0_49) = empty_set
      | relation_rng(sk0_49) = empty_set )
    & sk0_49 != empty_set ),
    inference(skolemization,[status(esa)],[f621]) ).

fof(f623,plain,
    relation(sk0_49),
    inference(cnf_transformation,[status(esa)],[f622]) ).

fof(f624,plain,
    ( relation_dom(sk0_49) = empty_set
    | relation_rng(sk0_49) = empty_set ),
    inference(cnf_transformation,[status(esa)],[f622]) ).

fof(f625,plain,
    sk0_49 != empty_set,
    inference(cnf_transformation,[status(esa)],[f622]) ).

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

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

fof(f671,plain,
    ( spl0_0
  <=> relation_dom(sk0_49) = empty_set ),
    introduced(split_symbol_definition) ).

fof(f672,plain,
    ( relation_dom(sk0_49) = empty_set
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f671]) ).

fof(f674,plain,
    ( spl0_1
  <=> relation_rng(sk0_49) = empty_set ),
    introduced(split_symbol_definition) ).

fof(f675,plain,
    ( relation_rng(sk0_49) = empty_set
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f674]) ).

fof(f677,plain,
    ( spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f624,f671,f674]) ).

fof(f724,plain,
    ( spl0_2
  <=> empty(empty_set) ),
    introduced(split_symbol_definition) ).

fof(f726,plain,
    ( ~ empty(empty_set)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f724]) ).

fof(f750,plain,
    ( spl0_4
  <=> empty(sk0_49) ),
    introduced(split_symbol_definition) ).

fof(f751,plain,
    ( empty(sk0_49)
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f750]) ).

fof(f753,plain,
    ( spl0_5
  <=> relation(sk0_49) ),
    introduced(split_symbol_definition) ).

fof(f755,plain,
    ( ~ relation(sk0_49)
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f753]) ).

fof(f756,plain,
    ( empty(sk0_49)
    | ~ relation(sk0_49)
    | ~ empty(empty_set)
    | ~ spl0_0 ),
    inference(paramodulation,[status(thm)],[f672,f384]) ).

fof(f757,plain,
    ( spl0_4
    | ~ spl0_5
    | ~ spl0_2
    | ~ spl0_0 ),
    inference(split_clause,[status(thm)],[f756,f750,f753,f724,f671]) ).

fof(f758,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f726,f367]) ).

fof(f759,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f758]) ).

fof(f760,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f755,f623]) ).

fof(f761,plain,
    spl0_5,
    inference(contradiction_clause,[status(thm)],[f760]) ).

fof(f766,plain,
    ( empty(sk0_49)
    | ~ relation(sk0_49)
    | ~ empty(empty_set)
    | ~ spl0_1 ),
    inference(paramodulation,[status(thm)],[f675,f386]) ).

fof(f767,plain,
    ( spl0_4
    | ~ spl0_5
    | ~ spl0_2
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f766,f750,f753,f724,f674]) ).

fof(f1048,plain,
    ( sk0_49 = empty_set
    | ~ spl0_4 ),
    inference(resolution,[status(thm)],[f632,f751]) ).

fof(f1049,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f1048,f625]) ).

fof(f1050,plain,
    ~ spl0_4,
    inference(contradiction_clause,[status(thm)],[f1049]) ).

fof(f1051,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f677,f757,f759,f761,f767,f1050]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem  : SEU188+2 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.08  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.27  % Computer : n032.cluster.edu
% 0.08/0.27  % Model    : x86_64 x86_64
% 0.08/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27  % Memory   : 8042.1875MB
% 0.08/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27  % CPULimit : 300
% 0.08/0.27  % WCLimit  : 300
% 0.08/0.27  % DateTime : Tue May 30 09:17:00 EDT 2023
% 0.08/0.27  % CPUTime  : 
% 0.12/0.28  % Drodi V3.5.1
% 0.12/0.29  % Refutation found
% 0.12/0.29  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.29  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.30  % Elapsed time: 0.026703 seconds
% 0.12/0.30  % CPU time: 0.050813 seconds
% 0.12/0.30  % Memory used: 19.411 MB
%------------------------------------------------------------------------------