↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL748_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 : n011.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:26 AM UTC 2026

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

% 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,
    one_one: 
      !>[X0: $tType] : X0 ).

tff(func_def_1,type,
    plus_plus: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

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

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

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

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

tff(func_def_6,type,
    dB_case: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).

tff(func_def_7,type,
    dB_rec: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).

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

tff(func_def_9,type,
    lift: ( dB * nat ) > dB ).

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

tff(func_def_11,type,
    subst: ( dB * dB * nat ) > dB ).

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

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

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

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

tff(func_def_16,type,
    fFalse: bool ).

tff(func_def_17,type,
    fTrue: bool ).

tff(func_def_18,type,
    ia: nat ).

tff(func_def_19,type,
    r: dB ).

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

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

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

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

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

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

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

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

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

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

tff(pred_def_11,type,
    semiri456707255roduct: 
      !>[X0: $tType] : $o ).

tff(pred_def_12,type,
    it: dB > $o ).

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

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

tff(f1,axiom,
    ! [X3: dB] :
      ( it(X3)
     => it(abs(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_Lambda) ).

tff(f5,axiom,
    ! [X0: nat,X1: dB] : ( lift(abs(X1),X0) = abs(lift(X1,plus_plus(nat,X0,one_one(nat)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_lift_Osimps_I3_J) ).

tff(f112,axiom,
    ! [X0: nat] : it(lift(r,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

tff(f113,conjecture,
    it(lift(abs(r),ia)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).

tff(f114,negated_conjecture,
    ~ it(lift(abs(r),ia)),
    inference(negated_conjecture,[status(cth)],[f113]) ).

tff(f115,plain,
    ~ it(lift(abs(r),ia)),
    inference(flattening,[],[f114]) ).

tff(f116,plain,
    ! [X0: dB] :
      ( it(X0)
     => it(abs(X0)) ),
    inference(rectify,[],[f1]) ).

tff(f119,plain,
    ! [X0: dB] :
      ( it(abs(X0))
      | ~ it(X0) ),
    inference(ennf_transformation,[],[f116]) ).

tff(f123,plain,
    ! [X0: nat] : it(lift(r,X0)),
    inference(cnf_transformation,[],[f112]) ).

tff(f124,plain,
    ~ it(lift(abs(r),ia)),
    inference(cnf_transformation,[],[f115]) ).

tff(f126,plain,
    ! [X0: dB] :
      ( it(abs(X0))
      | ~ it(X0) ),
    inference(cnf_transformation,[],[f119]) ).

tff(f131,plain,
    ! [X0: nat,X1: dB] : ( lift(abs(X1),X0) = abs(lift(X1,plus_plus(nat,X0,one_one(nat)))) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f135,plain,
    ~ it(abs(lift(r,plus_plus(nat,ia,one_one(nat))))),
    inference(forward_demodulation,[],[f124,f131]) ).

tff(f136,plain,
    ~ it(lift(r,plus_plus(nat,ia,one_one(nat)))),
    inference(resolution,[],[f135,f126]) ).

tff(f137,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f136,f123]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL748_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40  % Computer : n011.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sun Sep 27 16:43:45 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.44  Running first-order theorem proving
% 0.12/0.44  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.73/1.40  % (2610491)Detected formulas, will run a generic FOF schedule.
% 2.73/1.40  % (2610600)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1864321406:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.73/1.40  % (2610600)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.73/1.40  % (2610600)First to succeed.
% 2.73/1.40  % (2610600)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2610491"
% 2.73/1.40  % (2610597)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=785685276:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.73/1.40  % (2610599)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=1557983033:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.73/1.40  % (2610602)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=18829326:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.73/1.40  % (2610598)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=289447564:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.73/1.40  % (2610603)dis-21_1_sil=8000:lcm=predicate:random_seed=3845418700: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.73/1.40  % (2610601)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3087079300:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.73/1.40  % (2610599)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.73/1.40  % (2610601)Also succeeded, but the first one will report.
% 2.73/1.40  % (2610602)Also succeeded, but the first one will report.
% 2.73/1.40  % (2610603)Instruction limit reached! 
% 2.73/1.40  % (2610603)------------------------------
% 2.73/1.40  % (2610603)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.40  % (2610603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.40  % (2610603)CaDiCaL version: 2.1.3
% 2.73/1.40  % (2610603)Termination reason: Instruction limit
% 2.73/1.40  % (2610603)Termination phase: Saturation
% 2.73/1.40  % (2610603)Time elapsed: 0.075 s
% 2.73/1.40  % (2610603)Peak memory usage: 89 MB
% 2.73/1.40  % (2610603)Instructions burned: 129 (million)
% 2.73/1.40  % (2610600)Refutation found. Thanks to Tanya!
% 2.73/1.40  % SZS status Theorem for theBenchmark
% 2.73/1.40  % SZS output start Proof for theBenchmark
% See solution above
% 2.85/1.40  % (2610600)------------------------------
% 2.85/1.40  % (2610600)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.40  % (2610600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.40  % (2610600)CaDiCaL version: 2.1.3
% 2.85/1.40  % (2610600)Termination reason: Refutation
% 2.85/1.40  % (2610600)Time elapsed: 0.002 s
% 2.85/1.40  % (2610600)Peak memory usage: 88 MB
% 2.85/1.40  % (2610600)Instructions burned: 2 (million)
% 2.85/1.40  % (2610600)------------------------------
% 2.85/1.40  % (2610600)------------------------------
% 2.85/1.40  % (2610491)Success in time 0.309 s
% 2.85/1.40  % Vampire exiting
%------------------------------------------------------------------------------