%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV277-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 : n026.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:27 EDT 2024 % Result : Unsatisfiable 0.53s 0.61s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV277-2 : TPTP v8.2.0. Released v3.2.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.11/0.33 % Computer : n026.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Thu Jun 20 15:25:54 EDT 2024 % 0.11/0.33 % CPUTime : % 0.53/0.57 start to proof:theBenchmark % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % File :CSE---1.7 % 0.53/0.60 % Problem :theBenchmark % 0.53/0.60 % Transform :cnf % 0.53/0.60 % Format :tptp:raw % 0.53/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.60 % 0.53/0.60 % Result :Theorem 0.000000s % 0.53/0.60 % Output :CNFRefutation 0.000000s % 0.53/0.60 %------------------------------------------- % 0.53/0.61 %------------------------------------------------------------------------------ % 0.53/0.61 % File : SWV277-2 : TPTP v8.2.0. Released v3.2.0. % 0.53/0.61 % Domain : Software Verification (Security) % 0.53/0.61 % Problem : Cryptographic protocol problem for events % 0.53/0.61 % Version : [Pau06] axioms : Reduced > Especial. % 0.53/0.61 % English : % 0.53/0.61 % 0.53/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.53/0.61 % Source : [Pau06] % 0.53/0.61 % Names : % 0.53/0.61 % 0.53/0.61 % Status : Unsatisfiable % 0.53/0.61 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.53/0.61 % Syntax : Number of clauses : 5 ( 3 unt; 0 nHn; 4 RR) % 0.53/0.61 % Number of literals : 8 ( 0 equ; 4 neg) % 0.53/0.61 % Maximal clause size : 3 ( 1 avg) % 0.53/0.61 % Maximal term depth : 3 ( 1 avg) % 0.53/0.61 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.53/0.61 % Number of functors : 8 ( 8 usr; 4 con; 0-1 aty) % 0.53/0.61 % Number of variables : 7 ( 0 sgn) % 0.53/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.53/0.61 % 0.53/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.53/0.61 % of which only a small selection are required for the refutation. % 0.53/0.61 % The mission is to find those few axioms, after which a refutation % 0.53/0.61 % can be quite easily found. This version has only the necessary % 0.53/0.61 % axioms. % 0.53/0.61 %------------------------------------------------------------------------------ % 0.53/0.61 cnf(cls_Message_Oanalz__subset__parts_0,axiom, % 0.53/0.61 c_lessequals(c_Message_Oanalz(V_H),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ). % 0.53/0.61 % 0.53/0.61 cnf(cls_Message_OkeysFor__mono_0,axiom, % 0.53/0.61 ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg)) % 0.53/0.61 | c_lessequals(c_Message_OkeysFor(V_G),c_Message_OkeysFor(V_H),tc_set(tc_nat)) ) ). % 0.53/0.61 % 0.53/0.61 cnf(cls_Set_OsubsetD_0,axiom, % 0.53/0.61 ( ~ c_in(V_c,V_A,T_a) % 0.53/0.61 | ~ c_lessequals(V_A,V_B,tc_set(T_a)) % 0.53/0.61 | c_in(V_c,V_B,T_a) ) ). % 0.53/0.61 % 0.53/0.61 cnf(cls_conjecture_2,negated_conjecture, % 0.53/0.61 ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat) ). % 0.53/0.61 % 0.53/0.61 cnf(cls_conjecture_3,negated_conjecture, % 0.53/0.61 c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat) ). % 0.53/0.61 % 0.53/0.61 %------------------------------------------------------------------------------ % 0.53/0.61 %------------------------------------------- % 0.53/0.61 % Proof found % 0.53/0.61 % SZS status Theorem for theBenchmark % 0.53/0.61 % SZS output start Proof % 0.53/0.61 %ClaNum:5(EqnAxiom:0) % 0.53/0.61 %VarNum:15(SingletonVarNum:7) % 0.53/0.61 %MaxLitNum:3 % 0.53/0.61 %MaxfuncDepth:2 % 0.53/0.61 %SharedTerms:12 % 0.53/0.61 %goalClause: 1 3 % 0.53/0.61 %singleGoalClaCount:2 % 0.53/0.61 [1]P1(a1,f4(f3(a2)),a5) % 0.53/0.61 [3]~P1(a1,f4(f6(a2)),a5) % 0.53/0.61 [2]P2(f3(x21),f6(x21),f8(a7)) % 0.53/0.61 [4]~P2(x41,x42,f8(a7))+P2(f4(x41),f4(x42),f8(a5)) % 0.53/0.61 [5]P1(x51,x52,x53)+~P1(x51,x54,x53)+~P2(x54,x52,f8(x53)) % 0.53/0.61 %EqnAxiom % 0.53/0.61 % 0.53/0.61 %------------------------------------------- % 0.53/0.61 cnf(8,plain, % 0.53/0.61 ($false), % 0.53/0.61 inference(scs_inference,[],[2,3,1,4,5]), % 0.53/0.61 ['proof']). % 0.53/0.61 % SZS output end Proof % 0.53/0.61 % Total time :0.000000s %------------------------------------------------------------------------------