%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : SET575+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n024.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  : 600s
% DateTime : Tue Jul 19 03:35:32 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(intersect_defn,axiom,
    ! [B,C] :
      ( intersect(B,C)
    <=> ? [D] :
          ( member(D,B)
          & member(D,C) ) ) ).

fof(prove_th15,conjecture,
    ! [B,C] :
      ( intersect(B,C)
     => ? [D] :
          ( member(D,B)
          & member(D,C) ) ) ).

fof(subgoal_0,plain,
    ! [B,C] :
      ( intersect(B,C)
     => ? [D] :
          ( member(D,B)
          & member(D,C) ) ),
    inference(strip,[],[prove_th15]) ).

fof(negate_0_0,plain,
    ~ ! [B,C] :
        ( intersect(B,C)
       => ? [D] :
            ( member(D,B)
            & member(D,C) ) ),
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    ? [B,C] :
      ( intersect(B,C)
      & ! [D] :
          ( ~ member(D,B)
          | ~ member(D,C) ) ),
    inference(canonicalize,[],[negate_0_0]) ).

fof(normalize_0_1,plain,
    ! [B,C] :
      ( ~ intersect(B,C)
    <=> ! [D] :
          ( ~ member(D,B)
          | ~ member(D,C) ) ),
    inference(canonicalize,[],[intersect_defn]) ).

fof(normalize_0_2,plain,
    ! [B,C] :
      ( ~ intersect(B,C)
    <=> ! [D] :
          ( ~ member(D,B)
          | ~ member(D,C) ) ),
    inference(specialize,[],[normalize_0_1]) ).

fof(normalize_0_3,plain,
    $false,
    inference(simplify,[],[normalize_0_0,normalize_0_2]) ).

cnf(refute_0_0,plain,
    $false,
    inference(canonicalize,[],[normalize_0_3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET575+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : metis --show proof --show saturation %s
% 0.13/0.34  % Computer : n024.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  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 14:42:28 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35  
% 0.13/0.35  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.13/0.35  
%------------------------------------------------------------------------------