TSTP Solution File: SET631+3 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n019.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:34:52 EDT 2023

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   7 unt;   0 def)
%            Number of atoms       :   74 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   76 (  31   ~;  25   |;  15   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   63 (;  54   !;   9   ?)

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

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

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

fof(f4,conjecture,
    ! [B,C,D] :
      ( intersect(B,difference(C,D))
     => intersect(B,C) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ~ ! [B,C,D] :
        ( intersect(B,difference(C,D))
       => intersect(B,C) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

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

fof(f7,plain,
    ( ! [B,C,D] :
        ( ~ member(D,difference(B,C))
        | ( member(D,B)
          & ~ member(D,C) ) )
    & ! [B,C,D] :
        ( member(D,difference(B,C))
        | ~ member(D,B)
        | member(D,C) ) ),
    inference(miniscoping,[status(esa)],[f6]) ).

fof(f8,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,difference(X1,X2))
      | member(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f7]) ).

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

fof(f12,plain,
    ( ! [B,C] :
        ( ~ intersect(B,C)
        | ? [D] :
            ( member(D,B)
            & member(D,C) ) )
    & ! [B,C] :
        ( intersect(B,C)
        | ! [D] :
            ( ~ member(D,B)
            | ~ member(D,C) ) ) ),
    inference(miniscoping,[status(esa)],[f11]) ).

fof(f13,plain,
    ( ! [B,C] :
        ( ~ intersect(B,C)
        | ( member(sk0_0(C,B),B)
          & member(sk0_0(C,B),C) ) )
    & ! [B,C] :
        ( intersect(B,C)
        | ! [D] :
            ( ~ member(D,B)
            | ~ member(D,C) ) ) ),
    inference(skolemization,[status(esa)],[f12]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
      | member(sk0_0(X1,X0),X0) ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
      | member(sk0_0(X1,X0),X1) ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

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

fof(f17,plain,
    ! [B,C] :
      ( ~ intersect(B,C)
      | intersect(C,B) ),
    inference(pre_NNF_transformation,[status(esa)],[f3]) ).

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

fof(f19,plain,
    ? [B,C,D] :
      ( intersect(B,difference(C,D))
      & ~ intersect(B,C) ),
    inference(pre_NNF_transformation,[status(esa)],[f5]) ).

fof(f20,plain,
    ? [B,C] :
      ( ? [D] : intersect(B,difference(C,D))
      & ~ intersect(B,C) ),
    inference(miniscoping,[status(esa)],[f19]) ).

fof(f21,plain,
    ( intersect(sk0_1,difference(sk0_2,sk0_3))
    & ~ intersect(sk0_1,sk0_2) ),
    inference(skolemization,[status(esa)],[f20]) ).

fof(f22,plain,
    intersect(sk0_1,difference(sk0_2,sk0_3)),
    inference(cnf_transformation,[status(esa)],[f21]) ).

fof(f23,plain,
    ~ intersect(sk0_1,sk0_2),
    inference(cnf_transformation,[status(esa)],[f21]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( member(sk0_0(X0,X1),X1)
      | ~ intersect(X0,X1) ),
    inference(resolution,[status(thm)],[f14,f18]) ).

fof(f28,plain,
    member(sk0_0(sk0_1,difference(sk0_2,sk0_3)),difference(sk0_2,sk0_3)),
    inference(resolution,[status(thm)],[f27,f22]) ).

fof(f33,plain,
    member(sk0_0(sk0_1,difference(sk0_2,sk0_3)),sk0_2),
    inference(resolution,[status(thm)],[f28,f8]) ).

fof(f37,plain,
    ! [X0] :
      ( intersect(X0,sk0_2)
      | ~ member(sk0_0(sk0_1,difference(sk0_2,sk0_3)),X0) ),
    inference(resolution,[status(thm)],[f33,f16]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( member(sk0_0(X0,X1),X0)
      | ~ intersect(X0,X1) ),
    inference(resolution,[status(thm)],[f15,f18]) ).

fof(f64,plain,
    member(sk0_0(sk0_1,difference(sk0_2,sk0_3)),sk0_1),
    inference(resolution,[status(thm)],[f62,f22]) ).

fof(f69,plain,
    intersect(sk0_1,sk0_2),
    inference(resolution,[status(thm)],[f37,f64]) ).

fof(f70,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f69,f23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET631+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n019.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  : 300
% 0.13/0.34  % DateTime : Tue May 30 10:15:10 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 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.21/0.58  % Elapsed time: 0.013184 seconds
% 0.21/0.58  % CPU time: 0.031891 seconds
% 0.21/0.58  % Memory used: 1.899 MB
%------------------------------------------------------------------------------