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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWV488+2 : TPTP v8.1.0. Released v4.0.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:59:20 EDT 2022

% Result   : Theorem 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (  16 unt;   0 def)
%            Number of atoms       :  168 (  57 equ)
%            Maximal formula atoms :   17 (   4 avg)
%            Number of connectives :  202 (  68   ~;  63   |;  54   &)
%                                         (   0 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   56 (  48   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f160,plain,
    $false,
    inference(subsumption_resolution,[],[f159,f54]) ).

fof(f54,plain,
    real_zero != real_one,
    inference(cnf_transformation,[],[f11]) ).

fof(f11,axiom,
    real_zero != real_one,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',real_constants) ).

fof(f159,plain,
    real_zero = real_one,
    inference(forward_demodulation,[],[f158,f80]) ).

fof(f80,plain,
    real_zero = a(sK1,sK1),
    inference(backward_demodulation,[],[f77,f65]) ).

fof(f65,plain,
    sK2 = sK1,
    inference(cnf_transformation,[],[f45]) ).

fof(f45,plain,
    ( real_zero = a(sK2,sK1)
    & int_leq(sK2,sK1)
    & int_leq(int_one,sK2)
    & sK2 = sK1
    & int_leq(sK1,n) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f43,f44]) ).

fof(f44,plain,
    ( ? [X0,X1] :
        ( real_zero = a(X1,X0)
        & int_leq(X1,X0)
        & int_leq(int_one,X1)
        & X0 = X1
        & int_leq(X0,n) )
   => ( real_zero = a(sK2,sK1)
      & int_leq(sK2,sK1)
      & int_leq(int_one,sK2)
      & sK2 = sK1
      & int_leq(sK1,n) ) ),
    introduced(choice_axiom,[]) ).

fof(f43,plain,
    ? [X0,X1] :
      ( real_zero = a(X1,X0)
      & int_leq(X1,X0)
      & int_leq(int_one,X1)
      & X0 = X1
      & int_leq(X0,n) ),
    inference(rectify,[],[f23]) ).

fof(f23,plain,
    ? [X1,X0] :
      ( real_zero = a(X0,X1)
      & int_leq(X0,X1)
      & int_leq(int_one,X0)
      & X0 = X1
      & int_leq(X1,n) ),
    inference(flattening,[],[f22]) ).

fof(f22,plain,
    ? [X0,X1] :
      ( real_zero = a(X0,X1)
      & X0 = X1
      & int_leq(X0,X1)
      & int_leq(X1,n)
      & int_leq(int_one,X0) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( int_leq(X0,X1)
          & int_leq(X1,n)
          & int_leq(int_one,X0) )
       => ( X0 = X1
         => real_zero != a(X0,X1) ) ),
    inference(negated_conjecture,[],[f13]) ).

fof(f13,conjecture,
    ! [X0,X1] :
      ( ( int_leq(X0,X1)
        & int_leq(X1,n)
        & int_leq(int_one,X0) )
     => ( X0 = X1
       => real_zero != a(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lti) ).

fof(f77,plain,
    real_zero = a(sK2,sK1),
    inference(forward_demodulation,[],[f75,f76]) ).

fof(f76,plain,
    real_zero = sF3,
    inference(definition_folding,[],[f68,f75]) ).

fof(f68,plain,
    real_zero = a(sK2,sK1),
    inference(cnf_transformation,[],[f45]) ).

fof(f75,plain,
    a(sK2,sK1) = sF3,
    introduced(function_definition,[]) ).

fof(f158,plain,
    real_one = a(sK1,sK1),
    inference(subsumption_resolution,[],[f153,f79]) ).

fof(f79,plain,
    int_leq(sK1,sK1),
    inference(backward_demodulation,[],[f67,f65]) ).

fof(f67,plain,
    int_leq(sK2,sK1),
    inference(cnf_transformation,[],[f45]) ).

fof(f153,plain,
    ( real_one = a(sK1,sK1)
    | ~ int_leq(sK1,sK1) ),
    inference(resolution,[],[f152,f78]) ).

fof(f78,plain,
    int_leq(int_one,sK1),
    inference(backward_demodulation,[],[f66,f65]) ).

fof(f66,plain,
    int_leq(int_one,sK2),
    inference(cnf_transformation,[],[f45]) ).

fof(f152,plain,
    ! [X2] :
      ( ~ int_leq(int_one,X2)
      | real_one = a(X2,X2)
      | ~ int_leq(X2,sK1) ),
    inference(subsumption_resolution,[],[f150,f78]) ).

fof(f150,plain,
    ! [X2] :
      ( ~ int_leq(int_one,X2)
      | real_one = a(X2,X2)
      | ~ int_leq(int_one,sK1)
      | ~ int_leq(X2,sK1) ),
    inference(resolution,[],[f147,f64]) ).

fof(f64,plain,
    int_leq(sK1,n),
    inference(cnf_transformation,[],[f45]) ).

fof(f147,plain,
    ! [X4,X5] :
      ( ~ int_leq(X4,n)
      | ~ int_leq(int_one,X5)
      | real_one = a(X5,X5)
      | ~ int_leq(int_one,X4)
      | ~ int_leq(X5,X4) ),
    inference(subsumption_resolution,[],[f146,f78]) ).

fof(f146,plain,
    ! [X4,X5] :
      ( ~ int_leq(int_one,X4)
      | real_one = a(X5,X5)
      | ~ int_leq(X4,n)
      | ~ int_leq(int_one,sK1)
      | ~ int_leq(X5,X4)
      | ~ int_leq(int_one,X5) ),
    inference(resolution,[],[f50,f64]) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( ~ int_leq(X1,n)
      | ~ int_leq(int_one,X0)
      | ~ int_leq(X0,n)
      | ~ int_leq(int_one,X1)
      | real_one = a(X2,X2)
      | ~ int_leq(int_one,X2)
      | ~ int_leq(X2,X0) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ~ int_leq(X1,n)
      | ~ int_leq(int_one,X0)
      | ~ int_leq(X0,n)
      | ~ int_leq(int_one,X1)
      | ( ! [X2] :
            ( ~ int_leq(X2,X0)
            | ~ int_leq(int_one,X2)
            | real_one = a(X2,X2) )
        & ! [X3] :
            ( plus(X0,X3) != X1
            | ~ int_less(int_zero,X3)
            | ! [X4] :
                ( lu(plus(X4,X3),X4) = a(plus(X4,X3),X4)
                | ~ int_leq(X4,X0)
                | ~ int_leq(int_one,X4) ) )
        & ! [X5] :
            ( ! [X6] :
                ( ~ int_leq(X6,X1)
                | ~ int_leq(int_one,X6)
                | real_zero = a(X6,plus(X6,X5)) )
            | plus(X1,X5) != X0
            | ~ int_less(int_zero,X5) ) ) ),
    inference(rectify,[],[f30]) ).

fof(f30,plain,
    ! [X1,X0] :
      ( ~ int_leq(X0,n)
      | ~ int_leq(int_one,X1)
      | ~ int_leq(X1,n)
      | ~ int_leq(int_one,X0)
      | ( ! [X4] :
            ( ~ int_leq(X4,X1)
            | ~ int_leq(int_one,X4)
            | real_one = a(X4,X4) )
        & ! [X5] :
            ( plus(X1,X5) != X0
            | ~ int_less(int_zero,X5)
            | ! [X6] :
                ( a(plus(X6,X5),X6) = lu(plus(X6,X5),X6)
                | ~ int_leq(X6,X1)
                | ~ int_leq(int_one,X6) ) )
        & ! [X2] :
            ( ! [X3] :
                ( ~ int_leq(X3,X0)
                | ~ int_leq(int_one,X3)
                | real_zero = a(X3,plus(X3,X2)) )
            | plus(X0,X2) != X1
            | ~ int_less(int_zero,X2) ) ) ),
    inference(flattening,[],[f29]) ).

fof(f29,plain,
    ! [X1,X0] :
      ( ( ! [X5] :
            ( ! [X6] :
                ( a(plus(X6,X5),X6) = lu(plus(X6,X5),X6)
                | ~ int_leq(int_one,X6)
                | ~ int_leq(X6,X1) )
            | plus(X1,X5) != X0
            | ~ int_less(int_zero,X5) )
        & ! [X4] :
            ( real_one = a(X4,X4)
            | ~ int_leq(X4,X1)
            | ~ int_leq(int_one,X4) )
        & ! [X2] :
            ( ! [X3] :
                ( real_zero = a(X3,plus(X3,X2))
                | ~ int_leq(int_one,X3)
                | ~ int_leq(X3,X0) )
            | plus(X0,X2) != X1
            | ~ int_less(int_zero,X2) ) )
      | ~ int_leq(X1,n)
      | ~ int_leq(int_one,X1)
      | ~ int_leq(int_one,X0)
      | ~ int_leq(X0,n) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X1,X0] :
      ( ( int_leq(X1,n)
        & int_leq(int_one,X1)
        & int_leq(int_one,X0)
        & int_leq(X0,n) )
     => ( ! [X5] :
            ( ( plus(X1,X5) = X0
              & int_less(int_zero,X5) )
           => ! [X6] :
                ( ( int_leq(int_one,X6)
                  & int_leq(X6,X1) )
               => a(plus(X6,X5),X6) = lu(plus(X6,X5),X6) ) )
        & ! [X4] :
            ( ( int_leq(X4,X1)
              & int_leq(int_one,X4) )
           => real_one = a(X4,X4) )
        & ! [X2] :
            ( ( plus(X0,X2) = X1
              & int_less(int_zero,X2) )
           => ! [X3] :
                ( ( int_leq(int_one,X3)
                  & int_leq(X3,X0) )
               => real_zero = a(X3,plus(X3,X2)) ) ) ) ),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X0,X1] :
      ( ( int_leq(X1,n)
        & int_leq(int_one,X1)
        & int_leq(int_one,X0)
        & int_leq(X0,n) )
     => ( ! [X7] :
            ( ( int_less(int_zero,X7)
              & plus(X0,X7) = X1 )
           => ! [X2] :
                ( ( int_leq(int_one,X2)
                  & int_leq(X2,X0) )
               => real_zero = a(X2,plus(X2,X7)) ) )
        & ! [X2] :
            ( ( int_leq(int_one,X2)
              & int_leq(X2,X1) )
           => real_one = a(X2,X2) )
        & ! [X7] :
            ( ( int_less(int_zero,X7)
              & plus(X1,X7) = X0 )
           => ! [X2] :
                ( ( int_leq(int_one,X2)
                  & int_leq(X2,X1) )
               => a(plus(X2,X7),X2) = lu(plus(X2,X7),X2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',qil) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14  % 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 19:34:15 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.55  % (20791)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)
% 0.20/0.55  % (20814)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)
% 0.20/0.55  % (20799)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.56  TRYING [1]
% 0.20/0.56  % (20806)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)
% 0.20/0.56  TRYING [2]
% 0.20/0.56  TRYING [3]
% 0.20/0.56  % (20799)Instruction limit reached!
% 0.20/0.56  % (20799)------------------------------
% 0.20/0.56  % (20799)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (20799)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (20799)Termination reason: Unknown
% 0.20/0.56  % (20799)Termination phase: Blocked clause elimination
% 0.20/0.56  
% 0.20/0.56  % (20799)Memory used [KB]: 895
% 0.20/0.56  % (20799)Time elapsed: 0.005 s
% 0.20/0.56  % (20799)Instructions burned: 2 (million)
% 0.20/0.56  % (20799)------------------------------
% 0.20/0.56  % (20799)------------------------------
% 0.20/0.56  % (20807)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)
% 0.20/0.56  TRYING [4]
% 0.20/0.57  % (20800)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)
% 0.20/0.57  % (20806)First to succeed.
% 0.20/0.57  % (20795)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.57  % (20806)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Theorem for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (20806)------------------------------
% 0.20/0.57  % (20806)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (20806)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (20806)Termination reason: Refutation
% 0.20/0.57  
% 0.20/0.57  % (20806)Memory used [KB]: 1023
% 0.20/0.57  % (20806)Time elapsed: 0.091 s
% 0.20/0.57  % (20806)Instructions burned: 7 (million)
% 0.20/0.57  % (20806)------------------------------
% 0.20/0.57  % (20806)------------------------------
% 0.20/0.57  % (20790)Success in time 0.214 s
%------------------------------------------------------------------------------