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

% Computer : n022.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:02 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  17 unt;   0 def)
%            Number of atoms       :   68 (   4 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   60 (  27   ~;  23   |;   6   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   52 (  50   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [B,C] : symmetric_difference(B,C) = union(difference(B,C),difference(C,B)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ! [B,C,D] :
      ( intersect(B,union(C,D))
    <=> ( intersect(B,C)
        | intersect(B,D) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [B,C] : disjoint(intersection(B,C),difference(B,C)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [B,C] :
      ( disjoint(B,C)
    <=> ~ intersect(B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [B,C] : intersection(B,C) = intersection(C,B),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f12,conjecture,
    ! [B,C] : disjoint(intersection(B,C),symmetric_difference(B,C)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ ! [B,C] : disjoint(intersection(B,C),symmetric_difference(B,C)),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f15,plain,
    ! [B,C,D] :
      ( ( ~ intersect(B,union(C,D))
        | intersect(B,C)
        | intersect(B,D) )
      & ( intersect(B,union(C,D))
        | ( ~ intersect(B,C)
          & ~ intersect(B,D) ) ) ),
    inference(NNF_transformation,[status(esa)],[f2]) ).

fof(f16,plain,
    ( ! [B,C,D] :
        ( ~ intersect(B,union(C,D))
        | intersect(B,C)
        | intersect(B,D) )
    & ! [B,C,D] :
        ( intersect(B,union(C,D))
        | ( ~ intersect(B,C)
          & ~ intersect(B,D) ) ) ),
    inference(miniscoping,[status(esa)],[f15]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( ~ intersect(X0,union(X1,X2))
      | intersect(X0,X1)
      | intersect(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f20,plain,
    ! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f32,plain,
    ! [B,C] :
      ( ( ~ disjoint(B,C)
        | ~ intersect(B,C) )
      & ( disjoint(B,C)
        | intersect(B,C) ) ),
    inference(NNF_transformation,[status(esa)],[f6]) ).

fof(f33,plain,
    ( ! [B,C] :
        ( ~ disjoint(B,C)
        | ~ intersect(B,C) )
    & ! [B,C] :
        ( disjoint(B,C)
        | intersect(B,C) ) ),
    inference(miniscoping,[status(esa)],[f32]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | ~ intersect(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f33]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( disjoint(X0,X1)
      | intersect(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f33]) ).

fof(f37,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f48,plain,
    ? [B,C] : ~ disjoint(intersection(B,C),symmetric_difference(B,C)),
    inference(pre_NNF_transformation,[status(esa)],[f13]) ).

fof(f49,plain,
    ~ disjoint(intersection(sk0_2,sk0_3),symmetric_difference(sk0_2,sk0_3)),
    inference(skolemization,[status(esa)],[f48]) ).

fof(f50,plain,
    ~ disjoint(intersection(sk0_2,sk0_3),symmetric_difference(sk0_2,sk0_3)),
    inference(cnf_transformation,[status(esa)],[f49]) ).

fof(f51,plain,
    intersect(intersection(sk0_2,sk0_3),symmetric_difference(sk0_2,sk0_3)),
    inference(resolution,[status(thm)],[f35,f50]) ).

fof(f58,plain,
    ! [X0,X1] : ~ intersect(intersection(X0,X1),difference(X0,X1)),
    inference(resolution,[status(thm)],[f20,f34]) ).

fof(f61,plain,
    ! [X0,X1] : ~ intersect(intersection(X0,X1),difference(X1,X0)),
    inference(paramodulation,[status(thm)],[f37,f58]) ).

fof(f84,plain,
    ! [X0,X1,X2] :
      ( ~ intersect(X0,symmetric_difference(X1,X2))
      | intersect(X0,difference(X1,X2))
      | intersect(X0,difference(X2,X1)) ),
    inference(paramodulation,[status(thm)],[f14,f17]) ).

fof(f134,plain,
    ( spl0_4
  <=> intersect(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3)) ),
    introduced(split_symbol_definition) ).

fof(f135,plain,
    ( intersect(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3))
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f134]) ).

fof(f137,plain,
    ( spl0_5
  <=> intersect(intersection(sk0_2,sk0_3),difference(sk0_3,sk0_2)) ),
    introduced(split_symbol_definition) ).

fof(f138,plain,
    ( intersect(intersection(sk0_2,sk0_3),difference(sk0_3,sk0_2))
    | ~ spl0_5 ),
    inference(component_clause,[status(thm)],[f137]) ).

fof(f140,plain,
    ( intersect(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3))
    | intersect(intersection(sk0_2,sk0_3),difference(sk0_3,sk0_2)) ),
    inference(resolution,[status(thm)],[f84,f51]) ).

fof(f141,plain,
    ( spl0_4
    | spl0_5 ),
    inference(split_clause,[status(thm)],[f140,f134,f137]) ).

fof(f144,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f135,f58]) ).

fof(f145,plain,
    ~ spl0_4,
    inference(contradiction_clause,[status(thm)],[f144]) ).

fof(f146,plain,
    ( $false
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f138,f61]) ).

fof(f147,plain,
    ~ spl0_5,
    inference(contradiction_clause,[status(thm)],[f146]) ).

fof(f148,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f141,f145,f147]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET630+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n022.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr 29 21:38:28 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 0.13/0.36  % Refutation found
% 0.13/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38  % Elapsed time: 0.025073 seconds
% 0.13/0.38  % CPU time: 0.040980 seconds
% 0.13/0.38  % Total memory used: 12.924 MB
% 0.13/0.38  % Net memory used: 12.859 MB
%------------------------------------------------------------------------------