↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : DAT077_1 : TPTP v9.3.1. Released v6.1.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:15 AM UTC 2026

% Result   : Theorem 2.87s 1.17s
% Output   : Refutation 2.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   18 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   61 (  19   ~;   6   |;  28   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number arithmetic     :   88 (  43 atm;   0 fun;  12 num;  33 var)
%            Number of types       :    3 (   1 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  11 usr;   1 con; 0-3 aty)
%            Number of variables   :   43 (  34   !;   9   ?;  43   :)

% 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_2,type,
    init: $int > array ).

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

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

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

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

tff(func_def_12,type,
    sK2: ( array * $int * array ) > $int ).

tff(func_def_13,type,
    sK3: ( array * array ) > $int ).

tff(func_def_14,type,
    sK4: ( $int * $int * array ) > $int ).

tff(func_def_15,type,
    sK5: $int > $int ).

tff(pred_def_4,type,
    sorted: ( array * $int ) > $o ).

tff(pred_def_6,type,
    inRange: ( array * $int * $int ) > $o ).

tff(pred_def_7,type,
    distinct: ( array * $int ) > $o ).

tff(f6,axiom,
    ! [X1: $int,X0: array] :
      ( ! [X2: $int,X3: $int] :
          ( ( $lesseq(0,X2)
            & $less(X2,X3)
            & $less(X2,X1)
            & $less(X3,X1) )
         => $lesseq(read(X0,X2),read(X0,X3)) )
    <=> sorted(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sorted1) ).

tff(f10,conjecture,
    ~ ! [X0: $int] :
      ? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c5) ).

tff(f11,negated_conjecture,
    ~ ~ ! [X0: $int] :
        ? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
    inference(negated_conjecture,[status(cth)],[f10]) ).

tff(f12,plain,
    ! [X1: $int,X0: array] :
      ( ! [X2: $int,X3: $int] :
          ( ( ~ $less(X2,0)
            & $less(X2,X3)
            & $less(X2,X1)
            & $less(X3,X1) )
         => ~ $less(read(X0,X3),read(X0,X2)) )
    <=> sorted(X0,X1) ),
    inference(theory_normalization,[],[f6]) ).

tff(f30,plain,
    ! [X1: array,X0: $int] :
      ( sorted(X1,X0)
    <=> ! [X3: $int,X2: $int] :
          ( ( $less(X3,X0)
            & ~ $less(X2,0)
            & $less(X2,X0)
            & $less(X2,X3) )
         => ~ $less(read(X1,X3),read(X1,X2)) ) ),
    inference(rectify,[],[f12]) ).

tff(f33,plain,
    ! [X0: $int] :
    ? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
    inference(flattening,[],[f11]) ).

tff(f38,plain,
    ! [X1: array,X0: $int] :
      ( ! [X3: $int,X2: $int] :
          ( ( $less(X3,X0)
            & ~ $less(X2,0)
            & $less(X2,X0)
            & $less(X2,X3) )
         => ~ $less(read(X1,X3),read(X1,X2)) )
     => sorted(X1,X0) ),
    inference(unused_predicate_definition_removal,[],[f30]) ).

tff(f39,plain,
    ! [X1: array,X0: $int] :
      ( sorted(X1,X0)
      | ? [X3: $int,X2: $int] :
          ( $less(read(X1,X3),read(X1,X2))
          & $less(X3,X0)
          & ~ $less(X2,0)
          & $less(X2,X0)
          & $less(X2,X3) ) ),
    inference(ennf_transformation,[],[f38]) ).

tff(f40,plain,
    ! [X1: array,X0: $int] :
      ( sorted(X1,X0)
      | ? [X2: $int,X3: $int] :
          ( $less(X2,X3)
          & $less(read(X1,X3),read(X1,X2))
          & $less(X2,X0)
          & ~ $less(X2,0)
          & $less(X3,X0) ) ),
    inference(flattening,[],[f39]) ).

tff(f46,plain,
    ! [X0: array,X1: $int] :
      ( sorted(X0,X1)
      | ? [X2: $int,X3: $int] :
          ( $less(X2,X3)
          & $less(read(X0,X3),read(X0,X2))
          & $less(X2,X1)
          & ~ $less(X2,0)
          & $less(X3,X1) ) ),
    inference(rectify,[],[f40]) ).

tff(f47,plain,
    ! [X0: array,X1: $int] :
      ( sorted(X0,X1)
      | ( $less(sK0(X0,X1),sK1(X0,X1))
        & $less(read(X0,sK1(X0,X1)),read(X0,sK0(X0,X1)))
        & $less(sK0(X0,X1),X1)
        & ~ $less(sK0(X0,X1),0)
        & $less(sK1(X0,X1),X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0,X1)),skolemize(X3,sK1(X0,X1))],[f46]) ).

tff(f55,plain,
    ! [X0: $int] : ~ sorted(rev(init(sK5(X0)),X0),X0),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f33]) ).

tff(f58,plain,
    ! [X0: array,X1: $int] :
      ( ~ $less(sK0(X0,X1),0)
      | sorted(X0,X1) ),
    inference(cnf_transformation,[],[f47]) ).

tff(f59,plain,
    ! [X0: array,X1: $int] :
      ( sorted(X0,X1)
      | $less(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f47]) ).

tff(f71,plain,
    ! [X0: $int] : ~ sorted(rev(init(sK5(X0)),X0),X0),
    inference(cnf_transformation,[],[f55]) ).

tff(f100,plain,
    ! [X0: $int] : $less(sK0(rev(init(sK5(X0)),X0),X0),X0),
    inference(resolution,[],[f59,f71]) ).

tff(f101,plain,
    sorted(rev(init(sK5(0)),0),0),
    inference(resolution,[],[f100,f58]) ).

tff(f103,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f101,f71]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : DAT077_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n005.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 00:07:46 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running first-order theorem proving
% 0.08/0.21  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
% 2.87/1.17  % (1301395)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.87/1.17  % (1301534)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3911878948:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 2.87/1.17  % (1301534)First to succeed.
% 2.87/1.17  % (1301534)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1301395"
% 2.87/1.17  % (1301526)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=3017121506:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 2.87/1.17  % (1301528)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=1042989437:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 2.87/1.17  % (1301525)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=3140508832:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 2.87/1.17  % (1301523)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1005329060:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 2.87/1.17  % (1301530)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=1001311972:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 2.87/1.17  % (1301530)Instruction limit reached! 
% 2.87/1.17  % (1301530)------------------------------
% 2.87/1.17  % (1301530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.17  % (1301530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.17  % (1301530)CaDiCaL version: 2.1.3
% 2.87/1.17  % (1301530)Termination reason: Instruction limit
% 2.87/1.17  % (1301530)Termination phase: Saturation
% 2.87/1.17  % (1301530)Time elapsed: 0.004 s
% 2.87/1.17  % (1301530)Peak memory usage: 88 MB
% 2.87/1.17  % (1301530)Instructions burned: 5 (million)
% 2.87/1.17  % (1301528)Instruction limit reached! 
% 2.87/1.17  % (1301528)------------------------------
% 2.87/1.17  % (1301528)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.17  % (1301528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.17  % (1301528)CaDiCaL version: 2.1.3
% 2.87/1.17  % (1301528)Termination reason: Instruction limit
% 2.87/1.17  % (1301528)Termination phase: Saturation
% 2.87/1.17  % (1301528)Time elapsed: 0.006 s
% 2.87/1.17  % (1301528)Peak memory usage: 88 MB
% 2.87/1.17  % (1301528)Instructions burned: 8 (million)
% 2.87/1.17  % (1301532)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=976183872:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 2.87/1.17  % (1301525)Also succeeded, but the first one will report.
% 2.87/1.17  % (1301523)Instruction limit reached! 
% 2.87/1.17  % (1301523)------------------------------
% 2.87/1.17  % (1301523)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.17  % (1301523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.17  % (1301523)CaDiCaL version: 2.1.3
% 2.87/1.17  % (1301523)Termination reason: Instruction limit
% 2.87/1.17  % (1301523)Termination phase: Saturation
% 2.87/1.17  % (1301523)Time elapsed: 0.029 s
% 2.87/1.17  % (1301523)Peak memory usage: 112 MB
% 2.87/1.17  % (1301523)Instructions burned: 13 (million)
% 2.87/1.17  % (1301526)Also succeeded, but the first one will report.
% 2.87/1.17  % (1301532)Also succeeded, but the first one will report.
% 2.87/1.17  % (1301534)Refutation found. Thanks to Tanya!
% 2.87/1.17  % SZS status Theorem for theBenchmark
% 2.87/1.17  % SZS output start Proof for theBenchmark
% See solution above
% 2.87/1.17  % (1301534)------------------------------
% 2.87/1.17  % (1301534)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.17  % (1301534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.17  % (1301534)CaDiCaL version: 2.1.3
% 2.87/1.17  % (1301534)Termination reason: Refutation
% 2.87/1.17  % (1301534)Time elapsed: 0.019 s
% 2.87/1.17  % (1301534)Peak memory usage: 112 MB
% 2.87/1.17  % (1301534)Instructions burned: 9 (million)
% 2.87/1.17  % (1301534)------------------------------
% 2.87/1.17  % (1301534)------------------------------
% 2.87/1.17  % (1301395)Success in time 0.325 s
% 2.87/1.17  % Vampire exiting
%------------------------------------------------------------------------------