TSTP Solution File: SWV212+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV212+1 : TPTP v8.1.0. Bugfixed 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 : n029.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:44:31 EDT 2022

% Result   : Theorem 0.21s 0.54s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :  397 ( 376 equ)
%            Maximal formula atoms :   78 (  39 avg)
%            Number of connectives :  640 ( 253   ~;  72   |; 309   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   47 (  24 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :   10 (   6   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f296,plain,
    $false,
    inference(trivial_inequality_removal,[],[f276]) ).

fof(f276,plain,
    ( sK2 != sK2
    | sK1 != sK1 ),
    inference(definition_unfolding,[],[f187,f216,f215]) ).

fof(f215,plain,
    n3 = sK1,
    inference(cnf_transformation,[],[f129]) ).

fof(f129,plain,
    ? [X0,X1] :
      ( ( n0 != X0
        | n5 != X1 )
      & leq(n0,X0)
      & ( n0 != X0
        | n4 != X1 )
      & ( n1 != X0
        | n2 != X1 )
      & ( n4 != X1
        | n2 != X0 )
      & ( n0 != X1
        | n1 != X0 )
      & ( n3 != X1
        | n0 != X0 )
      & ( n4 != X0
        | n0 != X1 )
      & ( n4 != X0
        | n3 != X1 )
      & ( n3 != X1
        | n2 != X0 )
      & ( n5 != X1
        | n1 != X0 )
      & leq(X1,n5)
      & ( n5 != X0
        | n5 != X1 )
      & ( n3 != X0
        | n0 != X1 )
      & n0 = X1
      & ( n4 != X0
        | n1 != X1 )
      & n3 = X0
      & ( n4 != X1
        | n1 != X0 )
      & n0 != times(divide(n1,n400),a_select2(sigma,n0))
      & ( n3 != X0
        | n5 != X1 )
      & ( n4 != X0
        | n4 != X1 )
      & n0 = X0
      & ( n5 != X0
        | n2 != X1 )
      & ( n1 != X0
        | n3 != X1 )
      & ( n2 != X1
        | n0 != X0 )
      & ( n1 != X1
        | n0 != X0 )
      & ( n1 != X1
        | n3 != X0 )
      & ( n2 != X0
        | n5 != X1 )
      & ( n2 != X0
        | n0 != X1 )
      & ( n5 != X0
        | n1 != X1 )
      & ( n2 != X1
        | n3 != X0 )
      & ( n3 != X1
        | n3 != X0 )
      & ( n2 != X0
        | n1 != X1 )
      & ( n3 != X0
        | n4 != X1 )
      & ( n5 != X0
        | n3 != X1 )
      & ( n2 != X0
        | n2 != X1 )
      & ( n1 != X1
        | n1 != X0 )
      & ( n2 != X1
        | n4 != X0 )
      & ( n0 != X1
        | n5 != X0 )
      & leq(n0,X1)
      & ( n4 != X0
        | n5 != X1 )
      & leq(X0,n5)
      & ( n4 != X1
        | n5 != X0 ) ),
    inference(flattening,[],[f128]) ).

fof(f128,plain,
    ? [X0,X1] :
      ( n0 != times(divide(n1,n400),a_select2(sigma,n0))
      & ( n0 != X0
        | n4 != X1 )
      & ( n5 != X1
        | n1 != X0 )
      & ( n2 != X0
        | n1 != X1 )
      & ( n4 != X0
        | n3 != X1 )
      & ( n4 != X1
        | n5 != X0 )
      & ( n4 != X1
        | n1 != X0 )
      & ( n3 != X0
        | n4 != X1 )
      & ( n5 != X0
        | n1 != X1 )
      & ( n3 != X1
        | n0 != X0 )
      & ( n1 != X0
        | n3 != X1 )
      & n3 = X0
      & ( n2 != X1
        | n3 != X0 )
      & ( n2 != X0
        | n0 != X1 )
      & ( n4 != X0
        | n1 != X1 )
      & ( n2 != X1
        | n0 != X0 )
      & ( n0 != X0
        | n5 != X1 )
      & ( n2 != X0
        | n2 != X1 )
      & ( n2 != X1
        | n4 != X0 )
      & ( n5 != X0
        | n3 != X1 )
      & ( n2 != X0
        | n5 != X1 )
      & ( n5 != X0
        | n5 != X1 )
      & ( n1 != X0
        | n2 != X1 )
      & ( n3 != X1
        | n2 != X0 )
      & ( n3 != X0
        | n5 != X1 )
      & n0 = X1
      & ( n0 != X1
        | n1 != X0 )
      & ( n1 != X1
        | n3 != X0 )
      & ( n4 != X0
        | n4 != X1 )
      & ( n4 != X1
        | n2 != X0 )
      & ( n4 != X0
        | n0 != X1 )
      & ( n5 != X0
        | n2 != X1 )
      & ( n0 != X1
        | n5 != X0 )
      & ( n1 != X1
        | n1 != X0 )
      & ( n4 != X0
        | n5 != X1 )
      & ( n3 != X1
        | n3 != X0 )
      & n0 = X0
      & ( n1 != X1
        | n0 != X0 )
      & ( n3 != X0
        | n0 != X1 )
      & leq(X0,n5)
      & leq(n0,X0)
      & leq(n0,X1)
      & leq(X1,n5) ),
    inference(ennf_transformation,[],[f94]) ).

fof(f94,plain,
    ~ ! [X0,X1] :
        ( ( leq(X0,n5)
          & leq(n0,X0)
          & leq(n0,X1)
          & leq(X1,n5) )
       => ( ( ~ ( n4 = X1
                & n0 = X0 )
            & ~ ( n5 = X1
                & n1 = X0 )
            & ~ ( n2 = X0
                & n1 = X1 )
            & ~ ( n4 = X0
                & n3 = X1 )
            & ~ ( n5 = X0
                & n4 = X1 )
            & ~ ( n1 = X0
                & n4 = X1 )
            & ~ ( n4 = X1
                & n3 = X0 )
            & ~ ( n5 = X0
                & n1 = X1 )
            & ~ ( n0 = X0
                & n3 = X1 )
            & ~ ( n3 = X1
                & n1 = X0 )
            & n3 = X0
            & ~ ( n3 = X0
                & n2 = X1 )
            & ~ ( n0 = X1
                & n2 = X0 )
            & ~ ( n4 = X0
                & n1 = X1 )
            & ~ ( n2 = X1
                & n0 = X0 )
            & ~ ( n5 = X1
                & n0 = X0 )
            & ~ ( n2 = X1
                & n2 = X0 )
            & ~ ( n4 = X0
                & n2 = X1 )
            & ~ ( n3 = X1
                & n5 = X0 )
            & ~ ( n2 = X0
                & n5 = X1 )
            & ~ ( n5 = X0
                & n5 = X1 )
            & ~ ( n1 = X0
                & n2 = X1 )
            & ~ ( n2 = X0
                & n3 = X1 )
            & ~ ( n5 = X1
                & n3 = X0 )
            & n0 = X1
            & ~ ( n0 = X1
                & n1 = X0 )
            & ~ ( n3 = X0
                & n1 = X1 )
            & ~ ( n4 = X1
                & n4 = X0 )
            & ~ ( n4 = X1
                & n2 = X0 )
            & ~ ( n4 = X0
                & n0 = X1 )
            & ~ ( n5 = X0
                & n2 = X1 )
            & ~ ( n5 = X0
                & n0 = X1 )
            & ~ ( n1 = X0
                & n1 = X1 )
            & ~ ( n4 = X0
                & n5 = X1 )
            & ~ ( n3 = X1
                & n3 = X0 )
            & n0 = X0
            & ~ ( n1 = X1
                & n0 = X0 )
            & ~ ( n0 = X1
                & n3 = X0 ) )
         => n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
    inference(rectify,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ! [X13,X17] :
        ( ( leq(X13,n5)
          & leq(X17,n5)
          & leq(n0,X17)
          & leq(n0,X13) )
       => ( ( ~ ( n3 = X17
                & n5 = X13 )
            & ~ ( n0 = X13
                & n1 = X17 )
            & ~ ( n4 = X13
                & n2 = X17 )
            & ~ ( n0 = X17
                & n5 = X13 )
            & n3 = X13
            & ~ ( n0 = X17
                & n2 = X13 )
            & ~ ( n1 = X13
                & n1 = X17 )
            & ~ ( n2 = X17
                & n2 = X13 )
            & ~ ( n4 = X17
                & n2 = X13 )
            & ~ ( n0 = X13
                & n2 = X17 )
            & ~ ( n2 = X13
                & n5 = X17 )
            & ~ ( n1 = X13
                & n2 = X17 )
            & ~ ( n4 = X17
                & n3 = X13 )
            & ~ ( n3 = X17
                & n2 = X13 )
            & ~ ( n2 = X13
                & n1 = X17 )
            & ~ ( n4 = X17
                & n4 = X13 )
            & ~ ( n4 = X13
                & n0 = X17 )
            & n0 = X17
            & n0 = X13
            & ~ ( n3 = X13
                & n2 = X17 )
            & ~ ( n3 = X13
                & n1 = X17 )
            & ~ ( n5 = X17
                & n3 = X13 )
            & ~ ( n4 = X13
                & n1 = X17 )
            & ~ ( n1 = X13
                & n3 = X17 )
            & ~ ( n4 = X13
                & n5 = X17 )
            & ~ ( n3 = X13
                & n0 = X17 )
            & ~ ( n3 = X17
                & n0 = X13 )
            & ~ ( n4 = X17
                & n5 = X13 )
            & ~ ( n1 = X13
                & n4 = X17 )
            & ~ ( n3 = X13
                & n3 = X17 )
            & ~ ( n5 = X13
                & n5 = X17 )
            & ~ ( n0 = X13
                & n5 = X17 )
            & ~ ( n2 = X17
                & n5 = X13 )
            & ~ ( n1 = X17
                & n5 = X13 )
            & ~ ( n1 = X13
                & n5 = X17 )
            & ~ ( n3 = X17
                & n4 = X13 )
            & ~ ( n0 = X13
                & n4 = X17 )
            & ~ ( n0 = X17
                & n1 = X13 ) )
         => n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ! [X13,X17] :
      ( ( leq(X13,n5)
        & leq(X17,n5)
        & leq(n0,X17)
        & leq(n0,X13) )
     => ( ( ~ ( n3 = X17
              & n5 = X13 )
          & ~ ( n0 = X13
              & n1 = X17 )
          & ~ ( n4 = X13
              & n2 = X17 )
          & ~ ( n0 = X17
              & n5 = X13 )
          & n3 = X13
          & ~ ( n0 = X17
              & n2 = X13 )
          & ~ ( n1 = X13
              & n1 = X17 )
          & ~ ( n2 = X17
              & n2 = X13 )
          & ~ ( n4 = X17
              & n2 = X13 )
          & ~ ( n0 = X13
              & n2 = X17 )
          & ~ ( n2 = X13
              & n5 = X17 )
          & ~ ( n1 = X13
              & n2 = X17 )
          & ~ ( n4 = X17
              & n3 = X13 )
          & ~ ( n3 = X17
              & n2 = X13 )
          & ~ ( n2 = X13
              & n1 = X17 )
          & ~ ( n4 = X17
              & n4 = X13 )
          & ~ ( n4 = X13
              & n0 = X17 )
          & n0 = X17
          & n0 = X13
          & ~ ( n3 = X13
              & n2 = X17 )
          & ~ ( n3 = X13
              & n1 = X17 )
          & ~ ( n5 = X17
              & n3 = X13 )
          & ~ ( n4 = X13
              & n1 = X17 )
          & ~ ( n1 = X13
              & n3 = X17 )
          & ~ ( n4 = X13
              & n5 = X17 )
          & ~ ( n3 = X13
              & n0 = X17 )
          & ~ ( n3 = X17
              & n0 = X13 )
          & ~ ( n4 = X17
              & n5 = X13 )
          & ~ ( n1 = X13
              & n4 = X17 )
          & ~ ( n3 = X13
              & n3 = X17 )
          & ~ ( n5 = X13
              & n5 = X17 )
          & ~ ( n0 = X13
              & n5 = X17 )
          & ~ ( n2 = X17
              & n5 = X13 )
          & ~ ( n1 = X17
              & n5 = X13 )
          & ~ ( n1 = X13
              & n5 = X17 )
          & ~ ( n3 = X17
              & n4 = X13 )
          & ~ ( n0 = X13
              & n4 = X17 )
          & ~ ( n0 = X17
              & n1 = X13 ) )
       => n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0041) ).

fof(f216,plain,
    n0 = sK2,
    inference(cnf_transformation,[],[f129]) ).

fof(f187,plain,
    ( n0 != sK2
    | n3 != sK1 ),
    inference(cnf_transformation,[],[f129]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWV212+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/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.14/0.35  % Computer : n029.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 19:16:42 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.52  % (4986)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)
% 0.21/0.53  % (4986)First to succeed.
% 0.21/0.53  % (4978)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.54  % (4986)Refutation found. Thanks to Tanya!
% 0.21/0.54  % SZS status Theorem for theBenchmark
% 0.21/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54  % (4986)------------------------------
% 0.21/0.54  % (4986)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54  % (4986)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54  % (4986)Termination reason: Refutation
% 0.21/0.54  
% 0.21/0.54  % (4986)Memory used [KB]: 6140
% 0.21/0.54  % (4986)Time elapsed: 0.007 s
% 0.21/0.54  % (4986)Instructions burned: 4 (million)
% 0.21/0.54  % (4986)------------------------------
% 0.21/0.54  % (4986)------------------------------
% 0.21/0.54  % (4977)Success in time 0.179 s
%------------------------------------------------------------------------------