↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n016.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 01:30:43 PM UTC 2026

% Result   : Theorem 2.85s 1.18s
% Output   : Refutation 2.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :    8 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-6 aty)
%            Number of functors    :   23 (  23 usr;   5 con; 0-5 aty)
%            Number of variables   :    6 (   6   !;   0   ?;   6   :)

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

tff(type_def_6,type,
    bool: $tType ).

tff(type_def_7,type,
    hoare_28830079triple: $tType > $tType ).

tff(type_def_8,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    combb: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).

tff(func_def_1,type,
    combc: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).

tff(func_def_2,type,
    combk: 
      !>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).

tff(func_def_3,type,
    combs: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).

tff(func_def_4,type,
    bot_bot: 
      !>[X0: $tType] : X0 ).

tff(func_def_5,type,
    ord_Least: 
      !>[X0: $tType] : ( fun(X0,bool) > X0 ) ).

tff(func_def_6,type,
    ord_less_eq: 
      !>[X0: $tType] : fun(X0,fun(X0,bool)) ).

tff(func_def_7,type,
    powp: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(fun(X0,bool),bool) ) ).

tff(func_def_8,type,
    collect: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).

tff(func_def_9,type,
    pow: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(fun(X0,bool),bool) ) ).

tff(func_def_10,type,
    insert: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > fun(X0,bool) ) ).

tff(func_def_11,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_12,type,
    fFalse: bool ).

tff(func_def_13,type,
    fTrue: bool ).

tff(func_def_14,type,
    fconj: fun(bool,fun(bool,bool)) ).

tff(func_def_15,type,
    fequal: 
      !>[X0: $tType] : fun(X0,fun(X0,bool)) ).

tff(func_def_16,type,
    member: 
      !>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).

tff(func_def_17,type,
    g: fun(hoare_28830079triple(a),bool) ).

tff(func_def_18,type,
    ga: fun(hoare_28830079triple(a),bool) ).

tff(func_def_19,type,
    sK0: 
      !>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).

tff(func_def_20,type,
    sK1: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(pred_def_1,type,
    enum: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    bot: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    ord: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    order: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    linorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    preorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    wellorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    enum_enum_all: 
      !>[X0: $tType] : ( fun(X0,bool) > $o ) ).

tff(pred_def_9,type,
    hoare_992312373derivs: 
      !>[X0: $tType] : ( ( fun(hoare_28830079triple(X0),bool) * fun(hoare_28830079triple(X0),bool) ) > $o ) ).

tff(pred_def_10,type,
    inv_imagep: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X0,bool)) * fun(X1,X0) * X1 * X1 ) > $o ) ).

tff(pred_def_11,type,
    pp: bool > $o ).

tff(f1,axiom,
    ! [X1: $tType,X3: fun(hoare_28830079triple(X1),bool)] : hoare_992312373derivs(X1,X3,bot_bot(fun(hoare_28830079triple(X1),bool))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_empty) ).

tff(f126,conjecture,
    hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

tff(f127,negated_conjecture,
    ~ hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    inference(negated_conjecture,[status(cth)],[f126]) ).

tff(f128,plain,
    ~ hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    inference(flattening,[],[f127]) ).

tff(f129,plain,
    ! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool)] : hoare_992312373derivs(X0,X1,bot_bot(fun(hoare_28830079triple(X0),bool))),
    inference(rectify,[],[f1]) ).

tff(f154,plain,
    ~ hoare_992312373derivs(a,ga,bot_bot(fun(hoare_28830079triple(a),bool))),
    inference(cnf_transformation,[],[f128]) ).

tff(f163,plain,
    ! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool)] : hoare_992312373derivs(X0,X1,bot_bot(fun(hoare_28830079triple(X0),bool))),
    inference(cnf_transformation,[],[f129]) ).

tff(f184,plain,
    $false,
    inference(resolution,[],[f163,f154]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW512_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n016.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 14:22:01 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running first-order theorem proving
% 0.08/0.22  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.85/1.18  % (3649583)Detected formulas, will run a generic FOF schedule.
% 2.85/1.18  % (3649592)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1960534140:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.85/1.18  % (3649592)First to succeed.
% 2.85/1.18  % (3649592)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3649583"
% 2.85/1.18  % (3649593)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4111081377:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.85/1.18  % (3649589)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1325322108:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.85/1.18  % (3649591)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3437428757:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.85/1.18  % (3649590)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3154270007:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.85/1.18  % (3649588)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1879150787:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.85/1.18  % (3649594)dis-21_1_sil=8000:lcm=predicate:random_seed=1909962693:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.85/1.18  % (3649591)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.85/1.18  % (3649591)Also succeeded, but the first one will report.
% 2.85/1.18  % (3649590)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.85/1.18  % (3649594)Also succeeded, but the first one will report.
% 2.85/1.18  % (3649593)Also succeeded, but the first one will report.
% 2.85/1.18  % (3649592)Refutation found. Thanks to Tanya!
% 2.85/1.18  % SZS status Theorem for theBenchmark
% 2.85/1.18  % SZS output start Proof for theBenchmark
% See solution above
% 2.85/1.18  % (3649592)------------------------------
% 2.85/1.18  % (3649592)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.18  % (3649592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.18  % (3649592)CaDiCaL version: 2.1.3
% 2.85/1.18  % (3649592)Termination reason: Refutation
% 2.85/1.18  % (3649592)Time elapsed: 0.002 s
% 2.85/1.18  % (3649592)Peak memory usage: 88 MB
% 2.85/1.18  % (3649592)Instructions burned: 3 (million)
% 2.85/1.18  % (3649592)------------------------------
% 2.85/1.18  % (3649592)------------------------------
% 2.85/1.18  % (3649583)Success in time 0.319 s
% 2.85/1.18  % Vampire exiting
%------------------------------------------------------------------------------