↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n015.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:05 AM UTC 2026

% Result   : Theorem 2.71s 1.16s
% Output   : Refutation 2.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   49 (  34 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   36 (  10   ~;  18   |;   5   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number arithmetic     :  138 (  14 atm;   0 fun;  94 num;  30 var)
%            Number of types       :    2 (   1 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (   4 usr;  11 con; 0-3 aty)
%            Number of variables   :   46 (  41   !;   5   ?;  46   :)

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

tff(func_def_0,type,
    read: ( array * $int ) > $int ).

tff(func_def_1,type,
    write: ( array * $int * $int ) > array ).

tff(func_def_15,type,
    sK0: array ).

tff(func_def_16,type,
    sK1: array ).

tff(f1,axiom,
    ! [X2: $int,X1: $int,X0: array] : ( read(write(X0,X1,X2),X1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

tff(f2,axiom,
    ! [X3: $int,X2: $int,X1: $int,X0: array] :
      ( ( X1 = X2 )
      | ( read(write(X0,X1,X3),X2) = read(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

tff(f3,conjecture,
    ! [X1: array,X0: array] :
      ( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
     => ? [X2: $int] :
          ( $less(read(X0,X2),40)
          & $less(30,read(X0,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f4,negated_conjecture,
    ~ ! [X1: array,X0: array] :
        ( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
       => ? [X2: $int] :
            ( $less(read(X0,X2),40)
            & $less(30,read(X0,X2)) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

tff(f17,plain,
    ~ ! [X1: array,X0: array] :
        ( ( write(write(write(write(X0,3,33),4,444),5,55),4,44) = X1 )
       => ? [X2: $int] :
            ( $less(30,read(X1,X2))
            & $less(read(X1,X2),40) ) ),
    inference(rectify,[],[f4]) ).

tff(f18,plain,
    ! [X1: $int,X0: $int,X3: array,X2: $int] :
      ( ( X1 = X2 )
      | ( read(X3,X1) = read(write(X3,X2,X0),X1) ) ),
    inference(rectify,[],[f2]) ).

tff(f19,plain,
    ! [X1: $int,X0: $int,X2: array] : ( read(write(X2,X1,X0),X1) = X0 ),
    inference(rectify,[],[f1]) ).

tff(f20,plain,
    ? [X0: array,X1: array] :
      ( ! [X2: $int] :
          ( ~ $less(30,read(X1,X2))
          | ~ $less(read(X1,X2),40) )
      & ( write(write(write(write(X0,3,33),4,444),5,55),4,44) = X1 ) ),
    inference(ennf_transformation,[],[f17]) ).

tff(f21,plain,
    ( ! [X2: $int] :
        ( ~ $less(30,read(sK1,X2))
        | ~ $less(read(sK1,X2),40) )
    & ( sK1 = write(write(write(write(sK0,3,33),4,444),5,55),4,44) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f20]) ).

tff(f22,plain,
    ! [X0: $int,X1: $int,X2: array] : ( read(write(X2,X0,X1),X0) = X1 ),
    inference(rectify,[],[f19]) ).

tff(f23,plain,
    ! [X0: $int,X1: $int,X2: array,X3: $int] :
      ( ( X0 = X3 )
      | ( read(write(X2,X3,X1),X0) = read(X2,X0) ) ),
    inference(rectify,[],[f18]) ).

tff(f24,plain,
    sK1 = write(write(write(write(sK0,3,33),4,444),5,55),4,44),
    inference(cnf_transformation,[],[f21]) ).

tff(f25,plain,
    ! [X2: $int] :
      ( ~ $less(30,read(sK1,X2))
      | ~ $less(read(sK1,X2),40) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f26,plain,
    ! [X2: array,X0: $int,X1: $int] : ( read(write(X2,X0,X1),X0) = X1 ),
    inference(cnf_transformation,[],[f22]) ).

tff(f27,plain,
    ! [X2: array,X3: $int,X0: $int,X1: $int] :
      ( ( read(write(X2,X3,X1),X0) = read(X2,X0) )
      | ( X0 = X3 ) ),
    inference(cnf_transformation,[],[f23]) ).

tff(f271,plain,
    ! [X0: $int] :
      ( ( read(sK1,X0) = read(write(write(write(sK0,3,33),4,444),5,55),X0) )
      | ( 4 = X0 ) ),
    inference(superposition,[],[f27,f24]) ).

tff(f273,plain,
    ! [X0: $int] :
      ( ( read(write(write(sK0,3,33),4,444),X0) = read(sK1,X0) )
      | ( 4 = X0 )
      | ( 5 = X0 ) ),
    inference(superposition,[],[f271,f27]) ).

tff(f314,plain,
    ! [X0: $int] :
      ( ( 4 = X0 )
      | ( read(sK1,X0) = read(write(sK0,3,33),X0) )
      | ( 4 = X0 )
      | ( 5 = X0 ) ),
    inference(superposition,[],[f273,f27]) ).

tff(f316,plain,
    ! [X0: $int] :
      ( ( read(sK1,X0) = read(write(sK0,3,33),X0) )
      | ( 5 = X0 )
      | ( 4 = X0 ) ),
    inference(duplicate_literal_removal,[],[f314]) ).

tff(f318,plain,
    ( ( 3 = 5 )
    | ( 33 = read(sK1,3) )
    | ( 3 = 4 ) ),
    inference(superposition,[],[f316,f26]) ).

tff(f322,plain,
    33 = read(sK1,3),
    inference(evaluation,[],[f318]) ).

tff(f324,plain,
    ( ~ $less(30,33)
    | ~ $less(33,40) ),
    inference(superposition,[],[f25,f322]) ).

tff(f325,plain,
    $false,
    inference(evaluation,[],[f324]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : DAT007_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n015.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 00:08:32 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running first-order theorem proving
% 0.07/0.23  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.71/1.16  % (3163564)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.71/1.16  % (3163571)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2855133051:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 2.71/1.16  % (3163571)First to succeed.
% 2.71/1.16  % (3163571)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3163564"
% 2.71/1.16  % (3163575)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=2760622956:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 2.71/1.16  % (3163574)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=2072154749:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 2.71/1.16  % (3163572)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=1248359687:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 2.71/1.16  % (3163569)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=3084427672:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 2.71/1.16  % (3163573)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=2920566674:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 2.71/1.16  % (3163570)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=1733565023:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 2.71/1.16  % (3163573)Instruction limit reached! 
% 2.71/1.16  % (3163573)------------------------------
% 2.71/1.16  % (3163573)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.16  % (3163573)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.16  % (3163573)CaDiCaL version: 2.1.3
% 2.71/1.16  % (3163573)Termination reason: Instruction limit
% 2.71/1.16  % (3163573)Termination phase: Saturation
% 2.71/1.16  % (3163573)Time elapsed: 0.004 s
% 2.71/1.16  % (3163573)Peak memory usage: 88 MB
% 2.71/1.16  % (3163573)Instructions burned: 5 (million)
% 2.71/1.16  % (3163572)Instruction limit reached! 
% 2.71/1.16  % (3163572)------------------------------
% 2.71/1.16  % (3163572)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.16  % (3163572)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.16  % (3163572)CaDiCaL version: 2.1.3
% 2.71/1.16  % (3163572)Termination reason: Instruction limit
% 2.71/1.16  % (3163572)Termination phase: Saturation
% 2.71/1.16  % (3163572)Time elapsed: 0.005 s
% 2.71/1.16  % (3163572)Peak memory usage: 88 MB
% 2.71/1.16  % (3163572)Instructions burned: 8 (million)
% 2.71/1.16  % (3163569)Instruction limit reached! 
% 2.71/1.16  % (3163569)------------------------------
% 2.71/1.16  % (3163569)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.16  % (3163569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.16  % (3163569)CaDiCaL version: 2.1.3
% 2.71/1.16  % (3163569)Termination reason: Instruction limit
% 2.71/1.16  % (3163569)Termination phase: Saturation
% 2.71/1.16  % (3163569)Time elapsed: 0.030 s
% 2.71/1.16  % (3163569)Peak memory usage: 115 MB
% 2.71/1.16  % (3163569)Instructions burned: 13 (million)
% 2.71/1.16  % (3163574)Also succeeded, but the first one will report.
% 2.71/1.16  % (3163570)Also succeeded, but the first one will report.
% 2.71/1.16  % (3163575)Instruction limit reached! 
% 2.71/1.16  % (3163575)------------------------------
% 2.71/1.16  % (3163575)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.16  % (3163575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.16  % (3163575)CaDiCaL version: 2.1.3
% 2.71/1.16  % (3163575)Termination reason: Instruction limit
% 2.71/1.16  % (3163575)Termination phase: Saturation
% 2.71/1.16  % (3163575)Time elapsed: 0.047 s
% 2.71/1.16  % (3163575)Peak memory usage: 115 MB
% 2.71/1.16  % (3163575)Instructions burned: 34 (million)
% 2.71/1.16  % (3163571)Refutation found. Thanks to Tanya!
% 2.71/1.16  % SZS status Theorem for theBenchmark
% 2.71/1.16  % SZS output start Proof for theBenchmark
% See solution above
% 2.71/1.16  % (3163571)------------------------------
% 2.71/1.16  % (3163571)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.16  % (3163571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.16  % (3163571)CaDiCaL version: 2.1.3
% 2.71/1.16  % (3163571)Termination reason: Refutation
% 2.71/1.16  % (3163571)Time elapsed: 0.023 s
% 2.71/1.16  % (3163571)Peak memory usage: 113 MB
% 2.71/1.16  % (3163571)Instructions burned: 20 (million)
% 2.71/1.16  % (3163571)------------------------------
% 2.71/1.16  % (3163571)------------------------------
% 2.71/1.16  % (3163564)Success in time 0.291 s
% 2.71/1.16  % Vampire exiting
%------------------------------------------------------------------------------