TPTP Problem File: SWV243-1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SWV243-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__analz_synth [Pau06]
% Status : Unsatisfiable
% Rating : 0.40 v9.0.0, 0.45 v8.2.0, 0.38 v8.1.0, 0.42 v7.5.0, 0.63 v7.4.0, 0.59 v7.3.0, 0.67 v7.1.0, 0.58 v7.0.0, 0.67 v6.3.0, 0.64 v6.2.0, 0.70 v6.1.0, 0.71 v6.0.0, 0.60 v5.5.0, 0.75 v5.4.0, 0.80 v5.3.0, 0.83 v5.2.0, 0.75 v5.1.0, 0.76 v5.0.0, 0.79 v4.1.0, 0.85 v4.0.1, 0.73 v3.7.0, 0.70 v3.5.0, 0.73 v3.4.0, 0.75 v3.3.0, 0.71 v3.2.0
% Syntax : Number of clauses : 2826 ( 697 unt; 257 nHn;2014 RR)
% Number of literals : 6143 (1353 equ;3126 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 8 ( 1 avg)
% Number of predicates : 87 ( 86 usr; 0 prp; 1-3 aty)
% Number of functors : 250 ( 250 usr; 49 con; 0-18 aty)
% Number of variables : 5865 (1188 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-1.ax').
include('Axioms/SWV005-0.ax').
include('Axioms/SWV005-1.ax').
%------------------------------------------------------------------------------
cnf(cls_Message_Oanalz__analz__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Oanalz(V_G),V_H,tc_Message_Omsg)) = c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)) ).
cnf(cls_Message_Oanalz__synth__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(V_G),V_H,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Osynth(V_G),tc_Message_Omsg) ).
cnf(cls_Message_Oparts__synth_0,axiom,
c_Message_Oparts(c_Message_Osynth(V_H)) = c_union(c_Message_Oparts(V_H),c_Message_Osynth(V_H),tc_Message_Omsg) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Message_Oanalz(c_Message_Osynth(v_H)) != c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg) ).
%------------------------------------------------------------------------------