%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV239-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:12 EDT 2024 % Result : Unsatisfiable 0.61s 0.66s % Output : CNFRefutation 0.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV239-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.34 % Computer : n001.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Thu Jun 20 18:10:39 EDT 2024 % 0.12/0.34 % CPUTime : % 0.42/0.62 start to proof:theBenchmark % 0.61/0.66 %------------------------------------------- % 0.61/0.66 % File :CSE---1.7 % 0.61/0.66 % Problem :theBenchmark % 0.61/0.66 % Transform :cnf % 0.61/0.66 % Format :tptp:raw % 0.61/0.66 % Command :java -jar mcs_scs.jar %d %s % 0.61/0.66 % 0.61/0.66 % Result :Theorem 0.000000s % 0.61/0.66 % Output :CNFRefutation 0.000000s % 0.61/0.66 %------------------------------------------- % 0.61/0.66 %------------------------------------------------------------------------------ % 0.61/0.66 % File : SWV239-2 : TPTP v8.2.0. Released v3.2.0. % 0.61/0.66 % Domain : Software Verification (Security) % 0.61/0.66 % Problem : Cryptographic protocol problem for messages % 0.61/0.66 % Version : [Pau06] axioms : Reduced > Especial. % 0.61/0.66 % English : % 0.61/0.66 % 0.61/0.66 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.61/0.66 % Source : [Pau06] % 0.61/0.66 % Names : % 0.61/0.66 % 0.61/0.66 % Status : Unsatisfiable % 0.61/0.66 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 0.61/0.66 % Syntax : Number of clauses : 6 ( 2 unt; 1 nHn; 4 RR) % 0.61/0.66 % Number of literals : 11 ( 0 equ; 5 neg) % 0.61/0.66 % Maximal clause size : 3 ( 1 avg) % 0.61/0.66 % Maximal term depth : 4 ( 1 avg) % 0.61/0.66 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.61/0.66 % Number of functors : 7 ( 7 usr; 3 con; 0-3 aty) % 0.61/0.66 % Number of variables : 14 ( 1 sgn) % 0.61/0.66 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.61/0.66 % 0.61/0.66 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.61/0.66 % of which only a small selection are required for the refutation. % 0.61/0.66 % The mission is to find those few axioms, after which a refutation % 0.61/0.66 % can be quite easily found. This version has only the necessary % 0.61/0.66 % axioms. % 0.61/0.66 %------------------------------------------------------------------------------ % 0.61/0.66 cnf(cls_conjecture_0,negated_conjecture, % 0.61/0.66 ~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ). % 0.61/0.66 % 0.61/0.66 cnf(cls_Message_Oanalz__analzD__dest_0,axiom, % 0.61/0.66 ( ~ c_in(V_X,c_Message_Oanalz(c_Message_Oanalz(V_H)),tc_Message_Omsg) % 0.61/0.66 | c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ). % 0.61/0.66 % 0.61/0.66 cnf(cls_Message_Oanalz__subset__cong_0,axiom, % 0.61/0.66 ( ~ c_lessequals(c_Message_Oanalz(V_H),c_Message_Oanalz(V_H_H),tc_set(tc_Message_Omsg)) % 0.61/0.66 | ~ c_lessequals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_G_H),tc_set(tc_Message_Omsg)) % 0.61/0.66 | c_lessequals(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(V_G_H,V_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ) ). % 0.61/0.66 % 0.61/0.66 cnf(cls_Set_OsubsetI_0,axiom, % 0.61/0.66 ( c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a) % 0.61/0.66 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ). % 0.61/0.66 % 0.61/0.66 cnf(cls_Set_OsubsetI_1,axiom, % 0.61/0.66 ( ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a) % 0.61/0.66 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ). % 0.61/0.66 % 0.61/0.66 cnf(cls_Set_Osubset__refl_0,axiom, % 0.61/0.66 c_lessequals(V_A,V_A,tc_set(T_a)) ). % 0.61/0.66 % 0.61/0.66 %------------------------------------------------------------------------------ % 0.61/0.66 %------------------------------------------- % 0.61/0.66 % Proof found % 0.61/0.66 % SZS status Theorem for theBenchmark % 0.61/0.66 % SZS output start Proof % 0.61/0.67 %ClaNum:6(EqnAxiom:0) % 0.61/0.67 %VarNum:31(SingletonVarNum:14) % 0.61/0.67 %MaxLitNum:3 % 0.61/0.67 %MaxfuncDepth:3 % 0.61/0.67 %SharedTerms:10 % 0.61/0.67 %goalClause: 2 % 0.61/0.67 %singleGoalClaCount:1 % 0.61/0.67 [2]~P1(f2(f5(f2(a6),a7,a4)),f2(f5(a6,a7,a4)),f1(a4)) % 0.61/0.67 [1]P1(x11,x11,f1(x12)) % 0.61/0.67 [3]P2(x31,f2(x32),a4)+~P2(x31,f2(f2(x32)),a4) % 0.61/0.67 [4]P2(f3(x41,x42,x43),x41,x43)+P1(x41,x42,f1(x43)) % 0.61/0.67 [5]~P2(f3(x51,x52,x53),x52,x53)+P1(x51,x52,f1(x53)) % 0.61/0.67 [6]~P1(f2(x61),f2(x63),f1(a4))+~P1(f2(x62),f2(x64),f1(a4))+P1(f2(f5(x61,x62,a4)),f2(f5(x63,x64,a4)),f1(a4)) % 0.61/0.67 %EqnAxiom % 0.61/0.67 % 0.61/0.67 %------------------------------------------- % 0.61/0.67 cnf(14,plain, % 0.61/0.67 ($false), % 0.61/0.67 inference(scs_inference,[],[2,1,6,4,5,3]), % 0.61/0.67 ['proof']). % 0.61/0.67 % SZS output end Proof % 0.61/0.67 % Total time :0.000000s %------------------------------------------------------------------------------