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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET596+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 : 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 : Sun May  5 09:14:20 EDT 2024

% Result   : Theorem 0.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (  10 unt;   0 def)
%            Number of atoms       :   82 (  21 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   83 (  34   ~;  20   |;  20   &)
%                                         (   2 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   61 (  49   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f160,plain,
    $false,
    inference(trivial_inequality_removal,[],[f153]) ).

fof(f153,plain,
    empty_set != empty_set,
    inference(superposition,[],[f34,f132]) ).

fof(f132,plain,
    empty_set = intersection(sK0,sK2),
    inference(resolution,[],[f112,f37]) ).

fof(f37,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0] :
      ( empty_set = X0
      | ~ subset(X0,empty_set) ),
    inference(ennf_transformation,[],[f1]) ).

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

fof(f112,plain,
    ! [X0] : subset(intersection(sK0,sK2),X0),
    inference(resolution,[],[f102,f47]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( member(sK4(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK4(X0,X1),X1)
          & member(sK4(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f27,f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ member(X2,X1)
          & member(X2,X0) )
     => ( ~ member(sK4(X0,X1),X1)
        & member(sK4(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f26]) ).

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

fof(f16,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).

fof(f102,plain,
    ! [X0] : ~ member(X0,intersection(sK0,sK2)),
    inference(resolution,[],[f92,f32]) ).

fof(f32,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f19]) ).

fof(f19,plain,
    ( empty_set != intersection(sK0,sK2)
    & empty_set = intersection(sK1,sK2)
    & subset(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f18]) ).

fof(f18,plain,
    ( ? [X0,X1,X2] :
        ( empty_set != intersection(X0,X2)
        & empty_set = intersection(X1,X2)
        & subset(X0,X1) )
   => ( empty_set != intersection(sK0,sK2)
      & empty_set = intersection(sK1,sK2)
      & subset(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f14,plain,
    ? [X0,X1,X2] :
      ( empty_set != intersection(X0,X2)
      & empty_set = intersection(X1,X2)
      & subset(X0,X1) ),
    inference(flattening,[],[f13]) ).

fof(f13,plain,
    ? [X0,X1,X2] :
      ( empty_set != intersection(X0,X2)
      & empty_set = intersection(X1,X2)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( empty_set = intersection(X1,X2)
          & subset(X0,X1) )
       => empty_set = intersection(X0,X2) ),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X0,X1,X2] :
      ( ( empty_set = intersection(X1,X2)
        & subset(X0,X1) )
     => empty_set = intersection(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th55) ).

fof(f92,plain,
    ! [X0,X1] :
      ( ~ subset(X0,sK1)
      | ~ member(X1,intersection(X0,sK2)) ),
    inference(resolution,[],[f89,f78]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( ~ subset(X1,empty_set)
      | ~ member(X0,X1) ),
    inference(resolution,[],[f46,f35]) ).

fof(f35,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] : ~ member(X0,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).

fof(f46,plain,
    ! [X3,X0,X1] :
      ( member(X3,X1)
      | ~ member(X3,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f89,plain,
    ! [X0] :
      ( subset(intersection(X0,sK2),empty_set)
      | ~ subset(X0,sK1) ),
    inference(superposition,[],[f49,f33]) ).

fof(f33,plain,
    empty_set = intersection(sK1,sK2),
    inference(cnf_transformation,[],[f19]) ).

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

fof(f17,plain,
    ! [X0,X1,X2] :
      ( subset(intersection(X0,X2),intersection(X1,X2))
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => subset(intersection(X0,X2),intersection(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subset) ).

fof(f34,plain,
    empty_set != intersection(sK0,sK2),
    inference(cnf_transformation,[],[f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SET596+3 : TPTP v8.1.2. Released v2.2.0.
% 0.14/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n021.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   : Fri May  3 16:49:08 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.36  % (6629)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37  % (6633)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.37  TRYING [1]
% 0.21/0.37  TRYING [2]
% 0.21/0.37  TRYING [3]
% 0.21/0.37  % (6632)WARNING: value z3 for option sas not known
% 0.21/0.37  % (6630)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38  % (6631)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38  % (6634)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.38  % (6635)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.38  % (6636)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.38  % (6632)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.38  TRYING [4]
% 0.21/0.38  TRYING [1]
% 0.21/0.38  % (6635)First to succeed.
% 0.21/0.38  TRYING [2]
% 0.21/0.38  % (6632)Also succeeded, but the first one will report.
% 0.21/0.38  % (6635)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6629"
% 0.21/0.38  TRYING [5]
% 0.21/0.38  TRYING [1]
% 0.21/0.38  % (6635)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  % (6635)------------------------------
% 0.21/0.38  % (6635)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (6635)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (6635)Memory used [KB]: 842
% 0.21/0.38  % (6635)Time elapsed: 0.006 s
% 0.21/0.38  % (6635)Instructions burned: 7 (million)
% 0.21/0.38  % (6629)Success in time 0.022 s
%------------------------------------------------------------------------------