TSTP Solution File: SWV779_5 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWV779_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 11:11:05 EDT 2024

% Result   : Theorem 0.15s 0.41s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   66
% Syntax   : Number of formulae    :   73 (   9 unt;  64 typ;   0 def)
%            Number of atoms       :    9 (   8 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   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  :   93 (  49   >;  44   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-5 aty)
%            Number of functors    :   50 (  50 usr;   7 con; 0-5 aty)
%            Number of variables   :   65 (   3   !;   0   ?;  65   :)
%                                         (  62  !>;   0  ?*;   0  @-;   0  @+)

% 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(func_def_26,type,
    sK5: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_27,type,
    sK6: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_28,type,
    sK7: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_29,type,
    sK8: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_30,type,
    sK9: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_31,type,
    sK10: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_32,type,
    sK11: 
      !>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).

tff(func_def_33,type,
    sK12: 
      !>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).

tff(func_def_34,type,
    sK13: 
      !>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).

tff(func_def_35,type,
    sK14: 
      !>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).

tff(func_def_36,type,
    sK15: 
      !>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).

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

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

tff(func_def_39,type,
    sK18: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_40,type,
    sK19: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_41,type,
    sK20: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).

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

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

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

tff(func_def_45,type,
    sK24: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_46,type,
    sK25: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_47,type,
    sK26: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).

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: 
      !>[X0: $tType] : ( ( list(X0) * fun(X0,bool) * X0 ) > $o ) ).

tff(pred_def_7,type,
    sP1: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) * X0 * fun(X0,bool) ) > $o ) ).

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

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

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

tff(f627,plain,
    $false,
    inference(trivial_inequality_removal,[],[f626]) ).

tff(f626,plain,
    knows(spy,nil(event)) != knows(spy,nil(event)),
    inference(forward_demodulation,[],[f368,f373]) ).

tff(f373,plain,
    ! [X0: $tType] : ( nil(X0) = rev(X0,nil(X0)) ),
    inference(cnf_transformation,[],[f119]) ).

tff(f119,plain,
    ! [X0: $tType] : ( nil(X0) = rev(X0,nil(X0)) ),
    inference(rectify,[],[f1]) ).

tff(f1,axiom,
    ! [X2: $tType] : ( nil(X2) = rev(X2,nil(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_rev_Osimps_I1_J) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWV779_5 : TPTP v8.1.2. Released v6.0.0.
% 0.13/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n018.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 21:08:38 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (32304)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39  % (32307)WARNING: value z3 for option sas not known
% 0.15/0.39  % (32305)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39  % (32306)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39  % (32308)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39  % (32307)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.39  % (32310)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.39  % (32309)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.39  % (32311)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.40  % (32311)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.40  % Exception at run slice level
% 0.15/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.40  % Exception at run slice level
% 0.15/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.40  % Exception at run slice level
% 0.15/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.40  % (32307)First to succeed.
% 0.15/0.41  % (32307)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-32304"
% 0.15/0.41  % (32307)Refutation found. Thanks to Tanya!
% 0.15/0.41  % SZS status Theorem for theBenchmark
% 0.15/0.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.41  % (32307)------------------------------
% 0.15/0.41  % (32307)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.41  % (32307)Termination reason: Refutation
% 0.15/0.41  
% 0.15/0.41  % (32307)Memory used [KB]: 1167
% 0.15/0.41  % (32307)Time elapsed: 0.017 s
% 0.15/0.41  % (32307)Instructions burned: 28 (million)
% 0.15/0.41  % (32304)Success in time 0.04 s
%------------------------------------------------------------------------------