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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---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_uns --cores 0 -t %d %s

% Computer : n019.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:26:54 EDT 2022

% Result   : Theorem 1.47s 0.56s
% Output   : Refutation 1.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   27 (   9 unt;   0 def)
%            Number of atoms       :  113 (  83 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  136 (  50   ~;  48   |;  29   &)
%                                         (   4 <=>;   5  =>;   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    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   67 (  54   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f398,plain,
    $false,
    inference(subsumption_resolution,[],[f397,f382]) ).

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

fof(f381,plain,
    ! [X2,X3,X1] :
      ( in(X3,X2)
      | unordered_pair(X3,X1) != X2 ),
    inference(equality_resolution,[],[f321]) ).

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

fof(f217,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) )
            & ( X0 = X3
              | X1 = X3
              | ~ in(X3,X2) ) )
        | unordered_pair(X0,X1) != X2 )
      & ( unordered_pair(X0,X1) = X2
        | ( ( ( sK15(X0,X1,X2) != X0
              & sK15(X0,X1,X2) != X1 )
            | ~ in(sK15(X0,X1,X2),X2) )
          & ( sK15(X0,X1,X2) = X0
            | sK15(X0,X1,X2) = X1
            | in(sK15(X0,X1,X2),X2) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f215,f216]) ).

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

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

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

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

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

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

fof(f397,plain,
    ~ in(sK7,unordered_pair(sK7,sK8)),
    inference(forward_demodulation,[],[f391,f343]) ).

fof(f343,plain,
    unordered_pair(sK7,sK8) = unordered_pair(sK9,sK9),
    inference(definition_unfolding,[],[f274,f271]) ).

fof(f271,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/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).

fof(f274,plain,
    singleton(sK9) = unordered_pair(sK7,sK8),
    inference(cnf_transformation,[],[f181]) ).

fof(f181,plain,
    ( singleton(sK9) = unordered_pair(sK7,sK8)
    & sK9 != sK7 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f179,f180]) ).

fof(f180,plain,
    ( ? [X0,X1,X2] :
        ( unordered_pair(X0,X1) = singleton(X2)
        & X0 != X2 )
   => ( singleton(sK9) = unordered_pair(sK7,sK8)
      & sK9 != sK7 ) ),
    introduced(choice_axiom,[]) ).

fof(f179,plain,
    ? [X0,X1,X2] :
      ( unordered_pair(X0,X1) = singleton(X2)
      & X0 != X2 ),
    inference(rectify,[],[f140]) ).

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

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

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

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

fof(f391,plain,
    ~ in(sK7,unordered_pair(sK9,sK9)),
    inference(unit_resulting_resolution,[],[f273,f273,f385]) ).

fof(f385,plain,
    ! [X3,X0,X1] :
      ( X0 = X3
      | ~ in(X3,unordered_pair(X0,X1))
      | X1 = X3 ),
    inference(equality_resolution,[],[f319]) ).

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

fof(f273,plain,
    sK9 != sK7,
    inference(cnf_transformation,[],[f181]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SEU149+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n019.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   : Tue Aug 30 14:49:05 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.53  % (19119)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.54  % (19111)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.34/0.54  % (19103)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.34/0.54  % (19110)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.34/0.54  % (19096)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.34/0.55  % (19102)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.34/0.55  % (19116)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.34/0.55  % (19103)First to succeed.
% 1.34/0.55  % (19111)Instruction limit reached!
% 1.34/0.55  % (19111)------------------------------
% 1.34/0.55  % (19111)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.34/0.55  % (19111)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.34/0.55  % (19111)Termination reason: Unknown
% 1.34/0.55  % (19111)Termination phase: Saturation
% 1.34/0.55  
% 1.34/0.55  % (19111)Memory used [KB]: 6140
% 1.34/0.55  % (19111)Time elapsed: 0.011 s
% 1.34/0.55  % (19111)Instructions burned: 8 (million)
% 1.34/0.55  % (19111)------------------------------
% 1.34/0.55  % (19111)------------------------------
% 1.34/0.55  % (19104)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 1.47/0.55  % (19108)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.47/0.56  % (19103)Refutation found. Thanks to Tanya!
% 1.47/0.56  % SZS status Theorem for theBenchmark
% 1.47/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 1.47/0.56  % (19103)------------------------------
% 1.47/0.56  % (19103)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.56  % (19103)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.56  % (19103)Termination reason: Refutation
% 1.47/0.56  
% 1.47/0.56  % (19103)Memory used [KB]: 6140
% 1.47/0.56  % (19103)Time elapsed: 0.092 s
% 1.47/0.56  % (19103)Instructions burned: 7 (million)
% 1.47/0.56  % (19103)------------------------------
% 1.47/0.56  % (19103)------------------------------
% 1.47/0.56  % (19095)Success in time 0.194 s
%------------------------------------------------------------------------------