TSTP Solution File: SEU132+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEU132+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n017.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:27:18 EDT 2024

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   44 (  12 unt;   0 def)
%            Number of atoms       :  146 (   5 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  167 (  65   ~;  56   |;  32   &)
%                                         (   8 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 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   :  105 (  93   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7685,plain,
    $false,
    inference(subsumption_resolution,[],[f7669,f331]) ).

fof(f331,plain,
    ~ sP0(sK4,sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),sK3),
    inference(unit_resulting_resolution,[],[f91,f69,f59]) ).

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

fof(f36,plain,
    ! [X0,X1,X2] :
      ( ( sP1(X0,X1,X2)
        | ( ( ~ sP0(X1,sK6(X0,X1,X2),X0)
            | ~ in(sK6(X0,X1,X2),X2) )
          & ( sP0(X1,sK6(X0,X1,X2),X0)
            | in(sK6(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,[sK6])],[f34,f35]) ).

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

fof(f34,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,[],[f33]) ).

fof(f33,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,[],[f25]) ).

fof(f25,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(f69,plain,
    ! [X0,X1] : sP1(X0,X1,set_difference(X0,X1)),
    inference(equality_resolution,[],[f65]) ).

fof(f65,plain,
    ! [X2,X0,X1] :
      ( sP1(X0,X1,X2)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f40]) ).

fof(f40,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(X0,X1) = X2
        | ~ sP1(X0,X1,X2) )
      & ( sP1(X0,X1,X2)
        | set_difference(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( set_difference(X0,X1) = X2
    <=> sP1(X0,X1,X2) ),
    inference(definition_folding,[],[f3,f25,f24]) ).

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

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( set_difference(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( ~ in(X3,X1)
            & in(X3,X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).

fof(f91,plain,
    ~ in(sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),set_difference(sK3,sK4)),
    inference(unit_resulting_resolution,[],[f46,f55]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ~ in(sK5(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK5(X0,X1),X1)
          & in(sK5(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f30,f31]) ).

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

fof(f30,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,[],[f29]) ).

fof(f29,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,[],[f21]) ).

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

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

fof(f46,plain,
    ~ subset(set_difference(sK2,sK4),set_difference(sK3,sK4)),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    ( ~ subset(set_difference(sK2,sK4),set_difference(sK3,sK4))
    & subset(sK2,sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f18,f27]) ).

fof(f27,plain,
    ( ? [X0,X1,X2] :
        ( ~ subset(set_difference(X0,X2),set_difference(X1,X2))
        & subset(X0,X1) )
   => ( ~ subset(set_difference(sK2,sK4),set_difference(sK3,sK4))
      & subset(sK2,sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ? [X0,X1,X2] :
      ( ~ subset(set_difference(X0,X2),set_difference(X1,X2))
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( subset(X0,X1)
       => subset(set_difference(X0,X2),set_difference(X1,X2)) ),
    inference(negated_conjecture,[],[f10]) ).

fof(f10,conjecture,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => subset(set_difference(X0,X2),set_difference(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_xboole_1) ).

fof(f7669,plain,
    sP0(sK4,sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),sK3),
    inference(unit_resulting_resolution,[],[f7424,f7446,f64]) ).

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

fof(f39,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,[],[f38]) ).

fof(f38,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,[],[f37]) ).

fof(f37,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,[],[f24]) ).

fof(f7446,plain,
    in(sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),sK3),
    inference(unit_resulting_resolution,[],[f45,f7425,f53]) ).

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

fof(f7425,plain,
    in(sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),sK2),
    inference(unit_resulting_resolution,[],[f167,f62]) ).

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

fof(f167,plain,
    sP0(sK4,sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),sK2),
    inference(unit_resulting_resolution,[],[f88,f69,f58]) ).

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

fof(f88,plain,
    in(sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),set_difference(sK2,sK4)),
    inference(unit_resulting_resolution,[],[f46,f54]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK5(X0,X1),X0) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f45,plain,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f28]) ).

fof(f7424,plain,
    ~ in(sK5(set_difference(sK2,sK4),set_difference(sK3,sK4)),sK4),
    inference(unit_resulting_resolution,[],[f167,f63]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEU132+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n017.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 10:28:51 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.36  % (17552)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (17555)WARNING: value z3 for option sas not known
% 0.13/0.37  % (17556)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (17553)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37  % (17554)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  % (17555)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.13/0.37  % (17558)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.13/0.37  % (17557)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.13/0.37  % (17559)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.13/0.37  TRYING [1]
% 0.13/0.38  TRYING [2]
% 0.13/0.38  TRYING [3]
% 0.13/0.38  TRYING [1]
% 0.13/0.38  TRYING [4]
% 0.13/0.38  TRYING [2]
% 0.13/0.39  TRYING [3]
% 0.13/0.39  TRYING [5]
% 0.20/0.42  TRYING [6]
% 0.20/0.42  TRYING [4]
% 0.20/0.47  TRYING [7]
% 0.20/0.50  % (17559)First to succeed.
% 0.20/0.50  % (17559)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-17552"
% 0.20/0.50  % (17559)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (17559)------------------------------
% 0.20/0.50  % (17559)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.50  % (17559)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (17559)Memory used [KB]: 2027
% 0.20/0.50  % (17559)Time elapsed: 0.130 s
% 0.20/0.50  % (17559)Instructions burned: 245 (million)
% 0.20/0.50  % (17552)Success in time 0.147 s
%------------------------------------------------------------------------------