↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n005.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 3.86s 1.32s
% Output   : Refutation 3.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   58 (  57 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   49 (  21   ~;  21   |;   3   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :   31 (   0 atm;   0 fun;   0 num;  31 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  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   67 (  64   !;   3   ?;  67   :)

% 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: $int ).

tff(func_def_5,type,
    sK1: ( array * array ) > $int ).

tff(f1,axiom,
    ! [X0: $int] : ( get(mkarray,X0) = none ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_17) ).

tff(f2,axiom,
    ! [X2: data,X1: $int,X0: array] : ( get(put(X0,X1,X2),X1) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_18) ).

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

tff(f5,axiom,
    ! [X1: array,X0: array] :
      ( ! [X2: $int] : ( get(X0,X2) = get(X1,X2) )
    <=> ( X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_21) ).

tff(f6,conjecture,
    ! [X0: $int] : ( put(mkarray,X0,none) = mkarray ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_2) ).

tff(f7,negated_conjecture,
    ~ ! [X0: $int] : ( put(mkarray,X0,none) = mkarray ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

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

tff(f9,plain,
    ! [X1: array,X0: array] :
      ( ! [X2: $int] : ( get(X0,X2) = get(X1,X2) )
    <=> ( X0 = X1 ) ),
    inference(rectify,[],[f5]) ).

tff(f11,plain,
    ! [X0: data,X1: $int,X2: array] : ( get(put(X2,X1,X0),X1) = X0 ),
    inference(rectify,[],[f2]) ).

tff(f12,plain,
    ? [X0: $int] : ( mkarray != put(mkarray,X0,none) ),
    inference(ennf_transformation,[],[f7]) ).

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

tff(f14,plain,
    mkarray != put(mkarray,sK0,none),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f12]) ).

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

tff(f17,plain,
    ! [X1: array,X0: array] :
      ( ( ! [X2: $int] : ( get(X0,X2) = get(X1,X2) )
        | ( X0 != X1 ) )
      & ( ( X0 = X1 )
        | ? [X2: $int] : ( get(X0,X2) != get(X1,X2) ) ) ),
    inference(nnf_transformation,[],[f9]) ).

tff(f18,plain,
    ! [X0: array,X1: array] :
      ( ( ! [X2: $int] : ( get(X0,X2) = get(X1,X2) )
        | ( X0 != X1 ) )
      & ( ( X0 = X1 )
        | ? [X3: $int] : ( get(X0,X3) != get(X1,X3) ) ) ),
    inference(rectify,[],[f17]) ).

tff(f19,plain,
    ! [X0: array,X1: array] :
      ( ( ! [X2: $int] : ( get(X0,X2) = get(X1,X2) )
        | ( X0 != X1 ) )
      & ( ( X0 = X1 )
        | ( get(X1,sK1(X0,X1)) != get(X0,sK1(X0,X1)) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f18]) ).

tff(f20,plain,
    ! [X0: $int] : ( get(mkarray,X0) = none ),
    inference(cnf_transformation,[],[f1]) ).

tff(f21,plain,
    mkarray != put(mkarray,sK0,none),
    inference(cnf_transformation,[],[f14]) ).

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

tff(f24,plain,
    ! [X2: array,X0: data,X1: $int] : ( get(put(X2,X1,X0),X1) = X0 ),
    inference(cnf_transformation,[],[f11]) ).

tff(f25,plain,
    ! [X0: array,X1: array] :
      ( ( get(X1,sK1(X0,X1)) != get(X0,sK1(X0,X1)) )
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f32,plain,
    ! [X0: array] :
      ( ( none != get(X0,sK1(X0,mkarray)) )
      | ( mkarray = X0 ) ),
    inference(constrained_superposition,[],[f25,f20]) ).

tff(f37,plain,
    ! [X2: data,X0: array,X1: $int] :
      ( ( none != get(X0,sK1(put(X0,X1,X2),mkarray)) )
      | ( sK1(put(X0,X1,X2),mkarray) = X1 )
      | ( mkarray = put(X0,X1,X2) ) ),
    inference(constrained_superposition,[],[f32,f22]) ).

tff(f68,plain,
    ! [X0: $int,X1: data] :
      ( ( sK1(put(mkarray,X0,X1),mkarray) = X0 )
      | ( none != none )
      | ( mkarray = put(mkarray,X0,X1) ) ),
    inference(constrained_superposition,[],[f37,f20]) ).

tff(f72,plain,
    ! [X0: $int,X1: data] :
      ( ( sK1(put(mkarray,X0,X1),mkarray) = X0 )
      | ( mkarray = put(mkarray,X0,X1) ) ),
    inference(trivial_inequality_removal,[],[f68]) ).

tff(f73,plain,
    ! [X0: $int,X1: data] :
      ( ( none != get(put(mkarray,X0,X1),X0) )
      | ( mkarray = put(mkarray,X0,X1) )
      | ( mkarray = put(mkarray,X0,X1) ) ),
    inference(constrained_superposition,[],[f32,f72]) ).

tff(f75,plain,
    ! [X0: $int,X1: data] :
      ( ( none != get(put(mkarray,X0,X1),X0) )
      | ( mkarray = put(mkarray,X0,X1) ) ),
    inference(duplicate_literal_removal,[],[f73]) ).

tff(f77,plain,
    ! [X0: $int,X1: data] :
      ( ( mkarray = put(mkarray,X0,X1) )
      | ( none != X1 ) ),
    inference(forward_demodulation,[],[f75,f24]) ).

tff(f80,plain,
    ( ( none != none )
    | ( mkarray != mkarray ) ),
    inference(constrained_superposition,[],[f21,f77]) ).

tff(f84,plain,
    $false,
    inference(trivial_inequality_removal,[],[f80]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT058_1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n005.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 00:07:16 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  Running first-order theorem proving
% 0.09/0.20  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.86/1.32  % (1300610)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.86/1.32  % (1300618)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=2871361653:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.86/1.32  % (1300618)Instruction limit reached! 
% 3.86/1.32  % (1300618)------------------------------
% 3.86/1.32  % (1300618)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/1.32  % (1300618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.32  % (1300618)CaDiCaL version: 2.1.3
% 3.86/1.32  % (1300618)Termination reason: Instruction limit
% 3.86/1.32  % (1300618)Time elapsed: 0.004 s
% 3.86/1.32  % (1300618)Peak memory usage: 88 MB
% 3.86/1.32  % (1300618)Instructions burned: 10 (million)
% 3.86/1.32  % (1300621)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3619879351:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.86/1.32  % (1300616)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2421577375:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.86/1.32  % (1300620)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=2921604216:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.86/1.32  % (1300615)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=2567363201:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.86/1.32  % (1300619)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3200818740:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.86/1.32  % (1300617)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=4166000378:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.86/1.32  % (1300619)First to succeed.
% 3.86/1.32  % (1300619)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1300610"
% 3.86/1.32  % (1300615)Refutation not found, incomplete strategy
% 3.86/1.32  % (1300615)------------------------------
% 3.86/1.32  % (1300615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/1.32  % (1300615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.32  % (1300615)CaDiCaL version: 2.1.3
% 3.86/1.32  % (1300615)Termination reason: Refutation not found, incomplete strategy
% 3.86/1.32  % (1300615)Time elapsed: 0.029 s
% 3.86/1.32  % (1300615)Peak memory usage: 115 MB
% 3.86/1.32  % (1300615)Instructions burned: 6 (million)
% 3.86/1.32  % (1300617)Also succeeded, but the first one will report.
% 3.86/1.32  % (1300616)Also succeeded, but the first one will report.
% 3.86/1.32  % (1300621)Also succeeded, but the first one will report.
% 3.86/1.32  % (1300620)Also succeeded, but the first one will report.
% 3.86/1.32  % (1300623)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=490435595:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.86/1.32  % (1300623)Also succeeded, but the first one will report.
% 3.86/1.32  % (1300619)Refutation found. Thanks to Tanya!
% 3.86/1.32  % SZS status Theorem for theBenchmark
% 3.86/1.32  % SZS output start Proof for theBenchmark
% See solution above
% 3.86/1.32  % (1300619)------------------------------
% 3.86/1.32  % (1300619)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/1.32  % (1300619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.32  % (1300619)CaDiCaL version: 2.1.3
% 3.86/1.32  % (1300619)Termination reason: Refutation
% 3.86/1.32  % (1300619)Time elapsed: 0.005 s
% 3.86/1.32  % (1300619)Peak memory usage: 89 MB
% 3.86/1.32  % (1300619)Instructions burned: 5 (million)
% 3.86/1.32  % (1300619)------------------------------
% 3.86/1.32  % (1300619)------------------------------
% 3.86/1.32  % (1300610)Success in time 0.477 s
% 3.86/1.32  % Vampire exiting
%------------------------------------------------------------------------------