TSTP Solution File: SET586+3 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SET586+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 : Tue Apr 30 20:39:53 EDT 2024

% Result   : Theorem 0.16s 0.33s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   42 (   6 unt;   0 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  104 (  42   ~;  39   |;  14   &)
%                                         (   6 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   64 (  56   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [B,C,D] :
      ( member(D,intersection(B,C))
    <=> ( member(D,B)
        & member(D,C) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f7,negated_conjecture,
    ~ ! [B,C,D] :
        ( subset(B,C)
       => subset(intersection(B,D),intersection(C,D)) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

fof(f8,plain,
    ! [B,C,D] :
      ( ( ~ member(D,intersection(B,C))
        | ( member(D,B)
          & member(D,C) ) )
      & ( member(D,intersection(B,C))
        | ~ member(D,B)
        | ~ member(D,C) ) ),
    inference(NNF_transformation,[status(esa)],[f1]) ).

fof(f9,plain,
    ( ! [B,C,D] :
        ( ~ member(D,intersection(B,C))
        | ( member(D,B)
          & member(D,C) ) )
    & ! [B,C,D] :
        ( member(D,intersection(B,C))
        | ~ member(D,B)
        | ~ member(D,C) ) ),
    inference(miniscoping,[status(esa)],[f8]) ).

fof(f10,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f11,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( member(X0,intersection(X1,X2))
      | ~ member(X0,X1)
      | ~ member(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f13,plain,
    ! [B,C] :
      ( subset(B,C)
    <=> ! [D] :
          ( ~ member(D,B)
          | member(D,C) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f14,plain,
    ! [B,C] :
      ( ( ~ subset(B,C)
        | ! [D] :
            ( ~ member(D,B)
            | member(D,C) ) )
      & ( subset(B,C)
        | ? [D] :
            ( member(D,B)
            & ~ member(D,C) ) ) ),
    inference(NNF_transformation,[status(esa)],[f13]) ).

fof(f15,plain,
    ( ! [B,C] :
        ( ~ subset(B,C)
        | ! [D] :
            ( ~ member(D,B)
            | member(D,C) ) )
    & ! [B,C] :
        ( subset(B,C)
        | ? [D] :
            ( member(D,B)
            & ~ member(D,C) ) ) ),
    inference(miniscoping,[status(esa)],[f14]) ).

fof(f16,plain,
    ( ! [B,C] :
        ( ~ subset(B,C)
        | ! [D] :
            ( ~ member(D,B)
            | member(D,C) ) )
    & ! [B,C] :
        ( subset(B,C)
        | ( member(sk0_0(C,B),B)
          & ~ member(sk0_0(C,B),C) ) ) ),
    inference(skolemization,[status(esa)],[f15]) ).

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

fof(f18,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sk0_0(X1,X0),X0) ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ member(sk0_0(X1,X0),X1) ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f29,plain,
    ? [B,C,D] :
      ( subset(B,C)
      & ~ subset(intersection(B,D),intersection(C,D)) ),
    inference(pre_NNF_transformation,[status(esa)],[f7]) ).

fof(f30,plain,
    ? [B,C] :
      ( subset(B,C)
      & ? [D] : ~ subset(intersection(B,D),intersection(C,D)) ),
    inference(miniscoping,[status(esa)],[f29]) ).

fof(f31,plain,
    ( subset(sk0_2,sk0_3)
    & ~ subset(intersection(sk0_2,sk0_4),intersection(sk0_3,sk0_4)) ),
    inference(skolemization,[status(esa)],[f30]) ).

fof(f32,plain,
    subset(sk0_2,sk0_3),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f33,plain,
    ~ subset(intersection(sk0_2,sk0_4),intersection(sk0_3,sk0_4)),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f36,plain,
    ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),intersection(sk0_3,sk0_4)),
    inference(resolution,[status(thm)],[f19,f33]) ).

fof(f37,plain,
    ( spl0_0
  <=> member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_3) ),
    introduced(split_symbol_definition) ).

fof(f39,plain,
    ( ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_3)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f37]) ).

fof(f40,plain,
    ( spl0_1
  <=> member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_4) ),
    introduced(split_symbol_definition) ).

fof(f42,plain,
    ( ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_4)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f40]) ).

fof(f43,plain,
    ( ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_3)
    | ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_4) ),
    inference(resolution,[status(thm)],[f36,f12]) ).

fof(f44,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f43,f37,f40]) ).

fof(f50,plain,
    ! [X0] :
      ( ~ subset(X0,sk0_3)
      | ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),X0)
      | spl0_0 ),
    inference(resolution,[status(thm)],[f39,f17]) ).

fof(f85,plain,
    ( ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_2)
    | spl0_0 ),
    inference(resolution,[status(thm)],[f50,f32]) ).

fof(f91,plain,
    ( spl0_4
  <=> member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_2) ),
    introduced(split_symbol_definition) ).

fof(f93,plain,
    ( ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),sk0_2)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f91]) ).

fof(f101,plain,
    ! [X0] :
      ( ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),intersection(X0,sk0_4))
      | spl0_1 ),
    inference(resolution,[status(thm)],[f42,f11]) ).

fof(f105,plain,
    ! [X0] :
      ( ~ member(sk0_0(intersection(sk0_3,sk0_4),intersection(sk0_2,sk0_4)),intersection(sk0_2,X0))
      | spl0_4 ),
    inference(resolution,[status(thm)],[f93,f10]) ).

fof(f107,plain,
    ( subset(intersection(sk0_2,sk0_4),intersection(sk0_3,sk0_4))
    | spl0_1 ),
    inference(resolution,[status(thm)],[f101,f18]) ).

fof(f108,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f107,f33]) ).

fof(f109,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f108]) ).

fof(f120,plain,
    ( subset(intersection(sk0_2,sk0_4),intersection(sk0_3,sk0_4))
    | spl0_4 ),
    inference(resolution,[status(thm)],[f105,f18]) ).

fof(f121,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f120,f33]) ).

fof(f122,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f121]) ).

fof(f123,plain,
    ( ~ spl0_4
    | spl0_0 ),
    inference(split_clause,[status(thm)],[f85,f91,f37]) ).

fof(f124,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f44,f109,f122,f123]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : SET586+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n028.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Mon Apr 29 22:09:14 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.6.0
% 0.16/0.33  % Refutation found
% 0.16/0.33  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.33  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.35  % Elapsed time: 0.022075 seconds
% 0.16/0.35  % CPU time: 0.058217 seconds
% 0.16/0.35  % Total memory used: 15.365 MB
% 0.16/0.35  % Net memory used: 15.316 MB
%------------------------------------------------------------------------------