TPTP Problem File: SWV244-2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SWV244-2 : TPTP v9.0.0. Released v3.2.0.
% Domain : Software Verification (Security)
% Problem : Cryptographic protocol problem for messages
% Version : [Pau06] axioms : Reduced > Especial.
% English :
% Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% Source : [Pau06]
% Names :
% Status : Unsatisfiable
% Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0
% Syntax : Number of clauses : 6 ( 2 unt; 1 nHn; 4 RR)
% Number of literals : 11 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 14 ( 2 sgn)
% SPC : CNF_UNS_RFO_NEQ_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_0,negated_conjecture,
c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) ).
cnf(cls_Message_Oanalz_OInj_0,axiom,
( ~ c_in(V_X,V_H,tc_Message_Omsg)
| c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ).
cnf(cls_Set_OUnCI_0,axiom,
( ~ c_in(V_c,V_B,T_a)
| c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ).
cnf(cls_Set_OUnCI_1,axiom,
( ~ c_in(V_c,V_A,T_a)
| c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ).
cnf(cls_Set_OUnE_0,axiom,
( ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a)
| c_in(V_c,V_B,T_a)
| c_in(V_c,V_A,T_a) ) ).
%------------------------------------------------------------------------------