%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV242-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 : n029.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.58s 0.62s % Output : CNFRefutation 0.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV242-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 : n029.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:49:39 EDT 2024 % 0.12/0.33 % CPUTime : % 0.21/0.57 start to proof:theBenchmark % 0.58/0.61 %------------------------------------------- % 0.58/0.61 % File :CSE---1.7 % 0.58/0.61 % Problem :theBenchmark % 0.58/0.61 % Transform :cnf % 0.58/0.61 % Format :tptp:raw % 0.58/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.58/0.61 % 0.58/0.61 % Result :Theorem 0.010000s % 0.58/0.61 % Output :CNFRefutation 0.010000s % 0.58/0.61 %------------------------------------------- % 0.58/0.61 %------------------------------------------------------------------------------ % 0.58/0.61 % File : SWV242-2 : TPTP v8.2.0. Released v3.2.0. % 0.58/0.61 % Domain : Software Verification (Security) % 0.58/0.61 % Problem : Cryptographic protocol problem for messages % 0.58/0.61 % Version : [Pau06] axioms : Reduced > Especial. % 0.58/0.61 % English : % 0.58/0.61 % 0.58/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.58/0.61 % Source : [Pau06] % 0.58/0.61 % Names : % 0.58/0.61 % 0.58/0.61 % Status : Unsatisfiable % 0.58/0.61 % Rating : 0.00 v5.3.0, 0.05 v5.2.0, 0.00 v3.2.0 % 0.58/0.61 % Syntax : Number of clauses : 7 ( 4 unt; 0 nHn; 5 RR) % 0.58/0.61 % Number of literals : 11 ( 0 equ; 5 neg) % 0.58/0.61 % Maximal clause size : 3 ( 1 avg) % 0.58/0.61 % Maximal term depth : 3 ( 1 avg) % 0.58/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.58/0.61 % Number of functors : 8 ( 8 usr; 5 con; 0-3 aty) % 0.58/0.61 % Number of variables : 12 ( 2 sgn) % 0.58/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.58/0.61 % 0.58/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.58/0.61 % of which only a small selection are required for the refutation. % 0.58/0.61 % The mission is to find those few axioms, after which a refutation % 0.58/0.61 % can be quite easily found. This version has only the necessary % 0.58/0.61 % axioms. % 0.58/0.61 %------------------------------------------------------------------------------ % 0.58/0.61 cnf(cls_conjecture_0,negated_conjecture, % 0.58/0.61 c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_conjecture_1,negated_conjecture, % 0.58/0.62 c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_conjecture_2,negated_conjecture, % 0.58/0.62 ( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) % 0.58/0.62 | ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Message_Oanalz__mono_0,axiom, % 0.58/0.62 ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg)) % 0.58/0.62 | c_lessequals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)) ) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Set_OUn__upper1_0,axiom, % 0.58/0.62 c_lessequals(V_A,c_union(V_A,V_B,T_a),tc_set(T_a)) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Set_OUn__upper2_0,axiom, % 0.58/0.62 c_lessequals(V_B,c_union(V_A,V_B,T_a),tc_set(T_a)) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Set_Osubset__trans_0,axiom, % 0.58/0.62 ( ~ c_lessequals(V_B,V_C,tc_set(T_a)) % 0.58/0.62 | ~ c_lessequals(V_A,V_B,tc_set(T_a)) % 0.58/0.62 | c_lessequals(V_A,V_C,tc_set(T_a)) ) ). % 0.58/0.62 % 0.58/0.62 %------------------------------------------------------------------------------ % 0.58/0.62 %------------------------------------------- % 0.58/0.62 % Proof found % 0.58/0.62 % SZS status Theorem for theBenchmark % 0.58/0.62 % SZS output start Proof % 0.58/0.62 %ClaNum:7(EqnAxiom:0) % 0.58/0.62 %VarNum:23(SingletonVarNum:12) % 0.58/0.62 %MaxLitNum:3 % 0.58/0.62 %MaxfuncDepth:2 % 0.58/0.62 %SharedTerms:14 % 0.58/0.62 %goalClause: 1 2 7 % 0.58/0.62 %singleGoalClaCount:2 % 0.58/0.62 [1]P1(a1,f2(a6),f5(a3)) % 0.58/0.62 [2]P1(a7,f2(a8),f5(a3)) % 0.58/0.62 [3]P1(x31,f4(x32,x31,x33),f5(x33)) % 0.58/0.62 [4]P1(x41,f4(x41,x42,x43),f5(x43)) % 0.58/0.62 [7]~P1(a1,f2(f4(a6,a8,a3)),f5(a3))+~P1(a7,f2(f4(a6,a8,a3)),f5(a3)) % 0.58/0.62 [5]~P1(x51,x52,f5(a3))+P1(f2(x51),f2(x52),f5(a3)) % 0.58/0.62 [6]P1(x61,x62,f5(x63))+~P1(x64,x62,f5(x63))+~P1(x61,x64,f5(x63)) % 0.58/0.62 %EqnAxiom % 0.58/0.62 % 0.58/0.62 %------------------------------------------- % 0.58/0.62 cnf(17,plain, % 0.58/0.62 (P1(a1,f2(f4(a6,x171,a3)),f5(a3))), % 0.58/0.62 inference(scs_inference,[],[4,1,5,6])). % 0.58/0.62 cnf(18,plain, % 0.58/0.62 (~P1(a7,f2(f4(a6,a8,a3)),f5(a3))), % 0.58/0.62 inference(scs_inference,[],[17,7])). % 0.58/0.62 cnf(22,plain, % 0.58/0.62 ($false), % 0.58/0.62 inference(scs_inference,[],[18,2,3,6,5]), % 0.58/0.62 ['proof']). % 0.58/0.62 % SZS output end Proof % 0.58/0.62 % Total time :0.010000s %------------------------------------------------------------------------------