TPTP Problem File: SWV274-1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SWV274-1 : TPTP v9.0.0. Released v3.2.0.
% Domain : Software Verification (Security)
% Problem : Cryptographic protocol problem for messages
% Version : [Pau06] axioms : Especial.
% English :
% Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% Source : [Pau06]
% Names : Message__synth_cut [Pau06]
% Status : Unsatisfiable
% Rating : 0.65 v9.0.0, 0.60 v8.2.0, 0.57 v8.1.0, 0.53 v7.4.0, 0.47 v7.3.0, 0.50 v7.0.0, 0.60 v6.3.0, 0.55 v6.2.0, 0.60 v6.1.0, 0.71 v6.0.0, 0.80 v5.5.0, 0.90 v5.3.0, 0.89 v5.2.0, 0.81 v5.1.0, 0.82 v5.0.0, 0.93 v4.1.0, 0.92 v4.0.1, 0.91 v3.7.0, 0.90 v3.5.0, 0.91 v3.4.0, 0.92 v3.3.0, 1.00 v3.2.0
% Syntax : Number of clauses : 1403 ( 228 unt; 34 nHn;1315 RR)
% Number of literals : 2650 ( 219 equ;1261 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 82 ( 81 usr; 0 prp; 1-3 aty)
% Number of functors : 138 ( 138 usr; 23 con; 0-6 aty)
% Number of variables : 2007 ( 232 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.
%------------------------------------------------------------------------------
include('Axioms/MSC001-0.ax').
include('Axioms/MSC001-2.ax').
include('Axioms/SWV004-0.ax').
%------------------------------------------------------------------------------
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) ) ).
cnf(cls_Message_Osynth__synthD__dest_0,axiom,
( ~ c_in(V_X,c_Message_Osynth(c_Message_Osynth(V_H)),tc_Message_Omsg)
| c_in(V_X,c_Message_Osynth(V_H),tc_Message_Omsg) ) ).
cnf(cls_Message_Osynth__trans_0,axiom,
( ~ c_in(V_X,c_Message_Osynth(V_G),tc_Message_Omsg)
| ~ c_lessequals(V_G,c_Message_Osynth(V_H),tc_set(tc_Message_Omsg))
| c_in(V_X,c_Message_Osynth(V_H),tc_Message_Omsg) ) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg) ).
%------------------------------------------------------------------------------