%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV331-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 : n026.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:46 EDT 2024 % Result : Unsatisfiable 0.52s 0.59s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.10 % Problem : SWV331-2 : TPTP v8.2.0. Released v3.2.0. % 0.03/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.10/0.30 % Computer : n026.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 300 % 0.10/0.30 % DateTime : Thu Jun 20 18:25:53 EDT 2024 % 0.10/0.30 % CPUTime : % 0.16/0.56 start to proof:theBenchmark % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % File :CSE---1.7 % 0.52/0.59 % Problem :theBenchmark % 0.52/0.59 % Transform :cnf % 0.52/0.59 % Format :tptp:raw % 0.52/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.59 % 0.52/0.59 % Result :Theorem 0.000000s % 0.52/0.59 % Output :CNFRefutation 0.000000s % 0.52/0.59 %------------------------------------------- % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 % File : SWV331-2 : TPTP v8.2.0. Released v3.2.0. % 0.52/0.59 % Domain : Software Verification (Security) % 0.52/0.59 % Problem : Cryptographic protocol problem for Yahalom % 0.52/0.59 % Version : [Pau06] axioms : Reduced > Especial. % 0.52/0.59 % English : % 0.52/0.59 % 0.52/0.59 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.52/0.59 % Source : [Pau06] % 0.52/0.59 % Names : % 0.52/0.59 % 0.52/0.59 % Status : Unsatisfiable % 0.52/0.59 % Rating : 0.00 v5.3.0, 0.05 v5.2.0, 0.00 v3.2.0 % 0.52/0.59 % Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 6 RR) % 0.52/0.59 % Number of literals : 11 ( 0 equ; 6 neg) % 0.52/0.59 % Maximal clause size : 4 ( 1 avg) % 0.52/0.59 % Maximal term depth : 4 ( 1 avg) % 0.52/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.52/0.59 % Number of functors : 17 ( 17 usr; 9 con; 0-2 aty) % 0.52/0.59 % Number of variables : 5 ( 1 sgn) % 0.52/0.59 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.52/0.59 % 0.52/0.59 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.52/0.59 % of which only a small selection are required for the refutation. % 0.52/0.59 % The mission is to find those few axioms, after which a refutation % 0.52/0.59 % can be quite easily found. This version has only the necessary % 0.52/0.59 % axioms. % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 cnf(cls_conjecture_0,negated_conjecture, % 0.52/0.59 c_in(v_evs3,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_conjecture_1,negated_conjecture, % 0.52/0.59 ~ c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_conjecture_2,negated_conjecture, % 0.52/0.59 c_in(v_K,c_Message_OsymKeys,tc_nat) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_conjecture_5,negated_conjecture, % 0.52/0.59 c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_Public_OCrypt__imp__keysFor_0,axiom, % 0.52/0.59 ( ~ c_in(V_K,c_Message_OsymKeys,tc_nat) % 0.52/0.59 | ~ c_in(c_Message_Omsg_OCrypt(V_K,V_X),V_H,tc_Message_Omsg) % 0.52/0.59 | c_in(V_K,c_Message_OkeysFor(V_H),tc_nat) ) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_Yahalom_Onew__keys__not__used_0,axiom, % 0.52/0.59 ( ~ c_in(V_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,V_evs))),tc_nat) % 0.52/0.59 | ~ c_in(V_K,c_Message_OsymKeys,tc_nat) % 0.52/0.59 | ~ c_in(V_evs,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)) % 0.52/0.59 | c_in(c_Message_Omsg_OKey(V_K),c_Event_Oused(V_evs),tc_Message_Omsg) ) ). % 0.52/0.59 % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % Proof found % 0.52/0.59 % SZS status Theorem for theBenchmark % 0.52/0.59 % SZS output start Proof % 0.52/0.59 %ClaNum:6(EqnAxiom:0) % 0.52/0.59 %VarNum:12(SingletonVarNum:5) % 0.52/0.59 %MaxLitNum:4 % 0.52/0.59 %MaxfuncDepth:3 % 0.52/0.59 %SharedTerms:20 % 0.52/0.59 %goalClause: 1 2 3 4 % 0.52/0.59 %singleGoalClaCount:4 % 0.52/0.59 [1]P1(a1,a2,a11) % 0.52/0.59 [2]P1(a16,a12,f14(a13)) % 0.52/0.59 [4]~P1(f9(a1),f7(a16),a15) % 0.52/0.59 [3]P1(f4(a1,f3(a17)),f10(f6(a5,a16)),a15) % 0.52/0.59 [5]~P1(x51,a2,a11)+P1(x51,f8(x52),a11)+~P1(f4(x51,x53),x52,a15) % 0.52/0.59 [6]~P1(x61,a2,a11)+P1(f9(x61),f7(x62),a15)+~P1(x62,a12,f14(a13))+~P1(x61,f8(f10(f6(a5,x62))),a11) % 0.52/0.59 %EqnAxiom % 0.52/0.59 % 0.52/0.59 %------------------------------------------- % 0.52/0.59 cnf(9,plain, % 0.52/0.59 ($false), % 0.52/0.59 inference(scs_inference,[],[1,2,4,3,5,6]), % 0.52/0.59 ['proof']). % 0.52/0.59 % SZS output end Proof % 0.52/0.59 % Total time :0.000000s %------------------------------------------------------------------------------