↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWV779_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 : n015.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:19:29 PM UTC 2026

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

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

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

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

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

tff(type_def_9,type,
    msg: $tType ).

tff(type_def_10,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)) > fun(X1,fun(X0,X2)) ) ).

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

tff(func_def_3,type,
    gets: ( agent * msg ) > event ).

tff(func_def_4,type,
    initState: agent > fun(msg,bool) ).

tff(func_def_5,type,
    knows: ( agent * list(event) ) > fun(msg,bool) ).

tff(func_def_6,type,
    append: 
      !>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).

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

tff(func_def_8,type,
    insert1: 
      !>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).

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

tff(func_def_10,type,
    nil: 
      !>[X0: $tType] : list(X0) ).

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

tff(func_def_12,type,
    rev: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

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

tff(func_def_14,type,
    spy: agent ).

tff(func_def_15,type,
    nS_Sha254967238shared: fun(list(event),bool) ).

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

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

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

tff(func_def_19,type,
    fFalse: bool ).

tff(func_def_20,type,
    fNot: fun(bool,bool) ).

tff(func_def_21,type,
    fTrue: bool ).

tff(func_def_22,type,
    fdisj: fun(bool,fun(bool,bool)) ).

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

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

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

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

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

tff(pred_def_3,type,
    nS_Sha993195050haredp: list(event) > $o ).

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

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

tff(pred_def_6,type,
    sP0: fun(msg,bool) > $o ).

tff(f3,axiom,
    ! [X0: $tType,X1: list(X0)] :
      ( ( rev(X0,X1) = nil(X0) )
    <=> ( X1 = nil(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_rev__is__Nil__conv) ).

tff(f116,conjecture,
    knows(spy,nil(event)) = knows(spy,rev(event,nil(event))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f117,negated_conjecture,
    ( ( ~ knows(spy,nil(event)) ) = knows(spy,rev(event,nil(event))) ),
    inference(negated_conjecture,[status(cth)],[f116]) ).

tff(f118,plain,
    knows(spy,nil(event)) != knows(spy,rev(event,nil(event))),
    inference(flattening,[],[f117]) ).

tff(f127,plain,
    ! [X0: $tType,X1: list(X0)] :
      ( ( ( rev(X0,X1) = nil(X0) )
        | ( nil(X0) != X1 ) )
      & ( ( X1 = nil(X0) )
        | ( nil(X0) != rev(X0,X1) ) ) ),
    inference(nnf_transformation,[],[f3]) ).

tff(f129,plain,
    knows(spy,nil(event)) != knows(spy,rev(event,nil(event))),
    inference(cnf_transformation,[],[f118]) ).

tff(f144,plain,
    ! [X0: $tType,X1: list(X0)] :
      ( ( nil(X0) = rev(X0,X1) )
      | ( nil(X0) != X1 ) ),
    inference(cnf_transformation,[],[f127]) ).

tff(f151,definition,
    ~ sP0(knows(spy,nil(event))),
    introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).

tff(f152,plain,
    sP0(knows(spy,rev(event,nil(event)))),
    inference(inequality_splitting,[],[f129,f151]) ).

tff(f159,plain,
    ! [X0: $tType] : ( nil(X0) = rev(X0,nil(X0)) ),
    inference(equality_resolution,[],[f144]) ).

tff(f161,plain,
    sP0(knows(spy,nil(event))),
    inference(forward_demodulation,[],[f152,f159]) ).

tff(f162,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f161,f151]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV779_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n015.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 12:35:02 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  Running first-order theorem proving
% 0.09/0.23  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.47/1.05  % (2599409)Detected formulas, will run a generic FOF schedule.
% 3.47/1.05  % (2599448)dis-21_1_sil=8000:lcm=predicate:random_seed=2455784453: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.47/1.05  % (2599448)Instruction limit reached! 
% 3.47/1.05  % (2599448)------------------------------
% 3.47/1.05  % (2599448)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.05  % (2599448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.05  % (2599448)CaDiCaL version: 2.1.3
% 3.47/1.05  % (2599448)Termination reason: Instruction limit
% 3.47/1.05  % (2599448)Termination phase: Saturation
% 3.47/1.05  % (2599448)Time elapsed: 0.034 s
% 3.47/1.05  % (2599448)Peak memory usage: 88 MB
% 3.47/1.05  % (2599448)Instructions burned: 131 (million)
% 3.47/1.05  % (2599445)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1261942224:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.47/1.05  % (2599442)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=1485106883:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.47/1.05  % (2599447)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1862074111:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.47/1.05  % (2599441)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=4026878326:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.47/1.05  % (2599446)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=130903446:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.47/1.05  % (2599444)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=894586253:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.47/1.05  % (2599445)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.47/1.05  % (2599445)First to succeed.
% 3.47/1.05  % (2599445)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2599409"
% 3.47/1.05  % (2599446)Also succeeded, but the first one will report.
% 3.47/1.05  % (2599444)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.47/1.05  % (2599447)Also succeeded, but the first one will report.
% 3.47/1.05  % (2599484)lrs+10_1_sil=8000:sp=occurrence:random_seed=3600003766:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.47/1.05  % (2599484)Also succeeded, but the first one will report.
% 3.47/1.05  % (2599445)Refutation found. Thanks to Tanya!
% 3.47/1.05  % SZS status Theorem for theBenchmark
% 3.47/1.05  % SZS output start Proof for theBenchmark
% See solution above
% 3.47/1.05  % (2599445)------------------------------
% 3.47/1.05  % (2599445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.05  % (2599445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.05  % (2599445)CaDiCaL version: 2.1.3
% 3.47/1.05  % (2599445)Termination reason: Refutation
% 3.47/1.05  % (2599445)Time elapsed: 0.003 s
% 3.47/1.05  % (2599445)Peak memory usage: 89 MB
% 3.47/1.05  % (2599445)Instructions burned: 3 (million)
% 3.47/1.05  % (2599445)------------------------------
% 3.47/1.05  % (2599445)------------------------------
% 3.47/1.05  % (2599409)Success in time 0.422 s
% 3.47/1.05  % Vampire exiting
%------------------------------------------------------------------------------