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

% Computer : n018.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:40:59 EDT 2024

% Result   : Theorem 0.11s 0.35s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   6 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   36 (  14   ~;  10   |;   7   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   12 (  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f35,axiom,
    ! [A,B] :
      ( ( finite(A)
        & finite(B) )
     => finite(set_union2(A,B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f61,conjecture,
    ! [A,B] :
      ( ( finite(A)
        & finite(B) )
     => finite(set_union2(A,B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f62,negated_conjecture,
    ~ ! [A,B] :
        ( ( finite(A)
          & finite(B) )
       => finite(set_union2(A,B)) ),
    inference(negated_conjecture,[status(cth)],[f61]) ).

fof(f155,plain,
    ! [A,B] :
      ( ~ finite(A)
      | ~ finite(B)
      | finite(set_union2(A,B)) ),
    inference(pre_NNF_transformation,[status(esa)],[f35]) ).

fof(f156,plain,
    ! [X0,X1] :
      ( ~ finite(X0)
      | ~ finite(X1)
      | finite(set_union2(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f155]) ).

fof(f269,plain,
    ? [A,B] :
      ( finite(A)
      & finite(B)
      & ~ finite(set_union2(A,B)) ),
    inference(pre_NNF_transformation,[status(esa)],[f62]) ).

fof(f270,plain,
    ( finite(sk0_26)
    & finite(sk0_27)
    & ~ finite(set_union2(sk0_26,sk0_27)) ),
    inference(skolemization,[status(esa)],[f269]) ).

fof(f271,plain,
    finite(sk0_26),
    inference(cnf_transformation,[status(esa)],[f270]) ).

fof(f272,plain,
    finite(sk0_27),
    inference(cnf_transformation,[status(esa)],[f270]) ).

fof(f273,plain,
    ~ finite(set_union2(sk0_26,sk0_27)),
    inference(cnf_transformation,[status(esa)],[f270]) ).

fof(f310,plain,
    ( spl0_4
  <=> finite(sk0_26) ),
    introduced(split_symbol_definition) ).

fof(f312,plain,
    ( ~ finite(sk0_26)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f310]) ).

fof(f313,plain,
    ( spl0_5
  <=> finite(sk0_27) ),
    introduced(split_symbol_definition) ).

fof(f315,plain,
    ( ~ finite(sk0_27)
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f313]) ).

fof(f316,plain,
    ( ~ finite(sk0_26)
    | ~ finite(sk0_27) ),
    inference(resolution,[status(thm)],[f156,f273]) ).

fof(f317,plain,
    ( ~ spl0_4
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f316,f310,f313]) ).

fof(f330,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f312,f271]) ).

fof(f331,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f330]) ).

fof(f332,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f315,f272]) ).

fof(f333,plain,
    spl0_5,
    inference(contradiction_clause,[status(thm)],[f332]) ).

fof(f334,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f317,f331,f333]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU083+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.33  % Computer : n018.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Mon Apr 29 19:57:12 EDT 2024
% 0.11/0.34  % CPUTime  : 
% 0.11/0.35  % Drodi V3.6.0
% 0.11/0.35  % Refutation found
% 0.11/0.35  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.37  % Elapsed time: 0.021904 seconds
% 0.11/0.37  % CPU time: 0.023581 seconds
% 0.11/0.37  % Total memory used: 11.627 MB
% 0.11/0.37  % Net memory used: 11.621 MB
%------------------------------------------------------------------------------