%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV346-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n027.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 : Mon Jun 24 16:46:52 EDT 2024 % Result : Unsatisfiable 0.50s 0.60s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV346-2 : TPTP v8.2.0. Released v3.2.0. % 0.06/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n027.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Thu Jun 20 15:32:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.50/0.57 start to proof:theBenchmark % 0.50/0.59 %------------------------------------------- % 0.50/0.59 % File :CSE---1.7 % 0.50/0.59 % Problem :theBenchmark % 0.50/0.59 % Transform :cnf % 0.50/0.59 % Format :tptp:raw % 0.50/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.59 % 0.50/0.59 % Result :Theorem 0.000000s % 0.50/0.59 % Output :CNFRefutation 0.000000s % 0.50/0.59 %------------------------------------------- % 0.50/0.60 %------------------------------------------------------------------------------ % 0.50/0.60 % File : SWV346-2 : TPTP v8.2.0. Released v3.2.0. % 0.50/0.60 % Domain : Software Verification (Security) % 0.50/0.60 % Problem : Cryptographic protocol problem for Yahalom % 0.50/0.60 % Version : [Pau06] axioms : Reduced > Especial. % 0.50/0.60 % English : % 0.50/0.60 % 0.50/0.60 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.50/0.60 % Source : [Pau06] % 0.50/0.60 % Names : % 0.50/0.60 % 0.50/0.60 % Status : Unsatisfiable % 0.50/0.60 % Rating : 0.00 v7.0.0, 0.14 v6.3.0, 0.00 v5.3.0, 0.08 v5.2.0, 0.00 v4.1.0, 0.11 v4.0.1, 0.17 v3.3.0, 0.14 v3.2.0 % 0.50/0.60 % Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR) % 0.50/0.60 % Number of literals : 8 ( 2 equ; 4 neg) % 0.50/0.60 % Maximal clause size : 4 ( 1 avg) % 0.50/0.60 % Maximal term depth : 8 ( 2 avg) % 0.50/0.60 % Number of predicates : 2 ( 1 usr; 0 prp; 2-3 aty) % 0.50/0.60 % Number of functors : 23 ( 23 usr; 14 con; 0-3 aty) % 0.50/0.60 % Number of variables : 12 ( 6 sgn) % 0.50/0.60 % SPC : CNF_UNS_RFO_SEQ_HRN % 0.50/0.60 % 0.50/0.60 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.50/0.60 % of which only a small selection are required for the refutation. % 0.50/0.60 % The mission is to find those few axioms, after which a refutation % 0.50/0.60 % can be quite easily found. This version has only the necessary % 0.50/0.60 % axioms. % 0.50/0.60 %------------------------------------------------------------------------------ % 0.50/0.60 cnf(cls_Yahalom_Ounique__session__keys__dest_2,axiom, % 0.50/0.60 ( ~ c_in(V_evs,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)) % 0.50/0.60 | ~ c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,V_A_H,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(V_A_H),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(V_B_H),c_Message_Omsg_OMPair(c_Message_Omsg_OKey(V_K),c_Message_Omsg_OMPair(V_na_H,V_nb_H)))),V_X_H)),c_List_Oset(V_evs,tc_Event_Oevent),tc_Event_Oevent) % 0.50/0.60 | ~ c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,V_A,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(V_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(V_B),c_Message_Omsg_OMPair(c_Message_Omsg_OKey(V_K),c_Message_Omsg_OMPair(V_na,V_nb)))),V_X)),c_List_Oset(V_evs,tc_Event_Oevent),tc_Event_Oevent) % 0.50/0.60 | V_na = V_na_H ) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_conjecture_2,negated_conjecture, % 0.50/0.60 c_in(v_evso,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_conjecture_3,negated_conjecture, % 0.50/0.60 c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_Aa,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_Aa),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Ba),c_Message_Omsg_OMPair(c_Message_Omsg_OKey(v_K),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NA),c_Message_Omsg_ONonce(v_NB))))),v_X)),c_List_Oset(v_evso,tc_Event_Oevent),tc_Event_Oevent) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_conjecture_4,negated_conjecture, % 0.50/0.60 c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_A,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OKey(v_K),c_Message_Omsg_OMPair(v_na,v_nb)))),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OKey(v_K))))),c_List_Oset(v_evso,tc_Event_Oevent),tc_Event_Oevent) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_conjecture_7,negated_conjecture, % 0.50/0.60 v_na != c_Message_Omsg_ONonce(v_NA) ). % 0.50/0.60 % 0.50/0.60 %------------------------------------------------------------------------------ % 0.50/0.60 %------------------------------------------- % 0.50/0.60 % Proof found % 0.50/0.60 % SZS status Theorem for theBenchmark % 0.50/0.60 % SZS output start Proof % 0.50/0.60 %ClaNum:25(EqnAxiom:20) % 0.50/0.60 %VarNum:19(SingletonVarNum:12) % 0.50/0.60 %MaxLitNum:4 % 0.50/0.60 %MaxfuncDepth:7 % 0.50/0.60 %SharedTerms:43 % 0.50/0.60 %goalClause: 21 22 23 24 % 0.50/0.60 %singleGoalClaCount:4 % 0.50/0.60 [21]P1(a1,a2,f13(a12)) % 0.50/0.60 [24]~E(f11(a19),a22) % 0.50/0.60 [22]P1(f4(a3,a14,f10(f9(f6(a14),f10(f7(a15),f10(f8(a17),f10(a22,a23)))),f9(f6(a15),f10(f7(a14),f8(a17))))),f5(a1,a12),a12) % 0.50/0.60 [23]P1(f4(a3,a16,f10(f9(f6(a16),f10(f7(a18),f10(f8(a17),f10(f11(a19),f11(a20))))),a21)),f5(a1,a12),a12) % 0.50/0.60 [25]E(x251,x252)+~P1(x253,a2,f13(a12))+~P1(f4(a3,x259,f10(f9(f6(x259),f10(f7(x2510),f10(f8(x256),f10(x251,x2511)))),x2512)),f5(x253,a12),a12)+~P1(f4(a3,x254,f10(f9(f6(x254),f10(f7(x255),f10(f8(x256),f10(x252,x257)))),x258)),f5(x253,a12),a12) % 0.50/0.60 %EqnAxiom % 0.50/0.60 [1]E(x11,x11) % 0.50/0.60 [2]E(x22,x21)+~E(x21,x22) % 0.50/0.60 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.50/0.60 [4]~E(x41,x42)+E(f13(x41),f13(x42)) % 0.50/0.60 [5]~E(x51,x52)+E(f6(x51),f6(x52)) % 0.50/0.60 [6]~E(x61,x62)+E(f7(x61),f7(x62)) % 0.50/0.60 [7]~E(x71,x72)+E(f8(x71),f8(x72)) % 0.50/0.60 [8]~E(x81,x82)+E(f10(x81,x83),f10(x82,x83)) % 0.50/0.60 [9]~E(x91,x92)+E(f10(x93,x91),f10(x93,x92)) % 0.50/0.60 [10]~E(x101,x102)+E(f9(x101,x103),f9(x102,x103)) % 0.50/0.60 [11]~E(x111,x112)+E(f9(x113,x111),f9(x113,x112)) % 0.50/0.60 [12]~E(x121,x122)+E(f4(x121,x123,x124),f4(x122,x123,x124)) % 0.50/0.60 [13]~E(x131,x132)+E(f4(x133,x131,x134),f4(x133,x132,x134)) % 0.50/0.60 [14]~E(x141,x142)+E(f4(x143,x144,x141),f4(x143,x144,x142)) % 0.50/0.60 [15]~E(x151,x152)+E(f11(x151),f11(x152)) % 0.50/0.60 [16]~E(x161,x162)+E(f5(x161,x163),f5(x162,x163)) % 0.50/0.60 [17]~E(x171,x172)+E(f5(x173,x171),f5(x173,x172)) % 0.50/0.60 [18]P1(x182,x183,x184)+~E(x181,x182)+~P1(x181,x183,x184) % 0.50/0.60 [19]P1(x193,x192,x194)+~E(x191,x192)+~P1(x193,x191,x194) % 0.50/0.60 [20]P1(x203,x204,x202)+~E(x201,x202)+~P1(x203,x204,x201) % 0.50/0.60 % 0.50/0.60 %------------------------------------------- % 0.50/0.60 cnf(26,plain, % 0.50/0.60 ($false), % 0.50/0.60 inference(scs_inference,[],[24,21,23,22,25]), % 0.50/0.60 ['proof']). % 0.50/0.60 % SZS output end Proof % 0.50/0.60 % Total time :0.000000s %------------------------------------------------------------------------------