TSTP Solution File: DAT067_1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : DAT067_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_sat --cores 0 -t %d %s

% Computer : n001.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:48 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   28 (   4 unt;  11 typ;   0 def)
%            Number of atoms       :   32 (  31 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   32 (  17   ~;   7   |;   5   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number arithmetic     :   54 (   0 atm;  16 fun;  16 num;  22 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :    9 (   6   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   33 (  24   !;   9   ?;  33   :)

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

tff(func_def_0,type,
    empty: heap ).

tff(func_def_1,type,
    toop: heap > $int ).

tff(func_def_2,type,
    sel: ( heap * $int ) > $int ).

tff(func_def_3,type,
    length: heap > $int ).

tff(func_def_4,type,
    app: ( heap * $int ) > heap ).

tff(func_def_5,type,
    get: heap > heap ).

tff(func_def_10,type,
    sK0: heap ).

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

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

tff(pred_def_1,type,
    lsls: ( heap * heap ) > $o ).

tff(f290,plain,
    $false,
    inference(subsumption_resolution,[],[f285,f73]) ).

tff(f73,plain,
    $sum(1,length(sK0)) != sK2,
    inference(cnf_transformation,[],[f55]) ).

tff(f55,plain,
    ( ( $sum(1,length(sK0)) != sK2 )
    & ( sel(sK0,sK2) != sel(app(sK0,sK1),sK2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f53,f54]) ).

tff(f54,plain,
    ( ? [X0: heap,X1: $int,X2: $int] :
        ( ( $sum(1,length(X0)) != X2 )
        & ( sel(app(X0,X1),X2) != sel(X0,X2) ) )
   => ( ( $sum(1,length(sK0)) != sK2 )
      & ( sel(sK0,sK2) != sel(app(sK0,sK1),sK2) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f53,plain,
    ? [X0: heap,X1: $int,X2: $int] :
      ( ( $sum(1,length(X0)) != X2 )
      & ( sel(app(X0,X1),X2) != sel(X0,X2) ) ),
    inference(rectify,[],[f44]) ).

tff(f44,plain,
    ? [X2: heap,X0: $int,X1: $int] :
      ( ( $sum(1,length(X2)) != X1 )
      & ( sel(X2,X1) != sel(app(X2,X0),X1) ) ),
    inference(ennf_transformation,[],[f32]) ).

tff(f32,plain,
    ~ ! [X2: heap,X0: $int,X1: $int] :
        ( ( sel(X2,X1) = sel(app(X2,X0),X1) )
        | ( $sum(1,length(X2)) = X1 ) ),
    inference(rectify,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ! [X2: $int,X0: $int,X1: heap] :
        ( ( $sum(1,length(X1)) = X0 )
        | ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ! [X2: $int,X0: $int,X1: heap] :
      ( ( $sum(1,length(X1)) = X0 )
      | ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_2) ).

tff(f285,plain,
    $sum(1,length(sK0)) = sK2,
    inference(trivial_inequality_removal,[],[f284]) ).

tff(f284,plain,
    ( ( sel(sK0,sK2) != sel(sK0,sK2) )
    | ( $sum(1,length(sK0)) = sK2 ) ),
    inference(superposition,[],[f72,f63]) ).

tff(f63,plain,
    ! [X2: $int,X0: heap,X1: $int] :
      ( ( sel(app(X0,X1),X2) = sel(X0,X2) )
      | ( $sum(1,length(X0)) = X2 ) ),
    inference(cnf_transformation,[],[f49]) ).

tff(f49,plain,
    ! [X0: heap,X1: $int,X2: $int] :
      ( ( $sum(1,length(X0)) = X2 )
      | ( sel(app(X0,X1),X2) = sel(X0,X2) ) ),
    inference(rectify,[],[f43]) ).

tff(f43,plain,
    ! [X0: heap,X2: $int,X1: $int] :
      ( ( $sum(1,length(X0)) = X1 )
      | ( sel(app(X0,X2),X1) = sel(X0,X1) ) ),
    inference(ennf_transformation,[],[f30]) ).

tff(f30,plain,
    ! [X2: $int,X0: heap,X1: $int] :
      ( ( $sum(1,length(X0)) != X1 )
     => ( sel(app(X0,X2),X1) = sel(X0,X1) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X1: heap,X0: $int,X2: $int] :
      ( ( $sum(1,length(X1)) != X0 )
     => ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_3) ).

tff(f72,plain,
    sel(sK0,sK2) != sel(app(sK0,sK1),sK2),
    inference(cnf_transformation,[],[f55]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : DAT067=1 : TPTP v8.1.0. Released v5.5.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34  % Computer : n001.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 29 20:41:30 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (3416)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.50  % (3424)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)
% 0.19/0.50  % (3408)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50  % (3406)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.50  % (3404)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.19/0.50  % (3402)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50  % (3403)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.19/0.51  % (3416)First to succeed.
% 0.19/0.51  % (3400)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.51  % (3417)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)
% 0.19/0.52  % (3409)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)
% 0.19/0.52  % (3410)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.19/0.52  % (3416)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (3416)------------------------------
% 0.19/0.52  % (3416)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (3416)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (3416)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (3416)Memory used [KB]: 5628
% 0.19/0.52  % (3416)Time elapsed: 0.114 s
% 0.19/0.52  % (3416)Instructions burned: 12 (million)
% 0.19/0.52  % (3416)------------------------------
% 0.19/0.52  % (3416)------------------------------
% 0.19/0.52  % (3394)Success in time 0.174 s
%------------------------------------------------------------------------------