%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV284-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 : 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:30 EDT 2024 % Result : Unsatisfiable 0.65s 0.71s % Output : CNFRefutation 0.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV284-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/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 17:32:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.65/0.71 %------------------------------------------- % 0.65/0.71 % File :CSE---1.7 % 0.65/0.71 % Problem :theBenchmark % 0.65/0.71 % Transform :cnf % 0.65/0.71 % Format :tptp:raw % 0.65/0.71 % Command :java -jar mcs_scs.jar %d %s % 0.65/0.71 % 0.65/0.71 % Result :Theorem 0.120000s % 0.65/0.71 % Output :CNFRefutation 0.120000s % 0.65/0.71 %------------------------------------------- % 0.65/0.71 %------------------------------------------------------------------------------ % 0.65/0.71 % File : SWV284-2 : TPTP v8.2.0. Released v3.2.0. % 0.65/0.71 % Domain : Software Verification (Security) % 0.65/0.71 % Problem : Cryptographic protocol problem for shared % 0.65/0.71 % Version : [Pau06] axioms : Reduced > Especial. % 0.65/0.71 % English : % 0.65/0.71 % 0.65/0.71 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.65/0.71 % Source : [Pau06] % 0.65/0.71 % Names : % 0.65/0.71 % 0.65/0.71 % Status : Unsatisfiable % 0.65/0.71 % Rating : 0.00 v7.5.0, 0.17 v7.4.0, 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.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 0.65/0.71 % Syntax : Number of clauses : 6 ( 1 unt; 1 nHn; 4 RR) % 0.65/0.71 % Number of literals : 11 ( 0 equ; 6 neg) % 0.65/0.71 % Maximal clause size : 2 ( 1 avg) % 0.65/0.71 % Maximal term depth : 3 ( 1 avg) % 0.65/0.71 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.65/0.71 % Number of functors : 13 ( 13 usr; 6 con; 0-3 aty) % 0.65/0.71 % Number of variables : 11 ( 2 sgn) % 0.65/0.71 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.65/0.71 % 0.65/0.71 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.65/0.71 % of which only a small selection are required for the refutation. % 0.65/0.71 % The mission is to find those few axioms, after which a refutation % 0.65/0.71 % can be quite easily found. This version has only the necessary % 0.65/0.71 % axioms. % 0.65/0.71 %------------------------------------------------------------------------------ % 0.65/0.71 cnf(cls_conjecture_0,negated_conjecture, % 0.65/0.71 c_lessequals(V_U,v_x(V_U),tc_nat) ). % 0.65/0.71 % 0.65/0.71 cnf(cls_conjecture_1,negated_conjecture, % 0.65/0.71 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Event_Oused(v_list),tc_Message_Omsg) % 0.65/0.71 | ~ c_lessequals(v_N,V_U,tc_nat) ) ). % 0.65/0.71 % 0.65/0.71 cnf(cls_conjecture_2,negated_conjecture, % 0.65/0.71 ( c_in(c_Message_Omsg_ONonce(v_x(V_U)),c_Event_Oused(v_list),tc_Message_Omsg) % 0.65/0.71 | c_in(c_Message_Omsg_ONonce(v_x(V_U)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ) ). % 0.65/0.71 % 0.65/0.71 cnf(cls_Message_Omsg__Nonce__supply_0,axiom, % 0.65/0.71 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Message_Oparts(c_insert(V_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) % 0.65/0.71 | ~ c_lessequals(v_sko__upX(V_msg),V_U,tc_nat) ) ). % 0.65/0.71 % 0.65/0.71 cnf(cls_Nat_Oadd__leE_0,axiom, % 0.65/0.71 ( ~ c_lessequals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat) % 0.65/0.71 | c_lessequals(V_k,V_n,tc_nat) ) ). % 0.65/0.71 % 0.65/0.71 cnf(cls_Nat_Oadd__leE_1,axiom, % 0.65/0.71 ( ~ c_lessequals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat) % 0.65/0.71 | c_lessequals(V_m,V_n,tc_nat) ) ). % 0.65/0.71 % 0.65/0.71 %------------------------------------------------------------------------------ % 0.65/0.71 %------------------------------------------- % 0.65/0.71 % Proof found % 0.65/0.71 % SZS status Theorem for theBenchmark % 0.65/0.71 % SZS output start Proof % 0.65/0.71 %ClaNum:6(EqnAxiom:0) % 0.65/0.71 %VarNum:20(SingletonVarNum:11) % 0.65/0.71 %MaxLitNum:2 % 0.65/0.71 %MaxfuncDepth:2 % 0.65/0.71 %SharedTerms:9 % 0.65/0.71 %goalClause: 1 2 5 % 0.65/0.71 %singleGoalClaCount:1 % 0.65/0.71 [1]P1(x11,f1(x11),a2) % 0.65/0.71 [2]~P1(a10,x21,a2)+~P2(f3(x21),f4(a11),a5) % 0.65/0.71 [5]P2(f3(f1(x51)),f8(f9(a12,a7,a5)),a5)+P2(f3(f1(x51)),f4(a11),a5) % 0.65/0.71 [6]~P1(f13(x61),x62,a2)+~P2(f3(x62),f8(f9(x61,a7,a5)),a5) % 0.65/0.71 [3]P1(x31,x32,a2)+~P1(f6(x33,x31,a2),x32,a2) % 0.65/0.71 [4]P1(x41,x42,a2)+~P1(f6(x41,x43,a2),x42,a2) % 0.65/0.71 %EqnAxiom % 0.65/0.71 % 0.65/0.71 %------------------------------------------- % 0.65/0.72 cnf(7,plain, % 0.65/0.72 (P1(x71,f1(f6(x72,x71,a2)),a2)), % 0.65/0.72 inference(scs_inference,[],[1,3])). % 0.65/0.72 cnf(14,plain, % 0.65/0.72 (P1(x141,f1(f6(x142,x141,a2)),a2)), % 0.65/0.72 inference(rename_variables,[],[7])). % 0.65/0.72 cnf(16,plain, % 0.65/0.72 (P1(x161,f1(f6(x162,f6(x163,x161,a2),a2)),a2)), % 0.65/0.72 inference(scs_inference,[],[7,14,4,3])). % 0.65/0.72 cnf(31,plain, % 0.65/0.72 (~P2(f3(f1(f6(a10,x311,a2))),f4(a11),a5)), % 0.65/0.72 inference(scs_inference,[],[1,2,4])). % 0.65/0.72 cnf(57,plain, % 0.65/0.72 ($false), % 0.65/0.72 inference(scs_inference,[],[31,16,5,6]), % 0.65/0.72 ['proof']). % 0.65/0.72 % SZS output end Proof % 0.65/0.72 % Total time :0.120000s %------------------------------------------------------------------------------