TSTP Solution File: SEU128+2 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s

% Computer : n012.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 : Sat Sep  2 00:06:38 EDT 2023

% Result   : Theorem 0.22s 0.64s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   45 (  15 unt;   0 def)
%            Number of atoms       :  151 (   8 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  165 (  59   ~;  52   |;  40   &)
%                                         (   8 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :  104 (;  89   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17536,plain,
    $false,
    inference(subsumption_resolution,[],[f17529,f8760]) ).

fof(f8760,plain,
    sP0(sK6,sK10(sK4,set_intersection2(sK5,sK6)),sK5),
    inference(unit_resulting_resolution,[],[f3435,f3439,f150]) ).

fof(f150,plain,
    ! [X2,X0,X1] :
      ( ~ in(X1,X0)
      | sP0(X0,X1,X2)
      | ~ in(X1,X2) ),
    inference(cnf_transformation,[],[f90]) ).

fof(f90,plain,
    ! [X0,X1,X2] :
      ( ( sP0(X0,X1,X2)
        | ~ in(X1,X0)
        | ~ in(X1,X2) )
      & ( ( in(X1,X0)
          & in(X1,X2) )
        | ~ sP0(X0,X1,X2) ) ),
    inference(rectify,[],[f89]) ).

fof(f89,plain,
    ! [X1,X3,X0] :
      ( ( sP0(X1,X3,X0)
        | ~ in(X3,X1)
        | ~ in(X3,X0) )
      & ( ( in(X3,X1)
          & in(X3,X0) )
        | ~ sP0(X1,X3,X0) ) ),
    inference(flattening,[],[f88]) ).

fof(f88,plain,
    ! [X1,X3,X0] :
      ( ( sP0(X1,X3,X0)
        | ~ in(X3,X1)
        | ~ in(X3,X0) )
      & ( ( in(X3,X1)
          & in(X3,X0) )
        | ~ sP0(X1,X3,X0) ) ),
    inference(nnf_transformation,[],[f61]) ).

fof(f61,plain,
    ! [X1,X3,X0] :
      ( sP0(X1,X3,X0)
    <=> ( in(X3,X1)
        & in(X3,X0) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f3439,plain,
    in(sK10(sK4,set_intersection2(sK5,sK6)),sK6),
    inference(unit_resulting_resolution,[],[f615,f105,f139]) ).

fof(f139,plain,
    ! [X3,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ in(X3,X0)
      | in(X3,X1) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f83,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK10(X0,X1),X1)
          & in(sK10(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f81,f82]) ).

fof(f82,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ in(X2,X1)
          & in(X2,X0) )
     => ( ~ in(sK10(X0,X1),X1)
        & in(sK10(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f81,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f80]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X2] :
            ( in(X2,X1)
            | ~ in(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f58]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.W6rZqxgwPD/Vampire---4.8_16752',d3_tarski) ).

fof(f105,plain,
    subset(sK4,sK6),
    inference(cnf_transformation,[],[f68]) ).

fof(f68,plain,
    ( ~ subset(sK4,set_intersection2(sK5,sK6))
    & subset(sK4,sK6)
    & subset(sK4,sK5) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f44,f67]) ).

fof(f67,plain,
    ( ? [X0,X1,X2] :
        ( ~ subset(X0,set_intersection2(X1,X2))
        & subset(X0,X2)
        & subset(X0,X1) )
   => ( ~ subset(sK4,set_intersection2(sK5,sK6))
      & subset(sK4,sK6)
      & subset(sK4,sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f44,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,set_intersection2(X1,X2))
      & subset(X0,X2)
      & subset(X0,X1) ),
    inference(flattening,[],[f43]) ).

fof(f43,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,set_intersection2(X1,X2))
      & subset(X0,X2)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( subset(X0,X2)
          & subset(X0,X1) )
       => subset(X0,set_intersection2(X1,X2)) ),
    inference(negated_conjecture,[],[f24]) ).

fof(f24,conjecture,
    ! [X0,X1,X2] :
      ( ( subset(X0,X2)
        & subset(X0,X1) )
     => subset(X0,set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.W6rZqxgwPD/Vampire---4.8_16752',t19_xboole_1) ).

fof(f615,plain,
    in(sK10(sK4,set_intersection2(sK5,sK6)),sK4),
    inference(unit_resulting_resolution,[],[f106,f140]) ).

fof(f140,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK10(X0,X1),X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f106,plain,
    ~ subset(sK4,set_intersection2(sK5,sK6)),
    inference(cnf_transformation,[],[f68]) ).

fof(f3435,plain,
    in(sK10(sK4,set_intersection2(sK5,sK6)),sK5),
    inference(unit_resulting_resolution,[],[f615,f104,f139]) ).

fof(f104,plain,
    subset(sK4,sK5),
    inference(cnf_transformation,[],[f68]) ).

fof(f17529,plain,
    ~ sP0(sK6,sK10(sK4,set_intersection2(sK5,sK6)),sK5),
    inference(unit_resulting_resolution,[],[f1299,f4492,f145]) ).

fof(f145,plain,
    ! [X2,X0,X1,X4] :
      ( ~ sP1(X0,X1,X2)
      | ~ sP0(X1,X4,X0)
      | in(X4,X2) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f87,plain,
    ! [X0,X1,X2] :
      ( ( sP1(X0,X1,X2)
        | ( ( ~ sP0(X1,sK11(X0,X1,X2),X0)
            | ~ in(sK11(X0,X1,X2),X2) )
          & ( sP0(X1,sK11(X0,X1,X2),X0)
            | in(sK11(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ sP0(X1,X4,X0) )
            & ( sP0(X1,X4,X0)
              | ~ in(X4,X2) ) )
        | ~ sP1(X0,X1,X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f85,f86]) ).

fof(f86,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ( ~ sP0(X1,X3,X0)
            | ~ in(X3,X2) )
          & ( sP0(X1,X3,X0)
            | in(X3,X2) ) )
     => ( ( ~ sP0(X1,sK11(X0,X1,X2),X0)
          | ~ in(sK11(X0,X1,X2),X2) )
        & ( sP0(X1,sK11(X0,X1,X2),X0)
          | in(sK11(X0,X1,X2),X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f85,plain,
    ! [X0,X1,X2] :
      ( ( sP1(X0,X1,X2)
        | ? [X3] :
            ( ( ~ sP0(X1,X3,X0)
              | ~ in(X3,X2) )
            & ( sP0(X1,X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ sP0(X1,X4,X0) )
            & ( sP0(X1,X4,X0)
              | ~ in(X4,X2) ) )
        | ~ sP1(X0,X1,X2) ) ),
    inference(rectify,[],[f84]) ).

fof(f84,plain,
    ! [X0,X1,X2] :
      ( ( sP1(X0,X1,X2)
        | ? [X3] :
            ( ( ~ sP0(X1,X3,X0)
              | ~ in(X3,X2) )
            & ( sP0(X1,X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ sP0(X1,X3,X0) )
            & ( sP0(X1,X3,X0)
              | ~ in(X3,X2) ) )
        | ~ sP1(X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f62]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( sP1(X0,X1,X2)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> sP0(X1,X3,X0) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).

fof(f4492,plain,
    ! [X0,X1] : sP1(X0,X1,set_intersection2(X0,X1)),
    inference(forward_demodulation,[],[f4483,f127]) ).

fof(f127,plain,
    ! [X0] : set_intersection2(X0,X0) = X0,
    inference(cnf_transformation,[],[f42]) ).

fof(f42,plain,
    ! [X0] : set_intersection2(X0,X0) = X0,
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ! [X0,X1] : set_intersection2(X0,X0) = X0,
    file('/export/starexec/sandbox/tmp/tmp.W6rZqxgwPD/Vampire---4.8_16752',idempotence_k3_xboole_0) ).

fof(f4483,plain,
    ! [X0,X1] : sP1(X0,X1,set_intersection2(set_intersection2(X0,X1),set_intersection2(X0,X1))),
    inference(unit_resulting_resolution,[],[f127,f151]) ).

fof(f151,plain,
    ! [X2,X0,X1] :
      ( set_intersection2(X0,X1) != X2
      | sP1(X0,X1,X2) ),
    inference(cnf_transformation,[],[f91]) ).

fof(f91,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X0,X1) = X2
        | ~ sP1(X0,X1,X2) )
      & ( sP1(X0,X1,X2)
        | set_intersection2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f63]) ).

fof(f63,plain,
    ! [X0,X1,X2] :
      ( set_intersection2(X0,X1) = X2
    <=> sP1(X0,X1,X2) ),
    inference(definition_folding,[],[f8,f62,f61]) ).

fof(f8,axiom,
    ! [X0,X1,X2] :
      ( set_intersection2(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X1)
            & in(X3,X0) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.W6rZqxgwPD/Vampire---4.8_16752',d3_xboole_0) ).

fof(f1299,plain,
    ~ in(sK10(sK4,set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6)),
    inference(unit_resulting_resolution,[],[f106,f141]) ).

fof(f141,plain,
    ! [X0,X1] :
      ( ~ in(sK10(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f83]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15  % Command    : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.36  % Computer : n012.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Wed Aug 30 14:02:23 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.42  % (16976)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.42  % (17020)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.22/0.42  % (17023)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.22/0.42  % (17021)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.22/0.42  % (17022)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 Vampire---4 for (569ds/0Mi)
% 0.22/0.42  % (17024)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 Vampire---4 for (531ds/0Mi)
% 0.22/0.42  % (17026)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 Vampire---4 for (497ds/0Mi)
% 0.22/0.43  % (17025)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 Vampire---4 for (522ds/0Mi)
% 0.22/0.43  TRYING [1]
% 0.22/0.43  TRYING [2]
% 0.22/0.43  TRYING [3]
% 0.22/0.44  TRYING [1]
% 0.22/0.44  TRYING [4]
% 0.22/0.44  TRYING [2]
% 0.22/0.46  TRYING [5]
% 0.22/0.46  TRYING [3]
% 0.22/0.51  TRYING [6]
% 0.22/0.53  TRYING [4]
% 0.22/0.59  TRYING [7]
% 0.22/0.64  % (17026)First to succeed.
% 0.22/0.64  % (17026)Refutation found. Thanks to Tanya!
% 0.22/0.64  % SZS status Theorem for Vampire---4
% 0.22/0.64  % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.64  % (17026)------------------------------
% 0.22/0.64  % (17026)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.22/0.64  % (17026)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.22/0.64  % (17026)Termination reason: Refutation
% 0.22/0.64  
% 0.22/0.64  % (17026)Memory used [KB]: 6140
% 0.22/0.64  % (17026)Time elapsed: 0.216 s
% 0.22/0.64  % (17026)------------------------------
% 0.22/0.64  % (17026)------------------------------
% 0.22/0.64  % (16976)Success in time 0.275 s
% 0.22/0.64  % Vampire---4.8 exiting
%------------------------------------------------------------------------------