↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n008.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 : Wed Sep 30 08:07:34 AM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   4 unt;   0 def)
%            Number of atoms       :    4 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    1 (   1   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   40 (  40 usr;   2 con; 0-4 aty)
%            Number of variables   :    0 (   0   !;   0   ?)

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

tff(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

tff(type_def_7,type,
    tp__i: $tType ).

tff(func_def_0,type,
    bool: del ).

tff(func_def_1,type,
    ind: del ).

tff(func_def_2,type,
    arr: del > del > del ).

tff(func_def_3,type,
    mem: $i > del > $o ).

tff(func_def_4,type,
    ap: $i > $i > $i ).

tff(func_def_5,type,
    lam: del > ( $i > $i ) > $i ).

tff(func_def_6,type,
    p: $i > $o ).

tff(func_def_7,type,
    inj__o: $o > $i ).

tff(func_def_9,type,
    c_2Emin_2E_3D: del > $i ).

tff(func_def_11,type,
    c_2Emin_2E_40: del > $i ).

tff(func_def_12,type,
    ty_2Ebool_2Eitself: del > del ).

tff(func_def_13,type,
    c_2Ebool_2E_21: del > $i ).

tff(func_def_15,type,
    c_2Ebool_2E_3F: del > $i ).

tff(func_def_16,type,
    c_2Ebool_2E_3F_21: del > $i ).

tff(func_def_17,type,
    c_2Ebool_2EARB: del > $i ).

tff(func_def_19,type,
    c_2Ebool_2ECOND: del > $i ).

tff(func_def_20,type,
    c_2Ebool_2EDATATYPE: del > $i ).

tff(func_def_22,type,
    c_2Ebool_2EIN: del > $i ).

tff(func_def_23,type,
    c_2Ebool_2ELET: del > del > $i ).

tff(func_def_24,type,
    c_2Ebool_2EONE__ONE: del > del > $i ).

tff(func_def_25,type,
    c_2Ebool_2EONTO: del > del > $i ).

tff(func_def_26,type,
    c_2Ebool_2ERES__ABSTRACT: del > del > $i ).

tff(func_def_27,type,
    c_2Ebool_2ERES__EXISTS: del > $i ).

tff(func_def_28,type,
    c_2Ebool_2ERES__EXISTS__UNIQUE: del > $i ).

tff(func_def_29,type,
    c_2Ebool_2ERES__FORALL: del > $i ).

tff(func_def_30,type,
    c_2Ebool_2ERES__SELECT: del > $i ).

tff(func_def_32,type,
    c_2Ebool_2ETYPE__DEFINITION: del > del > $i ).

tff(func_def_34,type,
    c_2Ebool_2Eitself__case: del > del > $i ).

tff(func_def_35,type,
    c_2Ebool_2Eliteral__case: del > del > $i ).

tff(func_def_36,type,
    c_2Ebool_2Ethe__value: del > $i ).

tff(func_def_38,type,
    inj__i: tp__i > $i ).

tff(func_def_39,type,
    surj__i: $i > tp__i ).

tff(func_def_40,type,
    db1: 
      !>[X0: $tType] : X0 ).

tff(func_def_41,type,
    db0: 
      !>[X0: $tType] : X0 ).

tff(func_def_42,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

tff(func_def_43,type,
    db2: 
      !>[X0: $tType] : X0 ).

tff(func_def_46,type,
    db3: 
      !>[X0: $tType] : X0 ).

tff(func_def_48,type,
    sK1: ( $i > $i ) > del > del > $i ).

tff(func_def_49,type,
    sK2: del > $i > $i ).

tff(func_def_50,type,
    sK3: $i > del > $i ).

tff(func_def_52,type,
    sK5: $i > del > $i > $i ).

fof(f73,conjecture,
    $true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Ebool_2ETRUTH) ).

fof(f74,negated_conjecture,
    ~ $true,
    inference(negated_conjecture,[status(cth)],[f73]) ).

fof(f219,plain,
    $false,
    inference(true_and_false_elimination,[],[f74]) ).

fof(f292,plain,
    $false,
    inference(cnf_transformation,[],[f219]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP001^5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17  % Computer : n008.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 19:18:59 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  Running higher-order theorem proving
% 0.09/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.28  % (3604632)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28  % (3604637)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2953252469:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28  % (3604637) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3604632-3604637"...
% 0.21/0.28  % (3604643)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.28  % (3604643)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.21/0.28  % (3604637)...printing done.
% 0.21/0.28  % (3604637)Refutation found. Thanks to Tanya!
% 0.21/0.28  % SZS status Theorem for theBenchmark
% 0.21/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28  % (3604637)------------------------------
% 0.21/0.28  % (3604637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28  % (3604637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28  % (3604637)CaDiCaL version: 2.1.3
% 0.21/0.28  % (3604637)Termination reason: Refutation
% 0.21/0.28  % (3604637)Time elapsed: 0.004 s
% 0.21/0.28  % (3604637)Peak memory usage: 12 MB
% 0.21/0.28  % (3604637)Instructions burned: 16 (million)
% 0.21/0.28  % (3604632)Success in time 0.039 s
% 0.21/0.28  % Vampire exiting
%------------------------------------------------------------------------------