%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV253-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 : n027.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:17 EDT 2024 % Result : Unsatisfiable 0.52s 0.58s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV253-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.12/0.33 % Computer : n027.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:11:39 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.54 start to proof:theBenchmark % 0.52/0.57 %------------------------------------------- % 0.52/0.57 % File :CSE---1.7 % 0.52/0.57 % Problem :theBenchmark % 0.52/0.57 % Transform :cnf % 0.52/0.57 % Format :tptp:raw % 0.52/0.57 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.57 % 0.52/0.57 % Result :Theorem 0.000000s % 0.52/0.57 % Output :CNFRefutation 0.000000s % 0.52/0.57 %------------------------------------------- % 0.52/0.57 %------------------------------------------------------------------------------ % 0.52/0.57 % File : SWV253-2 : TPTP v8.2.0. Released v3.2.0. % 0.52/0.57 % Domain : Software Verification (Security) % 0.52/0.57 % Problem : Cryptographic protocol problem for messages % 0.52/0.57 % Version : [Pau06] axioms : Reduced > Especial. % 0.52/0.57 % English : % 0.52/0.57 % 0.52/0.57 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.52/0.57 % Source : [Pau06] % 0.52/0.57 % Names : % 0.52/0.57 % 0.52/0.57 % Status : Unsatisfiable % 0.52/0.57 % Rating : 0.07 v8.2.0, 0.06 v8.1.0, 0.11 v7.5.0, 0.06 v7.4.0, 0.00 v7.3.0, 0.08 v7.2.0, 0.00 v6.3.0, 0.10 v6.2.0, 0.20 v6.1.0, 0.09 v6.0.0, 0.00 v5.3.0, 0.10 v5.2.0, 0.00 v3.7.0, 0.14 v3.4.0, 0.17 v3.3.0, 0.11 v3.2.0 % 0.52/0.57 % Syntax : Number of clauses : 3 ( 1 unt; 1 nHn; 2 RR) % 0.52/0.57 % Number of literals : 5 ( 5 equ; 2 neg) % 0.52/0.57 % Maximal clause size : 2 ( 1 avg) % 0.52/0.57 % Maximal term depth : 3 ( 1 avg) % 0.52/0.57 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty) % 0.52/0.57 % Number of functors : 3 ( 3 usr; 2 con; 0-1 aty) % 0.52/0.57 % Number of variables : 1 ( 0 sgn) % 0.52/0.57 % SPC : CNF_UNS_RFO_PEQ_NUE % 0.52/0.57 % 0.52/0.57 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.52/0.57 % of which only a small selection are required for the refutation. % 0.52/0.57 % The mission is to find those few axioms, after which a refutation % 0.52/0.57 % can be quite easily found. This version has only the necessary % 0.52/0.57 % axioms. % 0.52/0.57 %------------------------------------------------------------------------------ % 0.52/0.57 cnf(cls_conjecture_0,negated_conjecture, % 0.52/0.57 ( v_K != v_K_H % 0.52/0.57 | c_Message_OinvKey(v_K) != c_Message_OinvKey(v_K_H) ) ). % 0.52/0.57 % 0.52/0.57 cnf(cls_conjecture_1,negated_conjecture, % 0.52/0.57 ( c_Message_OinvKey(v_K) = c_Message_OinvKey(v_K_H) % 0.52/0.57 | v_K = v_K_H ) ). % 0.52/0.58 % 0.52/0.58 cnf(cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0,axiom, % 0.52/0.58 c_Message_OinvKey(c_Message_OinvKey(V_y)) = V_y ). % 0.52/0.58 % 0.52/0.58 %------------------------------------------------------------------------------ % 0.52/0.58 %------------------------------------------- % 0.52/0.58 % Proof found % 0.52/0.58 % SZS status Theorem for theBenchmark % 0.52/0.58 % SZS output start Proof % 0.52/0.58 %ClaNum:7(EqnAxiom:4) % 0.52/0.58 %VarNum:2(SingletonVarNum:1) % 0.52/0.58 %MaxLitNum:2 % 0.52/0.58 %MaxfuncDepth:2 % 0.52/0.58 %SharedTerms:8 % 0.52/0.58 %goalClause: 6 7 % 0.52/0.58 [5]E(f1(f1(x51)),x51) % 0.52/0.58 [6]E(a2,a3)+E(f1(a2),f1(a3)) % 0.52/0.58 [7]~E(a2,a3)+~E(f1(a2),f1(a3)) % 0.52/0.58 %EqnAxiom % 0.52/0.58 [1]E(x11,x11) % 0.52/0.58 [2]E(x22,x21)+~E(x21,x22) % 0.52/0.58 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.52/0.58 [4]~E(x41,x42)+E(f1(x41),f1(x42)) % 0.52/0.58 % 0.52/0.58 %------------------------------------------- % 0.52/0.58 cnf(8,plain, % 0.52/0.58 (E(x81,f1(f1(x81)))), % 0.52/0.58 inference(scs_inference,[],[5,2])). % 0.52/0.58 cnf(9,plain, % 0.52/0.58 (E(f1(a2),f1(a3))), % 0.52/0.58 inference(scs_inference,[],[4,6])). % 0.52/0.58 cnf(10,plain, % 0.52/0.58 (~E(a2,a3)), % 0.52/0.58 inference(scs_inference,[],[9,7])). % 0.52/0.58 cnf(12,plain, % 0.52/0.58 (~E(a3,f1(f1(a2)))), % 0.52/0.58 inference(scs_inference,[],[10,8,3,2])). % 0.52/0.58 cnf(16,plain, % 0.52/0.58 (E(f1(f1(a3)),f1(f1(a2)))), % 0.52/0.58 inference(scs_inference,[],[9,2,4])). % 0.52/0.58 cnf(18,plain, % 0.52/0.58 ($false), % 0.52/0.58 inference(scs_inference,[],[16,8,12,2,3]), % 0.52/0.58 ['proof']). % 0.52/0.58 % SZS output end Proof % 0.52/0.58 % Total time :0.000000s %------------------------------------------------------------------------------