%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV244-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 : n025.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:14 EDT 2024 % Result : Unsatisfiable 0.19s 0.59s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV244-2 : TPTP v8.2.0. Released v3.2.0. % 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n025.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 19:04:39 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.19/0.59 %------------------------------------------- % 0.19/0.59 % File :CSE---1.7 % 0.19/0.59 % Problem :theBenchmark % 0.19/0.59 % Transform :cnf % 0.19/0.59 % Format :tptp:raw % 0.19/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.19/0.59 % 0.19/0.59 % Result :Theorem 0.000000s % 0.19/0.59 % Output :CNFRefutation 0.000000s % 0.19/0.59 %------------------------------------------- % 0.19/0.59 %------------------------------------------------------------------------------ % 0.19/0.59 % File : SWV244-2 : TPTP v8.2.0. Released v3.2.0. % 0.19/0.59 % Domain : Software Verification (Security) % 0.19/0.59 % Problem : Cryptographic protocol problem for messages % 0.19/0.59 % Version : [Pau06] axioms : Reduced > Especial. % 0.19/0.59 % English : % 0.19/0.59 % 0.19/0.59 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.19/0.59 % Source : [Pau06] % 0.19/0.59 % Names : % 0.19/0.59 % 0.19/0.59 % Status : Unsatisfiable % 0.19/0.59 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 0.19/0.59 % Syntax : Number of clauses : 6 ( 2 unt; 1 nHn; 4 RR) % 0.19/0.59 % Number of literals : 11 ( 0 equ; 5 neg) % 0.19/0.59 % Maximal clause size : 3 ( 1 avg) % 0.19/0.59 % Maximal term depth : 4 ( 1 avg) % 0.19/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.19/0.59 % Number of functors : 7 ( 7 usr; 4 con; 0-3 aty) % 0.19/0.59 % Number of variables : 14 ( 2 sgn) % 0.19/0.59 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.19/0.59 % 0.19/0.59 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.19/0.59 % of which only a small selection are required for the refutation. % 0.19/0.59 % The mission is to find those few axioms, after which a refutation % 0.19/0.59 % can be quite easily found. This version has only the necessary % 0.19/0.59 % axioms. % 0.19/0.59 %------------------------------------------------------------------------------ % 0.19/0.59 cnf(cls_conjecture_0,negated_conjecture, % 0.19/0.59 c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg) ). % 0.19/0.59 % 0.19/0.59 cnf(cls_conjecture_1,negated_conjecture, % 0.19/0.59 ~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) ). % 0.19/0.59 % 0.19/0.59 cnf(cls_Message_Oanalz_OInj_0,axiom, % 0.19/0.59 ( ~ c_in(V_X,V_H,tc_Message_Omsg) % 0.19/0.59 | c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ). % 0.19/0.59 % 0.19/0.59 cnf(cls_Set_OUnCI_0,axiom, % 0.19/0.59 ( ~ c_in(V_c,V_B,T_a) % 0.19/0.59 | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ). % 0.19/0.59 % 0.19/0.59 cnf(cls_Set_OUnCI_1,axiom, % 0.19/0.59 ( ~ c_in(V_c,V_A,T_a) % 0.19/0.59 | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ). % 0.19/0.59 % 0.19/0.59 cnf(cls_Set_OUnE_0,axiom, % 0.19/0.59 ( ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a) % 0.19/0.59 | c_in(V_c,V_B,T_a) % 0.19/0.59 | c_in(V_c,V_A,T_a) ) ). % 0.19/0.59 % 0.19/0.59 %------------------------------------------------------------------------------ % 0.19/0.59 %------------------------------------------- % 0.19/0.59 % Proof found % 0.19/0.59 % SZS status Theorem for theBenchmark % 0.19/0.59 % SZS output start Proof % 0.19/0.59 %ClaNum:6(EqnAxiom:0) % 0.19/0.59 %VarNum:31(SingletonVarNum:14) % 0.19/0.59 %MaxLitNum:3 % 0.19/0.59 %MaxfuncDepth:2 % 0.19/0.59 %SharedTerms:11 % 0.19/0.59 %goalClause: 1 2 % 0.19/0.59 %singleGoalClaCount:2 % 0.19/0.59 [1]P1(a1,f6(f3(a2),a7,a5),a5) % 0.19/0.59 [2]~P1(a1,f6(f4(f6(a2,a7,a5)),f3(a2),a5),a5) % 0.19/0.59 [3]~P1(x31,x32,a5)+P1(x31,f4(x32),a5) % 0.19/0.59 [4]~P1(x41,x43,x44)+P1(x41,f6(x42,x43,x44),x44) % 0.19/0.59 [5]~P1(x51,x52,x54)+P1(x51,f6(x52,x53,x54),x54) % 0.19/0.59 [6]P1(x61,x62,x63)+P1(x61,x64,x63)+~P1(x61,f6(x64,x62,x63),x63) % 0.19/0.59 %EqnAxiom % 0.19/0.59 % 0.19/0.59 %------------------------------------------- % 0.19/0.60 cnf(11,plain, % 0.19/0.60 (P1(a1,a7,a5)), % 0.19/0.60 inference(scs_inference,[],[1,2,4,5,6])). % 0.19/0.60 cnf(13,plain, % 0.19/0.60 (~P1(a1,f6(a2,a7,a5),a5)), % 0.19/0.60 inference(scs_inference,[],[1,2,4,5,6,3])). % 0.19/0.60 cnf(17,plain, % 0.19/0.60 ($false), % 0.19/0.60 inference(scs_inference,[],[13,11,5,4]), % 0.19/0.60 ['proof']). % 0.19/0.60 % SZS output end Proof % 0.19/0.60 % Total time :0.000000s %------------------------------------------------------------------------------