TPTP Problem File: SWV319-2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SWV319-2 : TPTP v9.0.0. Released v3.2.0.
% Domain : Software Verification (Security)
% Problem : Cryptographic protocol problem for Otway Rees
% Version : [Pau06] axioms : Reduced > Especial.
% English :
% Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% Source : [Pau06]
% Names :
% Status : Unsatisfiable
% Rating : 0.05 v9.0.0, 0.10 v8.1.0, 0.00 v7.5.0, 0.05 v7.4.0, 0.06 v7.3.0, 0.08 v7.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.3.0, 0.09 v6.2.0, 0.10 v6.1.0, 0.14 v6.0.0, 0.10 v5.5.0, 0.15 v5.4.0, 0.20 v5.3.0, 0.22 v5.2.0, 0.12 v5.0.0, 0.14 v4.1.0, 0.08 v4.0.1, 0.00 v4.0.0, 0.09 v3.7.0, 0.00 v3.5.0, 0.09 v3.4.0, 0.25 v3.3.0, 0.29 v3.2.0
% Syntax : Number of clauses : 9 ( 2 unt; 1 nHn; 9 RR)
% Number of literals : 16 ( 1 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 0 prp; 2-3 aty)
% Number of functors : 23 ( 23 usr; 13 con; 0-3 aty)
% Number of variables : 15 ( 5 sgn)
% SPC : CNF_UNS_RFO_SEQ_NHN
% Comments : The problems in the [Pau06] collection each have very many axioms,
% of which only a small selection are required for the refutation.
% The mission is to find those few axioms, after which a refutation
% can be quite easily found. This version has only the necessary
% axioms.
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_B,c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NA),c_Message_Omsg_OMPair(v_X,c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NB),c_Message_Omsg_OKey(v_K)))))),c_List_Oset(v_evso,tc_Event_Oevent),tc_Event_Oevent) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_A,c_Event_Obad,tc_Message_Oagent) ).
cnf(cls_conjecture_3,negated_conjecture,
( c_in(v_A,c_Event_Obad,tc_Message_Oagent)
| ~ c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evso)),tc_Message_Omsg) ) ).
cnf(cls_conjecture_6,negated_conjecture,
( c_Public_OshrK(v_A) = v_K
| c_in(v_A,c_Event_Obad,tc_Message_Oagent) ) ).
cnf(cls_Event_OSays__imp__analz__Spy__dest_0,axiom,
( ~ c_in(c_Event_Oevent_OSays(V_A,V_B,V_X),c_List_Oset(V_evs,tc_Event_Oevent),tc_Event_Oevent)
| c_in(V_X,c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,V_evs)),tc_Message_Omsg) ) ).
cnf(cls_Message_OMPair__analz_0,axiom,
( ~ c_in(c_Message_Omsg_OMPair(V_X,V_Y),c_Message_Oanalz(V_H),tc_Message_Omsg)
| c_in(V_Y,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ).
cnf(cls_Message_OMPair__parts_0,axiom,
( ~ c_in(c_Message_Omsg_OMPair(V_X,V_Y),c_Message_Oparts(V_H),tc_Message_Omsg)
| c_in(V_Y,c_Message_Oparts(V_H),tc_Message_Omsg) ) ).
cnf(cls_Message_Oanalz__conj__parts_0,axiom,
( ~ c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg)
| c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg) ) ).
cnf(cls_Message_Oparts_OBody__dest_0,axiom,
( ~ c_in(c_Message_Omsg_OCrypt(V_K,V_X),c_Message_Oparts(V_H),tc_Message_Omsg)
| c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg) ) ).
%------------------------------------------------------------------------------