TSTP Solution File: SEU149+2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU149+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n020.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 Aug 31 18:32:09 EDT 2022

% Result   : Theorem 1.44s 0.55s
% Output   : Refutation 1.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (   8 unt;   0 def)
%            Number of atoms       :  155 ( 107 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  191 (  68   ~;  70   |;  39   &)
%                                         (   8 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   85 (  72   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f456,plain,
    $false,
    inference(unit_resulting_resolution,[],[f251,f408,f387]) ).

fof(f387,plain,
    ! [X2,X1] :
      ( ~ in(X2,unordered_pair(X1,X1))
      | X1 = X2 ),
    inference(equality_resolution,[],[f364]) ).

fof(f364,plain,
    ! [X2,X0,X1] :
      ( X1 = X2
      | ~ in(X2,X0)
      | unordered_pair(X1,X1) != X0 ),
    inference(definition_unfolding,[],[f329,f332]) ).

fof(f332,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f64]) ).

fof(f64,axiom,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).

fof(f329,plain,
    ! [X2,X0,X1] :
      ( X1 = X2
      | ~ in(X2,X0)
      | singleton(X1) != X0 ),
    inference(cnf_transformation,[],[f225]) ).

fof(f225,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( X1 = X2
              | ~ in(X2,X0) )
            & ( in(X2,X0)
              | X1 != X2 ) )
        | singleton(X1) != X0 )
      & ( singleton(X1) = X0
        | ( ( ~ in(sK15(X0,X1),X0)
            | sK15(X0,X1) != X1 )
          & ( in(sK15(X0,X1),X0)
            | sK15(X0,X1) = X1 ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f223,f224]) ).

fof(f224,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( ( ~ in(X3,X0)
            | X1 != X3 )
          & ( in(X3,X0)
            | X1 = X3 ) )
     => ( ( ~ in(sK15(X0,X1),X0)
          | sK15(X0,X1) != X1 )
        & ( in(sK15(X0,X1),X0)
          | sK15(X0,X1) = X1 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f223,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( X1 = X2
              | ~ in(X2,X0) )
            & ( in(X2,X0)
              | X1 != X2 ) )
        | singleton(X1) != X0 )
      & ( singleton(X1) = X0
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | X1 != X3 )
            & ( in(X3,X0)
              | X1 = X3 ) ) ) ),
    inference(rectify,[],[f222]) ).

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

fof(f80,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( X1 = X2
        <=> in(X2,X0) )
    <=> singleton(X1) = X0 ),
    inference(rectify,[],[f7]) ).

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

fof(f408,plain,
    in(sK5,unordered_pair(sK3,sK3)),
    inference(superposition,[],[f383,f342]) ).

fof(f342,plain,
    unordered_pair(sK5,sK4) = unordered_pair(sK3,sK3),
    inference(definition_unfolding,[],[f250,f332]) ).

fof(f250,plain,
    unordered_pair(sK5,sK4) = singleton(sK3),
    inference(cnf_transformation,[],[f162]) ).

fof(f162,plain,
    ( sK5 != sK3
    & unordered_pair(sK5,sK4) = singleton(sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f135,f161]) ).

fof(f161,plain,
    ( ? [X0,X1,X2] :
        ( X0 != X2
        & singleton(X0) = unordered_pair(X2,X1) )
   => ( sK5 != sK3
      & unordered_pair(sK5,sK4) = singleton(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f135,plain,
    ? [X0,X1,X2] :
      ( X0 != X2
      & singleton(X0) = unordered_pair(X2,X1) ),
    inference(ennf_transformation,[],[f76]) ).

fof(f76,plain,
    ~ ! [X1,X2,X0] :
        ( singleton(X0) = unordered_pair(X2,X1)
       => X0 = X2 ),
    inference(rectify,[],[f73]) ).

fof(f73,negated_conjecture,
    ~ ! [X0,X2,X1] :
        ( singleton(X0) = unordered_pair(X1,X2)
       => X0 = X1 ),
    inference(negated_conjecture,[],[f72]) ).

fof(f72,conjecture,
    ! [X0,X2,X1] :
      ( singleton(X0) = unordered_pair(X1,X2)
     => X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).

fof(f383,plain,
    ! [X3,X0] : in(X3,unordered_pair(X3,X0)),
    inference(equality_resolution,[],[f382]) ).

fof(f382,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | unordered_pair(X3,X0) != X1 ),
    inference(equality_resolution,[],[f296]) ).

fof(f296,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X1)
      | X2 != X3
      | unordered_pair(X2,X0) != X1 ),
    inference(cnf_transformation,[],[f196]) ).

fof(f196,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( X0 = X3
              | X2 = X3
              | ~ in(X3,X1) )
            & ( in(X3,X1)
              | ( X0 != X3
                & X2 != X3 ) ) )
        | unordered_pair(X2,X0) != X1 )
      & ( unordered_pair(X2,X0) = X1
        | ( ( ~ in(sK10(X0,X1,X2),X1)
            | ( sK10(X0,X1,X2) != X0
              & sK10(X0,X1,X2) != X2 ) )
          & ( in(sK10(X0,X1,X2),X1)
            | sK10(X0,X1,X2) = X0
            | sK10(X0,X1,X2) = X2 ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f194,f195]) ).

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

fof(f194,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( X0 = X3
              | X2 = X3
              | ~ in(X3,X1) )
            & ( in(X3,X1)
              | ( X0 != X3
                & X2 != X3 ) ) )
        | unordered_pair(X2,X0) != X1 )
      & ( unordered_pair(X2,X0) = X1
        | ? [X4] :
            ( ( ~ in(X4,X1)
              | ( X0 != X4
                & X2 != X4 ) )
            & ( in(X4,X1)
              | X0 = X4
              | X2 = X4 ) ) ) ),
    inference(rectify,[],[f193]) ).

fof(f193,plain,
    ! [X0,X2,X1] :
      ( ( ! [X3] :
            ( ( X0 = X3
              | X1 = X3
              | ~ in(X3,X2) )
            & ( in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) ) )
        | unordered_pair(X1,X0) != X2 )
      & ( unordered_pair(X1,X0) = X2
        | ? [X3] :
            ( ( ~ in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) )
            & ( in(X3,X2)
              | X0 = X3
              | X1 = X3 ) ) ) ),
    inference(flattening,[],[f192]) ).

fof(f192,plain,
    ! [X0,X2,X1] :
      ( ( ! [X3] :
            ( ( X0 = X3
              | X1 = X3
              | ~ in(X3,X2) )
            & ( in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) ) )
        | unordered_pair(X1,X0) != X2 )
      & ( unordered_pair(X1,X0) = X2
        | ? [X3] :
            ( ( ~ in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) )
            & ( in(X3,X2)
              | X0 = X3
              | X1 = X3 ) ) ) ),
    inference(nnf_transformation,[],[f100]) ).

fof(f100,plain,
    ! [X0,X2,X1] :
      ( ! [X3] :
          ( ( X0 = X3
            | X1 = X3 )
        <=> in(X3,X2) )
    <=> unordered_pair(X1,X0) = X2 ),
    inference(rectify,[],[f10]) ).

fof(f10,axiom,
    ! [X1,X0,X2] :
      ( unordered_pair(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( X1 = X3
            | X0 = X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).

fof(f251,plain,
    sK5 != sK3,
    inference(cnf_transformation,[],[f162]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU149+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n020.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 14:48:00 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.19/0.51  % (10454)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.28/0.52  % (10464)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.28/0.52  % (10443)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.28/0.53  % (10456)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.28/0.53  % (10445)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.28/0.53  % (10449)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.28/0.53  % (10442)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.28/0.53  % (10446)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.28/0.53  TRYING [1]
% 1.28/0.53  % (10447)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.28/0.53  TRYING [2]
% 1.28/0.53  % (10444)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.28/0.53  % (10448)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.28/0.53  % (10452)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.28/0.54  % (10455)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.28/0.54  % (10453)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.28/0.54  % (10457)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.28/0.54  % (10459)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.28/0.54  % (10465)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.44/0.54  % (10450)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.44/0.54  % (10470)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.44/0.55  % (10468)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.44/0.55  % (10471)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.44/0.55  % (10451)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.44/0.55  % (10466)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.44/0.55  % (10469)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.44/0.55  % (10450)Instruction limit reached!
% 1.44/0.55  % (10450)------------------------------
% 1.44/0.55  % (10450)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.55  % (10443)First to succeed.
% 1.44/0.55  % (10450)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.55  % (10450)Termination reason: Unknown
% 1.44/0.55  % (10450)Termination phase: Preprocessing 3
% 1.44/0.55  
% 1.44/0.55  % (10450)Memory used [KB]: 1023
% 1.44/0.55  % (10450)Time elapsed: 0.003 s
% 1.44/0.55  % (10450)Instructions burned: 3 (million)
% 1.44/0.55  % (10450)------------------------------
% 1.44/0.55  % (10450)------------------------------
% 1.44/0.55  TRYING [1]
% 1.44/0.55  TRYING [2]
% 1.44/0.55  % (10462)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.44/0.55  % (10443)Refutation found. Thanks to Tanya!
% 1.44/0.55  % SZS status Theorem for theBenchmark
% 1.44/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 1.44/0.55  % (10443)------------------------------
% 1.44/0.55  % (10443)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.55  % (10443)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.55  % (10443)Termination reason: Refutation
% 1.44/0.55  
% 1.44/0.55  % (10443)Memory used [KB]: 5628
% 1.44/0.55  % (10443)Time elapsed: 0.138 s
% 1.44/0.55  % (10443)Instructions burned: 11 (million)
% 1.44/0.55  % (10443)------------------------------
% 1.44/0.55  % (10443)------------------------------
% 1.44/0.55  % (10441)Success in time 0.196 s
%------------------------------------------------------------------------------