TSTP Solution File: SET629+3 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n023.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 15:08:57 EDT 2024

% Result   : Theorem 0.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (   9 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   95 (  40   ~;  29   |;  19   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   67 (  59   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f102,plain,
    $false,
    inference(resolution,[],[f95,f47]) ).

fof(f47,plain,
    intersect(intersection(sK0,sK1),difference(sK0,sK1)),
    inference(resolution,[],[f35,f28]) ).

fof(f28,plain,
    ~ disjoint(intersection(sK0,sK1),difference(sK0,sK1)),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ~ disjoint(intersection(sK0,sK1),difference(sK0,sK1)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f14]) ).

fof(f14,plain,
    ( ? [X0,X1] : ~ disjoint(intersection(X0,X1),difference(X0,X1))
   => ~ disjoint(intersection(sK0,sK1),difference(sK0,sK1)) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ? [X0,X1] : ~ disjoint(intersection(X0,X1),difference(X0,X1)),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,negated_conjecture,
    ~ ! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
    inference(negated_conjecture,[],[f8]) ).

fof(f8,conjecture,
    ! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_and_difference_disjoint) ).

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

fof(f13,plain,
    ! [X0,X1] :
      ( disjoint(X0,X1)
      | intersect(X0,X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ~ intersect(X0,X1)
     => disjoint(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
    <=> ~ intersect(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).

fof(f95,plain,
    ~ intersect(intersection(sK0,sK1),difference(sK0,sK1)),
    inference(resolution,[],[f56,f78]) ).

fof(f78,plain,
    ~ member(sK3(intersection(sK0,sK1),difference(sK0,sK1)),sK1),
    inference(resolution,[],[f51,f47]) ).

fof(f51,plain,
    ! [X2,X0,X1] :
      ( ~ intersect(X0,difference(X1,X2))
      | ~ member(sK3(X0,difference(X1,X2)),X2) ),
    inference(resolution,[],[f40,f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( member(sK3(X0,X1),X1)
      | ~ intersect(X0,X1) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( intersect(X0,X1)
        | ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) )
      & ( ( member(sK3(X0,X1),X1)
          & member(sK3(X0,X1),X0) )
        | ~ intersect(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f21,f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( member(X3,X1)
          & member(X3,X0) )
     => ( member(sK3(X0,X1),X1)
        & member(sK3(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ( intersect(X0,X1)
        | ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) )
      & ( ? [X3] :
            ( member(X3,X1)
            & member(X3,X0) )
        | ~ intersect(X0,X1) ) ),
    inference(rectify,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ( intersect(X0,X1)
        | ! [X2] :
            ( ~ member(X2,X1)
            | ~ member(X2,X0) ) )
      & ( ? [X2] :
            ( member(X2,X1)
            & member(X2,X0) )
        | ~ intersect(X0,X1) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( intersect(X0,X1)
    <=> ? [X2] :
          ( member(X2,X1)
          & member(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).

fof(f40,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( ~ member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(flattening,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( ~ member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( member(X2,difference(X0,X1))
    <=> ( ~ member(X2,X1)
        & member(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).

fof(f56,plain,
    ! [X2,X0,X1] :
      ( member(sK3(intersection(X0,X1),X2),X1)
      | ~ intersect(intersection(X0,X1),X2) ),
    inference(resolution,[],[f43,f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( member(sK3(X0,X1),X0)
      | ~ intersect(X0,X1) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f43,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,intersection(X0,X1))
      | member(X2,X1) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(flattening,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X1)
        | ~ member(X2,X0) )
      & ( ( member(X2,X1)
          & member(X2,X0) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(nnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1,X2] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X1)
        & member(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n023.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Apr 30 01:35:25 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.36  % (11396)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37  % (11401)WARNING: value z3 for option sas not known
% 0.21/0.37  % (11402)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.37  % (11401)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.37  % (11403)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.37  % (11400)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.37  % (11404)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.37  % (11399)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.37  % (11405)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.37  TRYING [1]
% 0.21/0.37  TRYING [2]
% 0.21/0.38  TRYING [3]
% 0.21/0.38  % (11404)First to succeed.
% 0.21/0.38  TRYING [1]
% 0.21/0.38  TRYING [2]
% 0.21/0.38  % (11404)Refutation found. Thanks to Tanya!
% 0.21/0.38  % SZS status Theorem for theBenchmark
% 0.21/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38  % (11404)------------------------------
% 0.21/0.38  % (11404)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.38  % (11404)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (11404)Memory used [KB]: 834
% 0.21/0.38  % (11404)Time elapsed: 0.006 s
% 0.21/0.38  % (11404)Instructions burned: 7 (million)
% 0.21/0.38  % (11404)------------------------------
% 0.21/0.38  % (11404)------------------------------
% 0.21/0.38  % (11396)Success in time 0.022 s
%------------------------------------------------------------------------------