↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n003.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 11:56:29 AM UTC 2026

% Result   : Theorem 3.37s 1.23s
% Output   : Refutation 3.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :    7 (   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    :   11 (   2 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   15 (  14 usr;   1 prp; 0-3 aty)
%            Number of functors    :   47 (  47 usr;  12 con; 0-5 aty)
%            Number of variables   :    4 (   4   !;   0   ?;   4   :)

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

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

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

tff(type_def_8,type,
    nat: $tType ).

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

tff(func_def_0,type,
    combb: 
      !>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,X1),fun(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,
    combi: 
      !>[X0: $tType] : fun(X0,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,
    one_one: 
      !>[X0: $tType] : X0 ).

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

tff(func_def_6,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_7,type,
    it: fun(dB,bool) ).

tff(func_def_8,type,
    abs: dB > dB ).

tff(func_def_9,type,
    app: fun(dB,fun(dB,dB)) ).

tff(func_def_10,type,
    var: nat > dB ).

tff(func_def_11,type,
    dB_size: dB > nat ).

tff(func_def_12,type,
    lift: fun(dB,fun(nat,dB)) ).

tff(func_def_13,type,
    liftn: ( nat * dB * nat ) > dB ).

tff(func_def_14,type,
    subst: fun(dB,fun(dB,fun(nat,dB))) ).

tff(func_def_15,type,
    substn: ( dB * dB * nat ) > dB ).

tff(func_def_16,type,
    foldl: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).

tff(func_def_17,type,
    map: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).

tff(func_def_18,type,
    suc: nat > nat ).

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

tff(func_def_20,type,
    size_size: 
      !>[X0: $tType] : ( X0 > nat ) ).

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

tff(func_def_22,type,
    fFalse: bool ).

tff(func_def_23,type,
    fTrue: bool ).

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

tff(func_def_25,type,
    ia: nat ).

tff(func_def_26,type,
    ja: nat ).

tff(func_def_27,type,
    ra: dB ).

tff(func_def_28,type,
    s: dB ).

tff(func_def_29,type,
    ss: list(dB) ).

tff(func_def_30,type,
    sK1: nat > nat ).

tff(func_def_31,type,
    sK2: fun(nat,bool) > nat ).

tff(func_def_32,type,
    sK3: fun(nat,bool) > nat ).

tff(func_def_33,type,
    sK4: nat > nat ).

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

tff(func_def_35,type,
    sK6: ( dB * dB ) > dB ).

tff(func_def_36,type,
    sK7: dB > dB ).

tff(func_def_37,type,
    sK8: dB > dB ).

tff(func_def_38,type,
    sK9: dB > list(dB) ).

tff(func_def_39,type,
    sK10: dB > list(dB) ).

tff(func_def_40,type,
    sK11: dB > nat ).

tff(func_def_41,type,
    sK12: dB > dB ).

tff(func_def_42,type,
    sK13: ( dB * dB * dB ) > dB ).

tff(func_def_43,type,
    sK14: ( dB * dB * dB ) > dB ).

tff(func_def_44,type,
    sK15: ( dB * dB * dB ) > dB ).

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

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

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

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

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

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

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

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

tff(pred_def_9,type,
    linord219039673up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_10,type,
    beta: ( dB * dB ) > $o ).

tff(pred_def_11,type,
    listsp: 
      !>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).

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

tff(pred_def_13,type,
    sP0: dB > $o ).

tff(pred_def_14,type,
    sQ16_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f117,axiom,
    ! [X0: nat,X1: nat] : pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(X0))),suc(X1))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(X0)),X1)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(X0)),X1),ss)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(f120,conjecture,
    pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).

tff(f121,negated_conjecture,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    inference(negated_conjecture,[status(cth)],[f120]) ).

tff(f125,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    inference(flattening,[],[f121]) ).

tff(f370,plain,
    ! [X0: nat,X1: nat] : pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(X0))),suc(X1))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(X0)),X1)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(X0)),X1),ss)))),
    inference(cnf_transformation,[],[f117]) ).

tff(f373,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    inference(cnf_transformation,[],[f125]) ).

tff(f1044,plain,
    $false,
    inference(resolution,[],[f370,f373]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL760_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n003.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 16:47:56 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  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
% 3.37/1.22  % (772554)Detected formulas, will run a generic FOF schedule.
% 3.37/1.22  % (772564)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=305628696:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.37/1.22  % (772562)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1711366288:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.37/1.22  % (772559)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=3484526186:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.37/1.22  % (772563)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=926791492:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.37/1.22  % (772565)dis-21_1_sil=8000:lcm=predicate:random_seed=2972841557: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)
% 3.37/1.22  % (772560)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=2364036354:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.37/1.22  % (772561)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=343609850:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.37/1.22  % (772562)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.37/1.22  % (772561)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.37/1.22  % (772565)First to succeed.
% 3.37/1.22  % (772565)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-772554"
% 3.37/1.22  % (772562)Instruction limit reached! 
% 3.37/1.22  % (772562)------------------------------
% 3.37/1.22  % (772562)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.37/1.22  % (772562)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/1.22  % (772562)CaDiCaL version: 2.1.3
% 3.37/1.22  % (772562)Termination reason: Instruction limit
% 3.37/1.23  % (772562)Termination phase: Saturation
% 3.37/1.23  % (772562)Time elapsed: 0.055 s
% 3.37/1.23  % (772562)Peak memory usage: 89 MB
% 3.37/1.23  % (772562)Instructions burned: 109 (million)
% 3.37/1.23  % (772563)Also succeeded, but the first one will report.
% 3.37/1.23  % (772564)Also succeeded, but the first one will report.
% 3.37/1.23  % (772573)lrs+10_1_sil=8000:sp=occurrence:random_seed=1047186914:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.37/1.23  % (772573)Also succeeded, but the first one will report.
% 3.37/1.23  % (772565)Refutation found. Thanks to Tanya!
% 3.37/1.23  % SZS status Theorem for theBenchmark
% 3.37/1.23  % SZS output start Proof for theBenchmark
% See solution above
% 3.37/1.23  % (772565)------------------------------
% 3.37/1.23  % (772565)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.37/1.23  % (772565)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/1.23  % (772565)CaDiCaL version: 2.1.3
% 3.37/1.23  % (772565)Termination reason: Refutation
% 3.37/1.23  % (772565)Time elapsed: 0.023 s
% 3.37/1.23  % (772565)Peak memory usage: 89 MB
% 3.37/1.23  % (772565)Instructions burned: 38 (million)
% 3.37/1.23  % (772565)------------------------------
% 3.37/1.23  % (772565)------------------------------
% 3.37/1.23  % (772554)Success in time 0.422 s
% 3.37/1.23  % Vampire exiting
%------------------------------------------------------------------------------