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

% Computer : n021.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:39:55 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   7 unt;   0 def)
%            Number of atoms       :   36 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  10   ~;   5   |;   8   &)
%                                         (   0 <=>;   4  =>;   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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   28 (  22   !;   6   ?)

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

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

fof(f11,conjecture,
    ! [B,C,D] :
      ( ( subset(B,C)
        & intersection(C,D) = empty_set )
     => intersection(B,D) = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,negated_conjecture,
    ~ ! [B,C,D] :
        ( ( subset(B,C)
          & intersection(C,D) = empty_set )
       => intersection(B,D) = empty_set ),
    inference(negated_conjecture,[status(cth)],[f11]) ).

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

fof(f14,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | X0 = empty_set ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f15,plain,
    ! [B,C,D] :
      ( ~ subset(B,C)
      | subset(intersection(B,D),intersection(C,D)) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

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

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

fof(f50,plain,
    ? [B,C,D] :
      ( subset(B,C)
      & intersection(C,D) = empty_set
      & intersection(B,D) != empty_set ),
    inference(pre_NNF_transformation,[status(esa)],[f12]) ).

fof(f51,plain,
    ? [B,D] :
      ( ? [C] :
          ( subset(B,C)
          & intersection(C,D) = empty_set )
      & intersection(B,D) != empty_set ),
    inference(miniscoping,[status(esa)],[f50]) ).

fof(f52,plain,
    ( subset(sk0_3,sk0_5)
    & intersection(sk0_5,sk0_4) = empty_set
    & intersection(sk0_3,sk0_4) != empty_set ),
    inference(skolemization,[status(esa)],[f51]) ).

fof(f53,plain,
    subset(sk0_3,sk0_5),
    inference(cnf_transformation,[status(esa)],[f52]) ).

fof(f54,plain,
    intersection(sk0_5,sk0_4) = empty_set,
    inference(cnf_transformation,[status(esa)],[f52]) ).

fof(f55,plain,
    intersection(sk0_3,sk0_4) != empty_set,
    inference(cnf_transformation,[status(esa)],[f52]) ).

fof(f78,plain,
    ! [X0] : subset(intersection(sk0_3,X0),intersection(sk0_5,X0)),
    inference(resolution,[status(thm)],[f17,f53]) ).

fof(f169,plain,
    subset(intersection(sk0_3,sk0_4),empty_set),
    inference(paramodulation,[status(thm)],[f54,f78]) ).

fof(f172,plain,
    intersection(sk0_3,sk0_4) = empty_set,
    inference(resolution,[status(thm)],[f169,f14]) ).

fof(f173,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f172,f55]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET596+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n021.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:46:25 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38  % Elapsed time: 0.021391 seconds
% 0.13/0.38  % CPU time: 0.038281 seconds
% 0.13/0.38  % Total memory used: 12.935 MB
% 0.13/0.38  % Net memory used: 12.876 MB
%------------------------------------------------------------------------------