TSTP Solution File: SEU230+3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU230+3 : TPTP v8.1.0. Released v3.2.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 : n022.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:42 EDT 2022

% Result   : Theorem 1.60s 0.58s
% Output   : Refutation 1.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   28 (  11 unt;   0 def)
%            Number of atoms       :  140 (  40 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :  179 (  67   ~;  68   |;  35   &)
%                                         (   6 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-3 aty)
%            Number of variables   :   67 (  58   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f247,plain,
    $false,
    inference(subsumption_resolution,[],[f240,f163]) ).

fof(f163,plain,
    ! [X3] : in(X3,singleton(X3)),
    inference(equality_resolution,[],[f162]) ).

fof(f162,plain,
    ! [X3,X0] :
      ( in(X3,X0)
      | singleton(X3) != X0 ),
    inference(equality_resolution,[],[f146]) ).

fof(f146,plain,
    ! [X3,X0,X1] :
      ( in(X3,X0)
      | X1 != X3
      | singleton(X1) != X0 ),
    inference(cnf_transformation,[],[f98]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ( singleton(X1) = X0
        | ( ( ~ in(sK11(X0,X1),X0)
            | sK11(X0,X1) != X1 )
          & ( in(sK11(X0,X1),X0)
            | sK11(X0,X1) = X1 ) ) )
      & ( ! [X3] :
            ( ( X1 = X3
              | ~ in(X3,X0) )
            & ( in(X3,X0)
              | X1 != X3 ) )
        | singleton(X1) != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f96,f97]) ).

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

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

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

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

fof(f240,plain,
    ~ in(sK4,singleton(sK4)),
    inference(resolution,[],[f165,f160]) ).

fof(f160,plain,
    ~ in(sK4,set_union2(sK4,singleton(sK4))),
    inference(definition_unfolding,[],[f121,f116]) ).

fof(f116,plain,
    ! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).

fof(f121,plain,
    ~ in(sK4,succ(sK4)),
    inference(cnf_transformation,[],[f77]) ).

fof(f77,plain,
    ~ in(sK4,succ(sK4)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f64,f76]) ).

fof(f76,plain,
    ( ? [X0] : ~ in(X0,succ(X0))
   => ~ in(sK4,succ(sK4)) ),
    introduced(choice_axiom,[]) ).

fof(f64,plain,
    ? [X0] : ~ in(X0,succ(X0)),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,negated_conjecture,
    ~ ! [X0] : in(X0,succ(X0)),
    inference(negated_conjecture,[],[f28]) ).

fof(f28,conjecture,
    ! [X0] : in(X0,succ(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).

fof(f165,plain,
    ! [X3,X0,X1] :
      ( in(X3,set_union2(X1,X0))
      | ~ in(X3,X0) ),
    inference(equality_resolution,[],[f156]) ).

fof(f156,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X2)
      | ~ in(X3,X0)
      | set_union2(X1,X0) != X2 ),
    inference(cnf_transformation,[],[f105]) ).

fof(f105,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X1)
                & ~ in(X3,X0) ) )
            & ( in(X3,X1)
              | in(X3,X0)
              | ~ in(X3,X2) ) )
        | set_union2(X1,X0) != X2 )
      & ( set_union2(X1,X0) = X2
        | ( ( ( ~ in(sK13(X0,X1,X2),X1)
              & ~ in(sK13(X0,X1,X2),X0) )
            | ~ in(sK13(X0,X1,X2),X2) )
          & ( in(sK13(X0,X1,X2),X1)
            | in(sK13(X0,X1,X2),X0)
            | in(sK13(X0,X1,X2),X2) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f103,f104]) ).

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

fof(f103,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X1)
                & ~ in(X3,X0) ) )
            & ( in(X3,X1)
              | in(X3,X0)
              | ~ in(X3,X2) ) )
        | set_union2(X1,X0) != X2 )
      & ( set_union2(X1,X0) = X2
        | ? [X4] :
            ( ( ( ~ in(X4,X1)
                & ~ in(X4,X0) )
              | ~ in(X4,X2) )
            & ( in(X4,X1)
              | in(X4,X0)
              | in(X4,X2) ) ) ) ),
    inference(rectify,[],[f102]) ).

fof(f102,plain,
    ! [X2,X0,X1] :
      ( ( ! [X3] :
            ( ( in(X3,X1)
              | ( ~ in(X3,X0)
                & ~ in(X3,X2) ) )
            & ( in(X3,X0)
              | in(X3,X2)
              | ~ in(X3,X1) ) )
        | set_union2(X0,X2) != X1 )
      & ( set_union2(X0,X2) = X1
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X2) )
              | ~ in(X3,X1) )
            & ( in(X3,X0)
              | in(X3,X2)
              | in(X3,X1) ) ) ) ),
    inference(flattening,[],[f101]) ).

fof(f101,plain,
    ! [X2,X0,X1] :
      ( ( ! [X3] :
            ( ( in(X3,X1)
              | ( ~ in(X3,X0)
                & ~ in(X3,X2) ) )
            & ( in(X3,X0)
              | in(X3,X2)
              | ~ in(X3,X1) ) )
        | set_union2(X0,X2) != X1 )
      & ( set_union2(X0,X2) = X1
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X2) )
              | ~ in(X3,X1) )
            & ( in(X3,X0)
              | in(X3,X2)
              | in(X3,X1) ) ) ) ),
    inference(nnf_transformation,[],[f41]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( ! [X3] :
          ( in(X3,X1)
        <=> ( in(X3,X0)
            | in(X3,X2) ) )
    <=> set_union2(X0,X2) = X1 ),
    inference(rectify,[],[f8]) ).

fof(f8,axiom,
    ! [X0,X2,X1] :
      ( ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            | in(X3,X1) ) )
    <=> set_union2(X0,X1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem    : SEU230+3 : TPTP v8.1.0. Released v3.2.0.
% 0.05/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.33  % Computer : n022.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 14:55:11 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 1.60/0.56  % (27841)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.60/0.56  % (27831)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.60/0.56  % (27832)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.60/0.56  % (27833)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.60/0.56  TRYING [1]
% 1.60/0.56  % (27838)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.60/0.56  % (27839)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.60/0.56  TRYING [2]
% 1.60/0.56  % (27832)First to succeed.
% 1.60/0.56  TRYING [3]
% 1.60/0.56  % (27840)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.60/0.56  % (27847)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.60/0.56  % (27849)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.60/0.56  % (27848)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.60/0.56  % (27833)Instruction limit reached!
% 1.60/0.56  % (27833)------------------------------
% 1.60/0.56  % (27833)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.60/0.56  % (27833)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.56  % (27833)Termination reason: Unknown
% 1.60/0.56  % (27833)Termination phase: Blocked clause elimination
% 1.60/0.56  
% 1.60/0.56  % (27833)Memory used [KB]: 895
% 1.60/0.56  % (27833)Time elapsed: 0.005 s
% 1.60/0.56  % (27833)Instructions burned: 3 (million)
% 1.60/0.56  % (27833)------------------------------
% 1.60/0.56  % (27833)------------------------------
% 1.60/0.57  % (27846)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.60/0.57  % (27854)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.60/0.58  TRYING [4]
% 1.60/0.58  % (27832)Refutation found. Thanks to Tanya!
% 1.60/0.58  % SZS status Theorem for theBenchmark
% 1.60/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.60/0.58  % (27832)------------------------------
% 1.60/0.58  % (27832)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.60/0.58  % (27832)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.58  % (27832)Termination reason: Refutation
% 1.60/0.58  
% 1.60/0.58  % (27832)Memory used [KB]: 5500
% 1.60/0.58  % (27832)Time elapsed: 0.143 s
% 1.60/0.58  % (27832)Instructions burned: 6 (million)
% 1.60/0.58  % (27832)------------------------------
% 1.60/0.58  % (27832)------------------------------
% 1.60/0.58  % (27824)Success in time 0.227 s
%------------------------------------------------------------------------------