%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV335-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n032.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:47 EDT 2024 % Result : Unsatisfiable 0.11s 0.48s % Output : CNFRefutation 0.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.07 % Problem : SWV335-2 : TPTP v8.2.0. Released v3.2.0. % 0.00/0.07 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.07/0.26 % Computer : n032.cluster.edu % 0.07/0.26 % Model : x86_64 x86_64 % 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.26 % Memory : 8042.1875MB % 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.26 % CPULimit : 300 % 0.07/0.26 % WCLimit : 300 % 0.07/0.26 % DateTime : Thu Jun 20 18:41:08 EDT 2024 % 0.07/0.26 % CPUTime : % 0.11/0.43 start to proof:theBenchmark % 0.11/0.48 %------------------------------------------- % 0.11/0.48 % File :CSE---1.7 % 0.11/0.48 % Problem :theBenchmark % 0.11/0.48 % Transform :cnf % 0.11/0.48 % Format :tptp:raw % 0.11/0.48 % Command :java -jar mcs_scs.jar %d %s % 0.11/0.48 % 0.11/0.48 % Result :Theorem 0.020000s % 0.11/0.48 % Output :CNFRefutation 0.020000s % 0.11/0.48 %------------------------------------------- % 0.11/0.48 %------------------------------------------------------------------------------ % 0.11/0.48 % File : SWV335-2 : TPTP v8.2.0. Released v3.2.0. % 0.11/0.48 % Domain : Software Verification (Security) % 0.11/0.48 % Problem : Cryptographic protocol problem for Yahalom % 0.11/0.48 % Version : [Pau06] axioms : Reduced > Especial. % 0.11/0.48 % English : % 0.11/0.48 % 0.11/0.48 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.11/0.48 % Source : [Pau06] % 0.11/0.48 % Names : % 0.11/0.48 % 0.11/0.48 % Status : Unsatisfiable % 0.11/0.48 % Rating : 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 0.11/0.48 % Syntax : Number of clauses : 9 ( 4 unt; 2 nHn; 9 RR) % 0.11/0.48 % Number of literals : 17 ( 0 equ; 8 neg) % 0.11/0.48 % Maximal clause size : 3 ( 1 avg) % 0.11/0.48 % Maximal term depth : 4 ( 1 avg) % 0.11/0.48 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.11/0.48 % Number of functors : 14 ( 14 usr; 6 con; 0-3 aty) % 0.11/0.48 % Number of variables : 14 ( 0 sgn) % 0.11/0.48 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.11/0.48 % 0.11/0.48 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.11/0.48 % of which only a small selection are required for the refutation. % 0.11/0.48 % The mission is to find those few axioms, after which a refutation % 0.11/0.48 % can be quite easily found. This version has only the necessary % 0.11/0.48 % axioms. % 0.11/0.48 %------------------------------------------------------------------------------ % 0.11/0.48 cnf(cls_conjecture_1,negated_conjecture, % 0.11/0.48 c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_conjecture_2,negated_conjecture, % 0.11/0.48 ~ c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_conjecture_3,negated_conjecture, % 0.11/0.48 c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg)),tc_Message_Omsg) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_conjecture_4,negated_conjecture, % 0.11/0.48 ~ 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_evsf)),tc_Message_Omsg) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_Message_OCrypt__synth_1,axiom, % 0.11/0.48 ( ~ c_in(c_Message_Omsg_OCrypt(V_K,V_X),c_Message_Osynth(V_H),tc_Message_Omsg) % 0.11/0.48 | c_in(V_X,c_Message_Osynth(V_H),tc_Message_Omsg) % 0.11/0.48 | c_in(c_Message_Omsg_OCrypt(V_K,V_X),V_H,tc_Message_Omsg) ) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_Message_OFake__parts__insert__in__Un__dest_0,axiom, % 0.11/0.48 ( ~ c_in(V_Z,c_Message_Oparts(c_insert(V_X,V_H,tc_Message_Omsg)),tc_Message_Omsg) % 0.11/0.48 | ~ c_in(V_X,c_Message_Osynth(c_Message_Oanalz(V_H)),tc_Message_Omsg) % 0.11/0.48 | c_in(V_Z,c_union(c_Message_Osynth(c_Message_Oanalz(V_H)),c_Message_Oparts(V_H),tc_Message_Omsg),tc_Message_Omsg) ) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_Message_ONonce__synth_0,axiom, % 0.11/0.48 ( ~ c_in(c_Message_Omsg_ONonce(V_n),c_Message_Osynth(V_H),tc_Message_Omsg) % 0.11/0.48 | c_in(c_Message_Omsg_ONonce(V_n),V_H,tc_Message_Omsg) ) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_Message_Oanalz__into__parts__dest_0,axiom, % 0.11/0.48 ( ~ c_in(V_c,c_Message_Oanalz(V_H),tc_Message_Omsg) % 0.11/0.48 | c_in(V_c,c_Message_Oparts(V_H),tc_Message_Omsg) ) ). % 0.11/0.48 % 0.11/0.48 cnf(cls_Set_OUnE_0,axiom, % 0.11/0.48 ( ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a) % 0.11/0.48 | c_in(V_c,V_B,T_a) % 0.11/0.48 | c_in(V_c,V_A,T_a) ) ). % 0.11/0.48 % 0.11/0.48 %------------------------------------------------------------------------------ % 0.11/0.48 %------------------------------------------- % 0.11/0.48 % Proof found % 0.11/0.48 % SZS status Theorem for theBenchmark % 0.11/0.48 % SZS output start Proof % 0.11/0.49 %ClaNum:9(EqnAxiom:0) % 0.11/0.49 %VarNum:35(SingletonVarNum:14) % 0.11/0.49 %MaxLitNum:3 % 0.11/0.49 %MaxfuncDepth:3 % 0.11/0.49 %SharedTerms:18 % 0.11/0.49 %goalClause: 1 2 3 4 % 0.11/0.49 %singleGoalClaCount:4 % 0.11/0.49 [3]~P1(f6(a13),f4(f3(a2,a14)),a9) % 0.11/0.49 [4]~P1(f7(a12,f6(a13)),f8(f3(a2,a14)),a9) % 0.11/0.49 [1]P1(a1,f5(f4(f3(a2,a14))),a9) % 0.11/0.49 [2]P1(f7(a12,f6(a13)),f8(f10(a1,f3(a2,a14),a9)),a9) % 0.11/0.49 [5]~P1(x51,f4(x52),a9)+P1(x51,f8(x52),a9) % 0.11/0.49 [6]~P1(f6(x61),f5(x62),a9)+P1(f6(x61),x62,a9) % 0.11/0.49 [7]P1(x71,f5(x72),a9)+P1(f7(x73,x71),x72,a9)+~P1(f7(x73,x71),f5(x72),a9) % 0.11/0.49 [9]~P1(x93,f5(f4(x92)),a9)+~P1(x91,f8(f10(x93,x92,a9)),a9)+P1(x91,f11(f5(f4(x92)),f8(x92),a9),a9) % 0.11/0.49 [8]P1(x81,x82,x83)+P1(x81,x84,x83)+~P1(x81,f11(x84,x82,x83),x83) % 0.11/0.49 %EqnAxiom % 0.11/0.49 % 0.11/0.49 %------------------------------------------- % 0.11/0.49 cnf(14,plain, % 0.11/0.49 (~P1(f7(a12,f6(a13)),f5(f4(f3(a2,a14))),a9)), % 0.11/0.49 inference(scs_inference,[],[4,3,5,6,7])). % 0.11/0.49 cnf(23,plain, % 0.11/0.49 ($false), % 0.11/0.49 inference(scs_inference,[],[4,14,2,1,8,9]), % 0.11/0.49 ['proof']). % 0.11/0.49 % SZS output end Proof % 0.11/0.49 % Total time :0.020000s %------------------------------------------------------------------------------