%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV255-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 : n001.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:18 EDT 2024 % Result : Unsatisfiable 58.57s 58.60s % Output : CNFRefutation 58.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV255-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.13/0.33 % Computer : n001.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Thu Jun 20 14:29:54 EDT 2024 % 0.13/0.33 % CPUTime : % 0.20/0.56 start to proof:theBenchmark % 58.51/58.58 %------------------------------------------- % 58.51/58.58 % File :CSE---1.7 % 58.51/58.58 % Problem :theBenchmark % 58.51/58.58 % Transform :cnf % 58.51/58.58 % Format :tptp:raw % 58.51/58.58 % Command :java -jar mcs_scs.jar %d %s % 58.51/58.58 % 58.51/58.58 % Result :Theorem 58.000000s % 58.51/58.58 % Output :CNFRefutation 58.000000s % 58.51/58.58 %------------------------------------------- % 58.57/58.60 %------------------------------------------------------------------------------ % 58.57/58.60 % File : SWV255-2 : TPTP v8.2.0. Released v3.2.0. % 58.57/58.60 % Domain : Software Verification (Security) % 58.57/58.60 % Problem : Cryptographic protocol problem for messages % 58.57/58.60 % Version : [Pau06] axioms : Reduced > Especial. % 58.57/58.60 % English : % 58.57/58.60 % 58.57/58.60 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 58.57/58.60 % Source : [Pau06] % 58.57/58.60 % Names : % 58.57/58.60 % 58.57/58.60 % Status : Unsatisfiable % 58.57/58.60 % 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.07 v4.1.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 58.57/58.60 % Syntax : Number of clauses : 6 ( 1 unt; 1 nHn; 4 RR) % 58.57/58.60 % Number of literals : 11 ( 0 equ; 6 neg) % 58.57/58.60 % Maximal clause size : 2 ( 1 avg) % 58.57/58.60 % Maximal term depth : 3 ( 1 avg) % 58.57/58.60 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 58.57/58.60 % Number of functors : 12 ( 12 usr; 7 con; 0-3 aty) % 58.57/58.60 % Number of variables : 10 ( 2 sgn) % 58.57/58.60 % SPC : CNF_UNS_RFO_NEQ_NHN % 58.57/58.60 % 58.57/58.60 % Comments : The problems in the [Pau06] collection each have very many axioms, % 58.57/58.60 % of which only a small selection are required for the refutation. % 58.57/58.60 % The mission is to find those few axioms, after which a refutation % 58.57/58.60 % can be quite easily found. This version has only the necessary % 58.57/58.60 % axioms. % 58.57/58.60 %------------------------------------------------------------------------------ % 58.57/58.60 cnf(cls_conjecture_0,negated_conjecture, % 58.57/58.60 c_lessequals(V_U,v_xb(V_U),tc_nat) ). % 58.57/58.60 % 58.57/58.60 cnf(cls_conjecture_1,negated_conjecture, % 58.57/58.60 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) % 58.57/58.60 | ~ c_lessequals(v_x,V_U,tc_nat) ) ). % 58.57/58.60 % 58.57/58.60 cnf(cls_conjecture_2,negated_conjecture, % 58.57/58.60 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) % 58.57/58.60 | ~ c_lessequals(v_xa,V_U,tc_nat) ) ). % 58.57/58.60 % 58.57/58.60 cnf(cls_conjecture_3,negated_conjecture, % 58.57/58.60 ( c_in(c_Message_Omsg_ONonce(v_xb(V_U)),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) % 58.57/58.60 | c_in(c_Message_Omsg_ONonce(v_xb(V_U)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ) ). % 58.57/58.60 % 58.57/58.60 cnf(cls_Nat_Oadd__leE_0,axiom, % 58.57/58.60 ( ~ c_lessequals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat) % 58.57/58.60 | c_lessequals(V_k,V_n,tc_nat) ) ). % 58.57/58.60 % 58.57/58.60 cnf(cls_Nat_Oadd__leE_1,axiom, % 58.57/58.60 ( ~ c_lessequals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat) % 58.57/58.60 | c_lessequals(V_m,V_n,tc_nat) ) ). % 58.57/58.60 % 58.57/58.60 %------------------------------------------------------------------------------ % 58.57/58.60 %------------------------------------------- % 58.57/58.60 % Proof found % 58.57/58.60 % SZS status Theorem for theBenchmark % 58.57/58.60 % SZS output start Proof % 58.57/58.62 %ClaNum:6(EqnAxiom:0) % 58.57/58.62 %VarNum:18(SingletonVarNum:10) % 58.57/58.62 %MaxLitNum:2 % 58.57/58.62 %MaxfuncDepth:2 % 58.57/58.62 %SharedTerms:11 % 58.57/58.62 %goalClause: 1 4 5 6 % 58.57/58.62 %singleGoalClaCount:1 % 58.57/58.62 [1]P1(x11,f1(x11),a2) % 58.57/58.62 [4]~P1(a9,x41,a2)+~P2(f4(x41),f6(f7(a10,a5,a8)),a8) % 58.57/58.62 [5]~P1(a12,x51,a2)+~P2(f4(x51),f6(f7(a11,a5,a8)),a8) % 58.57/58.62 [6]P2(f4(f1(x61)),f6(f7(a10,a5,a8)),a8)+P2(f4(f1(x61)),f6(f7(a11,a5,a8)),a8) % 58.57/58.62 [2]P1(x21,x22,a2)+~P1(f3(x23,x21,a2),x22,a2) % 58.57/58.62 [3]P1(x31,x32,a2)+~P1(f3(x31,x33,a2),x32,a2) % 58.57/58.62 %EqnAxiom % 58.57/58.62 % 58.57/58.62 %------------------------------------------- % 58.57/58.63 cnf(8,plain, % 58.57/58.63 (P1(x81,f1(x81),a2)), % 58.57/58.63 inference(rename_variables,[],[1])). % 58.57/58.63 cnf(10,plain, % 58.57/58.63 (P1(x101,f1(f3(x101,x102,a2)),a2)), % 58.57/58.63 inference(scs_inference,[],[1,8,2,3])). % 58.57/58.63 cnf(31,plain, % 58.57/58.63 (~P2(f4(f1(f3(x311,a9,a2))),f6(f7(a10,a5,a8)),a8)), % 58.57/58.63 inference(scs_inference,[],[1,2,4])). % 58.57/58.63 cnf(115,plain, % 58.57/58.63 (P2(f4(f1(f3(a12,x1151,a2))),f6(f7(a10,a5,a8)),a8)), % 58.57/58.63 inference(scs_inference,[],[10,6,5])). % 58.57/58.63 cnf(123,plain, % 58.57/58.63 ($false), % 58.57/58.63 inference(scs_inference,[],[31,115]), % 58.57/58.63 ['proof']). % 58.57/58.63 % SZS output end Proof % 58.57/58.63 % Total time :58.000000s %------------------------------------------------------------------------------