↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : DAT057_1 : TPTP v9.3.1. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 09:47:12 AM UTC 2026

% Result   : Theorem 2.48s 0.92s
% Output   : Refutation 2.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   5 unt;   0 typ;   2 def)
%            Number of atoms       :   43 (  29 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   35 (  15   ~;  14   |;   2   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   18 (   0 atm;   0 fun;   0 num;  18 var)
%            Number of types       :    3 (   2 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-3 aty)
%            Number of variables   :   36 (  32   !;   4   ?;  36   :)

% 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_4,type,
    sK0: ( array * array ) > $int ).

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

tff(func_def_6,type,
    sK2: array ).

tff(func_def_7,type,
    sK3: data ).

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

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

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

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

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

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

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

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

tff(f18,plain,
    ( ( sK1 != sK4 )
    & ( get(put(sK2,sK4,sK3),sK1) != get(sK2,sK1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4)],[f13]) ).

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

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

tff(f25,plain,
    sK1 != sK4,
    inference(cnf_transformation,[],[f18]) ).

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

tff(f32,definition,
    ( spl5_1
  <=> ( get(put(sK2,sK4,sK3),sK1) = get(sK2,sK1) ) ),
    introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).

tff(f34,plain,
    ( ( get(put(sK2,sK4,sK3),sK1) != get(sK2,sK1) )
    | spl5_1 ),
    inference(avatar_component_clause,[],[f32]) ).

tff(f35,plain,
    ~ spl5_1,
    inference(avatar_split_clause,[],[f24,f32]) ).

tff(f37,definition,
    ( spl5_2
  <=> ( sK1 = sK4 ) ),
    introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).

tff(f39,plain,
    ( ( sK1 != sK4 )
    | spl5_2 ),
    inference(avatar_component_clause,[],[f37]) ).

tff(f40,plain,
    ~ spl5_2,
    inference(avatar_split_clause,[],[f25,f37]) ).

tff(f54,plain,
    ( ( get(sK2,sK1) != get(sK2,sK1) )
    | ( sK1 = sK4 )
    | spl5_1 ),
    inference(superposition,[],[f34,f26]) ).

tff(f55,plain,
    ( ( sK1 = sK4 )
    | spl5_1 ),
    inference(trivial_inequality_removal,[],[f54]) ).

tff(f56,plain,
    ( $false
    | spl5_1
    | spl5_2 ),
    inference(forward_subsumption_resolution,[],[f55,f39]) ).

tff(f57,plain,
    ( spl5_1
    | spl5_2 ),
    inference(avatar_contradiction_clause,[],[f56]) ).

tff(f58,plain,
    $false,
    inference(avatar_smt_refutation,[],[f57,f40,f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT057_1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  % Computer : n013.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Tue Sep 29 00:06:52 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.26  Running first-order theorem proving
% 0.09/0.26  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.48/0.92  % (1711712)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.48/0.92  % (1711731)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=312039829:i=46:rtra=on_3000 on theBenchmark for (3000ds/46Mi)
% 2.48/0.92  % (1711731)First to succeed.
% 2.48/0.92  % (1711731)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1711712"
% 2.48/0.92  % (1711732)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3688998800:i=33:rtra=on_3000 on theBenchmark for (3000ds/33Mi)
% 2.48/0.92  % (1711728)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=1554729330:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_3000 on theBenchmark for (3000ds/201Mi)
% 2.48/0.92  % (1711726)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=4269077423:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_3000 on theBenchmark for (3000ds/12Mi)
% 2.48/0.92  % (1711730)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3577042803:i=4:rtra=on_3000 on theBenchmark for (3000ds/4Mi)
% 2.48/0.92  % (1711729)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=988059053:s2a=on:i=7:rtra=on:inst=on_3000 on theBenchmark for (3000ds/7Mi)
% 2.48/0.92  % (1711730)Also succeeded, but the first one will report.
% 2.48/0.92  % (1711729)Also succeeded, but the first one will report.
% 2.48/0.92  % (1711727)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2248639017:i=307:kws=precedence:nm=0:rtra=on_3000 on theBenchmark for (3000ds/307Mi)
% 2.48/0.92  % (1711728)Also succeeded, but the first one will report.
% 2.48/0.92  % (1711726)Refutation not found, incomplete strategy
% 2.48/0.92  % (1711726)------------------------------
% 2.48/0.92  % (1711726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/0.92  % (1711726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/0.92  % (1711726)CaDiCaL version: 2.1.3
% 2.48/0.92  % (1711726)Termination reason: Refutation not found, incomplete strategy
% 2.48/0.92  % (1711726)Time elapsed: 0.028 s
% 2.48/0.92  % (1711726)Peak memory usage: 115 MB
% 2.48/0.92  % (1711726)Instructions burned: 7 (million)
% 2.48/0.92  % (1711732)Also succeeded, but the first one will report.
% 2.48/0.92  % (1711727)Also succeeded, but the first one will report.
% 2.48/0.92  % (1711731)Refutation found. Thanks to Tanya!
% 2.48/0.92  % SZS status Theorem for theBenchmark
% 2.48/0.92  % SZS output start Proof for theBenchmark
% See solution above
% 2.48/0.92  % (1711731)------------------------------
% 2.48/0.92  % (1711731)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/0.92  % (1711731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/0.92  % (1711731)CaDiCaL version: 2.1.3
% 2.48/0.92  % (1711731)Termination reason: Refutation
% 2.48/0.92  % (1711731)Time elapsed: 0.019 s
% 2.48/0.92  % (1711731)Peak memory usage: 116 MB
% 2.48/0.92  % (1711731)Instructions burned: 10 (million)
% 2.48/0.92  % (1711731)------------------------------
% 2.48/0.92  % (1711731)------------------------------
% 2.48/0.92  % (1711712)Success in time 0.28 s
% 2.48/0.92  % Vampire exiting
%------------------------------------------------------------------------------