↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n026.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:39:52 AM UTC 2026

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

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

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

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

tff(func_def_0,type,
    vNat: vTy ).

tff(func_def_1,type,
    vSucc: vTerm > vTerm ).

tff(func_def_2,type,
    vPred: vTerm > vTerm ).

tff(func_def_3,type,
    vsomeTerm: vTerm > vOptTerm ).

tff(func_def_4,type,
    vZero: vTerm ).

tff(func_def_5,type,
    vIszero: vTerm > vTerm ).

tff(func_def_6,type,
    vTrue: vTerm ).

tff(func_def_7,type,
    vFalse: vTerm ).

tff(func_def_8,type,
    vnoTerm: vOptTerm ).

tff(func_def_9,type,
    vPlus: ( vTerm * vTerm ) > vTerm ).

tff(func_def_10,type,
    vB: vTy ).

tff(func_def_11,type,
    vIfelse: ( vTerm * vTerm * vTerm ) > vTerm ).

tff(func_def_12,type,
    vreduce: vTerm > vOptTerm ).

tff(func_def_13,type,
    vplusop: ( vTerm * vTerm ) > vTerm ).

tff(func_def_14,type,
    vgetTerm: vOptTerm > vTerm ).

tff(func_def_15,type,
    sK1: vTy ).

tff(func_def_16,type,
    sK2: vTerm > vTerm ).

tff(func_def_17,type,
    sK3: vTerm > vTerm ).

tff(func_def_18,type,
    sK4: vTerm > vTerm ).

tff(func_def_19,type,
    sK5: vTerm > vTerm ).

tff(func_def_20,type,
    sK6: vTerm > vTerm ).

tff(func_def_21,type,
    sK7: vTerm > vTerm ).

tff(func_def_22,type,
    sK8: vTerm > vTerm ).

tff(func_def_23,type,
    sK9: vTerm > vTerm ).

tff(func_def_24,type,
    sK10: vTerm > vTerm ).

tff(func_def_25,type,
    sK11: vTerm > vTerm ).

tff(func_def_26,type,
    sK12: vTerm > vTerm ).

tff(func_def_27,type,
    sK13: vTerm > vTerm ).

tff(func_def_28,type,
    sK14: vTerm > vTerm ).

tff(func_def_29,type,
    sK15: vTerm > vTerm ).

tff(func_def_30,type,
    sK16: vTerm > vTerm ).

tff(func_def_31,type,
    sK17: vTerm > vTerm ).

tff(func_def_32,type,
    sK18: vTerm > vTerm ).

tff(func_def_33,type,
    sK19: vTerm > vTerm ).

tff(func_def_34,type,
    sK20: ( vTerm * vTerm * vTerm ) > vTerm ).

tff(func_def_35,type,
    sK21: ( vTerm * vTerm * vTerm ) > vTerm ).

tff(func_def_36,type,
    sK22: ( vTerm * vTerm * vTerm ) > vTerm ).

tff(func_def_37,type,
    sK23: ( vTerm * vTerm * vTerm ) > vTerm ).

tff(func_def_38,type,
    sK24: vOptTerm > vTerm ).

tff(func_def_39,type,
    sK25: vTerm > vTerm ).

tff(func_def_40,type,
    sK26: vTerm > vTerm ).

tff(func_def_41,type,
    sK27: vTerm > vTerm ).

tff(func_def_42,type,
    sK28: vTerm > vTerm ).

tff(func_def_43,type,
    sK29: vTerm > vTerm ).

tff(func_def_44,type,
    sK30: vTerm > vTerm ).

tff(func_def_45,type,
    sK31: vTerm > vTerm ).

tff(func_def_46,type,
    sK32: vTerm > vTerm ).

tff(func_def_47,type,
    sK33: vTerm > vTerm ).

tff(func_def_48,type,
    sK34: vTerm > vTerm ).

tff(func_def_49,type,
    sK35: vTerm > vTerm ).

tff(func_def_50,type,
    sK36: vTerm > vTerm ).

tff(func_def_51,type,
    sK37: vOptTerm > vTerm ).

tff(pred_def_1,type,
    visValue: vTerm > $o ).

tff(pred_def_2,type,
    visNV: vTerm > $o ).

tff(pred_def_3,type,
    visSomeTerm: vOptTerm > $o ).

tff(pred_def_4,type,
    vptchecksimple: ( vTerm * vTy ) > $o ).

tff(pred_def_5,type,
    sP0: ( vTerm * vTerm * vTerm ) > $o ).

tff(f46,axiom,
    visValue(vTrue),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isValue-0') ).

tff(f105,conjecture,
    ! [X0: vTy] :
      ( ( vptchecksimple(vTrue,X0)
        & ~ visValue(vTrue) )
     => ( vreduce(vTrue) != vnoTerm ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-True') ).

tff(f106,negated_conjecture,
    ~ ! [X0: vTy] :
        ( ( vptchecksimple(vTrue,X0)
          & ~ visValue(vTrue) )
       => ( vreduce(vTrue) != vnoTerm ) ),
    inference(negated_conjecture,[status(cth)],[f105]) ).

tff(f109,plain,
    ? [X0: vTy] :
      ( ( vnoTerm = vreduce(vTrue) )
      & vptchecksimple(vTrue,X0)
      & ~ visValue(vTrue) ),
    inference(ennf_transformation,[],[f106]) ).

tff(f110,plain,
    ? [X0: vTy] :
      ( ( vnoTerm = vreduce(vTrue) )
      & vptchecksimple(vTrue,X0)
      & ~ visValue(vTrue) ),
    inference(flattening,[],[f109]) ).

tff(f153,plain,
    ( ( vnoTerm = vreduce(vTrue) )
    & vptchecksimple(vTrue,sK1)
    & ~ visValue(vTrue) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f110]) ).

tff(f171,plain,
    ~ visValue(vTrue),
    inference(cnf_transformation,[],[f153]) ).

tff(f185,plain,
    visValue(vTrue),
    inference(cnf_transformation,[],[f46]) ).

tff(f264,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f185,f171]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM243_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n026.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 22:05:42 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running first-order theorem proving
% 0.08/0.24  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
% 2.57/1.16  % (132898)Detected formulas, will run a generic FOF schedule.
% 2.57/1.16  % (132907)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=122189193:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.57/1.16  % (132907)First to succeed.
% 2.57/1.16  % (132907)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-132898"
% 2.57/1.16  % (132903)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=978906:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.57/1.16  % (132904)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=3590087837:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.57/1.16  % (132908)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2819014460:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.57/1.16  % (132906)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1487957048:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.57/1.16  % (132905)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=1353536699:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.57/1.16  % (132908)Also succeeded, but the first one will report.
% 2.57/1.16  % (132906)Also succeeded, but the first one will report.
% 2.57/1.16  % (132909)dis-21_1_sil=8000:lcm=predicate:random_seed=2281283373: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.57/1.16  % (132909)Also succeeded, but the first one will report.
% 2.57/1.16  % (132907)Refutation found. Thanks to Tanya!
% 2.57/1.16  % SZS status Theorem for theBenchmark
% 2.57/1.16  % SZS output start Proof for theBenchmark
% See solution above
% 2.57/1.16  % (132907)------------------------------
% 2.57/1.16  % (132907)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.16  % (132907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.16  % (132907)CaDiCaL version: 2.1.3
% 2.57/1.16  % (132907)Termination reason: Refutation
% 2.57/1.16  % (132907)Time elapsed: 0.002 s
% 2.57/1.16  % (132907)Peak memory usage: 88 MB
% 2.57/1.16  % (132907)Instructions burned: 3 (million)
% 2.57/1.16  % (132907)------------------------------
% 2.57/1.16  % (132907)------------------------------
% 2.57/1.16  % (132898)Success in time 0.282 s
% 2.57/1.16  % Vampire exiting
%------------------------------------------------------------------------------