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

% Computer : n028.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:33:27 EDT 2023

% Result   : Theorem 0.18s 0.56s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   8 unt;   0 def)
%            Number of atoms       :   31 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   30 (  14   ~;   9   |;   5   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   20 (;  19   !;   1   ?)

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

fof(f3,axiom,
    ! [B,C] :
      ( B = C
    <=> ( subset(B,C)
        & subset(C,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,conjecture,
    ! [B] : union(B,B) = B,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    ~ ! [B] : union(B,B) = B,
    inference(negated_conjecture,[status(cth)],[f8]) ).

fof(f10,plain,
    ! [B,C] :
      ( ~ subset(B,C)
      | union(B,C) = C ),
    inference(pre_NNF_transformation,[status(esa)],[f1]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | union(X0,X1) = X1 ),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f17,plain,
    ! [B,C] :
      ( ( B != C
        | ( subset(B,C)
          & subset(C,B) ) )
      & ( B = C
        | ~ subset(B,C)
        | ~ subset(C,B) ) ),
    inference(NNF_transformation,[status(esa)],[f3]) ).

fof(f18,plain,
    ( ! [B,C] :
        ( B != C
        | ( subset(B,C)
          & subset(C,B) ) )
    & ! [B,C] :
        ( B = C
        | ~ subset(B,C)
        | ~ subset(C,B) ) ),
    inference(miniscoping,[status(esa)],[f17]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( X0 != X1
      | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f38,plain,
    ? [B] : union(B,B) != B,
    inference(pre_NNF_transformation,[status(esa)],[f9]) ).

fof(f39,plain,
    union(sk0_2,sk0_2) != sk0_2,
    inference(skolemization,[status(esa)],[f38]) ).

fof(f40,plain,
    union(sk0_2,sk0_2) != sk0_2,
    inference(cnf_transformation,[status(esa)],[f39]) ).

fof(f41,plain,
    ! [X0] : subset(X0,X0),
    inference(destructive_equality_resolution,[status(esa)],[f19]) ).

fof(f43,plain,
    ~ subset(sk0_2,sk0_2),
    inference(resolution,[status(thm)],[f11,f40]) ).

fof(f55,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f43,f41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET002+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue May 30 10:25:47 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % Drodi V3.5.1
% 0.18/0.56  % Refutation found
% 0.18/0.56  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.56  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.56  % Elapsed time: 0.012971 seconds
% 0.18/0.56  % CPU time: 0.024156 seconds
% 0.18/0.56  % Memory used: 12.480 MB
%------------------------------------------------------------------------------