TSTP Solution File: DAT061_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : DAT061_1 : TPTP v8.1.0. Released v5.5.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 : n025.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 16:04:03 EDT 2022

% Result   : Theorem 0.18s 0.48s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   30 (   6 unt;  11 typ;   0 def)
%            Number of atoms       :   34 (  22 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   29 (  14   ~;   7   |;   5   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   35 (  11 atm;   0 fun;   2 num;  22 var)
%            Number of types       :    3 (   2 usr;   1 ari)
%            Number of type conns  :    7 (   3   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :   44 (  32   !;  12   ?;  44   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    data: $tType ).

tff(type_def_6,type,
    array: $tType ).

tff(func_def_0,type,
    mkarray: array ).

tff(func_def_1,type,
    none: data ).

tff(func_def_2,type,
    put: ( array * $int * data ) > array ).

tff(func_def_3,type,
    get: ( array * $int ) > data ).

tff(func_def_8,type,
    sK0: ( array * array ) > $int ).

tff(func_def_9,type,
    sK1: $int ).

tff(func_def_10,type,
    sK2: array ).

tff(func_def_11,type,
    sK3: data ).

tff(func_def_12,type,
    sK4: $int ).

tff(f75,plain,
    $false,
    inference(evaluation,[],[f74]) ).

tff(f74,plain,
    $less(0,0),
    inference(cancellation,[],[f73]) ).

tff(f73,plain,
    $less(sK1,sK1),
    inference(backward_demodulation,[],[f43,f67]) ).

tff(f67,plain,
    sK1 = sK4,
    inference(trivial_inequality_removal,[],[f66]) ).

tff(f66,plain,
    ( ( sK1 = sK4 )
    | ( get(sK2,sK4) != get(sK2,sK4) ) ),
    inference(superposition,[],[f44,f41]) ).

tff(f41,plain,
    ! [X2: data,X3: array,X0: $int,X1: $int] :
      ( ( get(put(X3,X0,X2),X1) = get(X3,X1) )
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f33]) ).

tff(f33,plain,
    ! [X0: $int,X1: $int,X2: data,X3: array] :
      ( ( get(put(X3,X0,X2),X1) = get(X3,X1) )
      | ( X0 = X1 ) ),
    inference(rectify,[],[f26]) ).

tff(f26,plain,
    ! [X3: $int,X2: $int,X1: data,X0: array] :
      ( ( get(put(X0,X3,X1),X2) = get(X0,X2) )
      | ( X2 = X3 ) ),
    inference(ennf_transformation,[],[f23]) ).

tff(f23,plain,
    ! [X3: $int,X1: data,X2: $int,X0: array] :
      ( ( X2 != X3 )
     => ( get(put(X0,X3,X1),X2) = get(X0,X2) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X1: array,X2: data,X0: $int,X3: $int] :
      ( ( X0 != X3 )
     => ( get(put(X1,X3,X2),X0) = get(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_19) ).

tff(f44,plain,
    get(put(sK2,sK1,sK3),sK4) != get(sK2,sK4),
    inference(cnf_transformation,[],[f36]) ).

tff(f36,plain,
    ( ( get(put(sK2,sK1,sK3),sK4) != get(sK2,sK4) )
    & $less(sK1,sK4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f34,f35]) ).

tff(f35,plain,
    ( ? [X0: $int,X1: array,X2: data,X3: $int] :
        ( ( get(X1,X3) != get(put(X1,X0,X2),X3) )
        & $less(X0,X3) )
   => ( ( get(put(sK2,sK1,sK3),sK4) != get(sK2,sK4) )
      & $less(sK1,sK4) ) ),
    introduced(choice_axiom,[]) ).

tff(f34,plain,
    ? [X0: $int,X1: array,X2: data,X3: $int] :
      ( ( get(X1,X3) != get(put(X1,X0,X2),X3) )
      & $less(X0,X3) ),
    inference(rectify,[],[f25]) ).

tff(f25,plain,
    ? [X2: $int,X0: array,X3: data,X1: $int] :
      ( ( get(put(X0,X2,X3),X1) != get(X0,X1) )
      & $less(X2,X1) ),
    inference(ennf_transformation,[],[f20]) ).

tff(f20,plain,
    ~ ! [X1: $int,X0: array,X2: $int,X3: data] :
        ( ( get(put(X0,X2,X3),X1) = get(X0,X1) )
        | ~ $less(X2,X1) ),
    inference(rectify,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ ! [X1: array,X3: $int,X0: $int,X2: data] :
        ( ( get(X1,X3) = get(put(X1,X0,X2),X3) )
        | ~ $less(X0,X3) ),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    ! [X1: array,X3: $int,X0: $int,X2: data] :
      ( ( get(X1,X3) = get(put(X1,X0,X2),X3) )
      | ~ $less(X0,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_lem_7) ).

tff(f43,plain,
    $less(sK1,sK4),
    inference(cnf_transformation,[],[f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : DAT061=1 : TPTP v8.1.0. Released v5.5.0.
% 0.03/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n025.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 29 21:49:14 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.47  % (26939)lrs+10_1:1_canc=force:tha=some:to=lpo:i=35:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/35Mi)
% 0.18/0.47  % (26947)lrs+10_1:1_ss=axioms:st=5.0:tha=off:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.18/0.48  % (26931)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.48  % (26939)First to succeed.
% 0.18/0.48  % (26931)Instruction limit reached!
% 0.18/0.48  % (26931)------------------------------
% 0.18/0.48  % (26931)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48  % (26931)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48  % (26951)dis+2_1:1_av=off:bsr=on:erd=off:s2pl=on:sgt=16:sos=on:sp=frequency:ss=axioms:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 0.18/0.48  % (26931)Termination reason: Unknown
% 0.18/0.48  % (26931)Termination phase: SInE selection
% 0.18/0.48  
% 0.18/0.48  % (26931)Memory used [KB]: 895
% 0.18/0.48  % (26931)Time elapsed: 0.003 s
% 0.18/0.48  % (26931)Instructions burned: 2 (million)
% 0.18/0.48  % (26931)------------------------------
% 0.18/0.48  % (26931)------------------------------
% 0.18/0.48  % (26932)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.48  % (26939)Refutation found. Thanks to Tanya!
% 0.18/0.48  % SZS status Theorem for theBenchmark
% 0.18/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48  % (26939)------------------------------
% 0.18/0.48  % (26939)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48  % (26939)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48  % (26939)Termination reason: Refutation
% 0.18/0.48  
% 0.18/0.48  % (26939)Memory used [KB]: 5500
% 0.18/0.48  % (26939)Time elapsed: 0.103 s
% 0.18/0.48  % (26939)Instructions burned: 4 (million)
% 0.18/0.48  % (26939)------------------------------
% 0.18/0.48  % (26939)------------------------------
% 0.18/0.48  % (26926)Success in time 0.143 s
%------------------------------------------------------------------------------