%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV283-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 : n028.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:29 EDT 2024 % Result : Unsatisfiable 58.57s 58.63s % Output : CNFRefutation 58.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV283-2 : TPTP v8.2.0. Released v3.2.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n028.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 16:45:38 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.55 start to proof:theBenchmark % 58.55/58.62 %------------------------------------------- % 58.55/58.62 % File :CSE---1.7 % 58.55/58.62 % Problem :theBenchmark % 58.55/58.62 % Transform :cnf % 58.55/58.62 % Format :tptp:raw % 58.55/58.62 % Command :java -jar mcs_scs.jar %d %s % 58.55/58.62 % 58.55/58.62 % Result :Theorem 58.000000s % 58.55/58.62 % Output :CNFRefutation 58.000000s % 58.55/58.62 %------------------------------------------- % 58.57/58.63 %------------------------------------------------------------------------------ % 58.57/58.63 % File : SWV283-2 : TPTP v8.2.0. Released v3.2.0. % 58.57/58.63 % Domain : Software Verification (Security) % 58.57/58.63 % Problem : Cryptographic protocol problem for public % 58.57/58.63 % Version : [Pau06] axioms : Reduced > Especial. % 58.57/58.63 % English : % 58.57/58.63 % 58.57/58.63 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 58.57/58.63 % Source : [Pau06] % 58.57/58.63 % Names : % 58.57/58.63 % 58.57/58.63 % Status : Unsatisfiable % 58.57/58.63 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.11 v6.1.0, 0.14 v5.5.0, 0.12 v5.4.0, 0.10 v5.1.0, 0.09 v5.0.0, 0.14 v4.1.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 58.57/58.63 % Syntax : Number of clauses : 6 ( 0 unt; 2 nHn; 4 RR) % 58.57/58.63 % Number of literals : 14 ( 0 equ; 6 neg) % 58.57/58.63 % Maximal clause size : 4 ( 2 avg) % 58.57/58.63 % Maximal term depth : 3 ( 1 avg) % 58.57/58.63 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 58.57/58.63 % Number of functors : 13 ( 13 usr; 6 con; 0-3 aty) % 58.57/58.63 % Number of variables : 13 ( 2 sgn) % 58.57/58.63 % SPC : CNF_UNS_RFO_NEQ_NHN % 58.57/58.63 % 58.57/58.63 % Comments : The problems in the [Pau06] collection each have very many axioms, % 58.57/58.63 % of which only a small selection are required for the refutation. % 58.57/58.63 % The mission is to find those few axioms, after which a refutation % 58.57/58.63 % can be quite easily found. This version has only the necessary % 58.57/58.63 % axioms. % 58.57/58.63 %------------------------------------------------------------------------------ % 58.57/58.63 cnf(cls_Message_Omsg__Nonce__supply_0,axiom, % 58.57/58.63 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Message_Oparts(c_insert(V_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) % 58.57/58.63 | ~ c_lessequals(v_sko__upX(V_msg),V_U,tc_nat) ) ). % 58.57/58.63 % 58.57/58.63 cnf(cls_Nat_Oadd__leE_0,axiom, % 58.57/58.63 ( ~ c_lessequals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat) % 58.57/58.63 | c_lessequals(V_k,V_n,tc_nat) ) ). % 58.57/58.63 % 58.57/58.63 cnf(cls_Nat_Oadd__leE_1,axiom, % 58.57/58.63 ( ~ c_lessequals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat) % 58.57/58.63 | c_lessequals(V_m,V_n,tc_nat) ) ). % 58.57/58.63 % 58.57/58.63 cnf(cls_conjecture_0,negated_conjecture, % 58.57/58.63 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Event_Oused(v_list),tc_Message_Omsg) % 58.57/58.63 | ~ c_lessequals(v_x,V_U,tc_nat) ) ). % 58.57/58.63 % 58.57/58.63 cnf(cls_conjecture_4,negated_conjecture, % 58.57/58.63 ( c_lessequals(V_W,v_xd(V_W),tc_nat) % 58.57/58.63 | c_lessequals(V_U,v_xd(V_U),tc_nat) ) ). % 58.57/58.63 % 58.57/58.63 cnf(cls_conjecture_9,negated_conjecture, % 58.57/58.63 ( c_in(c_Message_Omsg_ONonce(v_xd(V_X)),c_Event_Oused(v_list),tc_Message_Omsg) % 58.57/58.63 | c_in(c_Message_Omsg_ONonce(v_xd(V_X)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) % 58.57/58.63 | c_in(c_Message_Omsg_ONonce(v_xd(V_U)),c_Event_Oused(v_list),tc_Message_Omsg) % 58.57/58.63 | c_in(c_Message_Omsg_ONonce(v_xd(V_U)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ) ). % 58.57/58.63 % 58.57/58.63 %------------------------------------------------------------------------------ % 58.57/58.63 %------------------------------------------- % 58.57/58.63 % Proof found % 58.57/58.63 % SZS status Theorem for theBenchmark % 58.57/58.63 % SZS output start Proof % 58.57/58.65 %ClaNum:6(EqnAxiom:0) % 58.57/58.65 %VarNum:24(SingletonVarNum:13) % 58.57/58.65 %MaxLitNum:4 % 58.57/58.65 %MaxfuncDepth:2 % 58.57/58.65 %SharedTerms:9 % 58.57/58.65 %goalClause: 1 2 6 % 58.57/58.65 [2]~P1(a10,x21,a2)+~P2(f3(x21),f4(a11),a5) % 58.57/58.65 [1]P1(x11,f1(x11),a2)+P1(x12,f1(x12),a2) % 58.57/58.65 [5]~P1(f12(x51),x52,a2)+~P2(f3(x52),f8(f9(x51,a7,a5)),a5) % 58.57/58.65 [3]P1(x31,x32,a2)+~P1(f6(x33,x31,a2),x32,a2) % 58.57/58.65 [4]P1(x41,x42,a2)+~P1(f6(x41,x43,a2),x42,a2) % 58.57/58.65 [6]P2(f3(f1(x61)),f8(f9(a13,a7,a5)),a5)+P2(f3(f1(x62)),f8(f9(a13,a7,a5)),a5)+P2(f3(f1(x61)),f4(a11),a5)+P2(f3(f1(x62)),f4(a11),a5) % 58.57/58.65 %EqnAxiom % 58.57/58.65 % 58.57/58.65 %------------------------------------------- % 58.57/58.66 cnf(14,plain, % 58.57/58.66 (P1(x141,f1(f6(x142,x141,a2)),a2)), % 58.57/58.66 inference(scs_inference,[],[1,3])). % 58.57/58.66 cnf(15,plain, % 58.57/58.66 (P1(x151,f1(f6(x152,f6(x153,x151,a2),a2)),a2)), % 58.57/58.66 inference(scs_inference,[],[14,3])). % 58.57/58.66 cnf(21,plain, % 58.57/58.66 (P1(x211,f1(f6(x211,x212,a2)),a2)), % 58.57/58.66 inference(scs_inference,[],[1,4])). % 58.57/58.66 cnf(31,plain, % 58.57/58.66 (P2(f3(f1(f6(a10,x311,a2))),f8(f9(a13,a7,a5)),a5)), % 58.57/58.66 inference(scs_inference,[],[21,2,6])). % 58.57/58.66 cnf(81,plain, % 58.57/58.66 ($false), % 58.57/58.66 inference(scs_inference,[],[15,31,4,5]), % 58.57/58.66 ['proof']). % 58.57/58.66 % SZS output end Proof % 58.57/58.66 % Total time :58.000000s %------------------------------------------------------------------------------