%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV263-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 : n021.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:21 EDT 2024 % Result : Unsatisfiable 0.47s 0.62s % Output : CNFRefutation 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SWV263-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n021.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.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Thu Jun 20 18:13:54 EDT 2024 % 0.12/0.34 % CPUTime : % 0.47/0.60 start to proof:theBenchmark % 0.47/0.62 %------------------------------------------- % 0.47/0.62 % File :CSE---1.7 % 0.47/0.62 % Problem :theBenchmark % 0.47/0.62 % Transform :cnf % 0.47/0.62 % Format :tptp:raw % 0.47/0.62 % Command :java -jar mcs_scs.jar %d %s % 0.47/0.62 % 0.47/0.62 % Result :Theorem 0.000000s % 0.47/0.62 % Output :CNFRefutation 0.000000s % 0.47/0.62 %------------------------------------------- % 0.47/0.62 %------------------------------------------------------------------------------ % 0.47/0.62 % File : SWV263-2 : TPTP v8.2.0. Released v3.2.0. % 0.47/0.62 % Domain : Software Verification (Security) % 0.47/0.62 % Problem : Cryptographic protocol problem for messages % 0.47/0.62 % Version : [Pau06] axioms : Reduced > Especial. % 0.47/0.62 % English : % 0.47/0.62 % 0.47/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.47/0.62 % Source : [Pau06] % 0.47/0.62 % Names : % 0.47/0.62 % 0.47/0.62 % Status : Unsatisfiable % 0.47/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.47/0.62 % Syntax : Number of clauses : 5 ( 3 unt; 0 nHn; 5 RR) % 0.47/0.62 % Number of literals : 8 ( 0 equ; 4 neg) % 0.47/0.62 % Maximal clause size : 3 ( 1 avg) % 0.47/0.62 % Maximal term depth : 2 ( 1 avg) % 0.47/0.62 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.47/0.62 % Number of functors : 6 ( 6 usr; 4 con; 0-1 aty) % 0.47/0.62 % Number of variables : 6 ( 0 sgn) % 0.47/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.47/0.62 % 0.47/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.47/0.62 % of which only a small selection are required for the refutation. % 0.47/0.62 % The mission is to find those few axioms, after which a refutation % 0.47/0.62 % can be quite easily found. This version has only the necessary % 0.47/0.62 % axioms. % 0.47/0.62 %------------------------------------------------------------------------------ % 0.47/0.62 cnf(cls_conjecture_0,negated_conjecture, % 0.47/0.62 c_lessequals(v_G,v_H,tc_set(tc_Message_Omsg)) ). % 0.47/0.62 % 0.47/0.62 cnf(cls_conjecture_1,negated_conjecture, % 0.47/0.62 c_in(v_X,v_G,tc_Message_Omsg) ). % 0.47/0.62 % 0.47/0.62 cnf(cls_conjecture_2,negated_conjecture, % 0.47/0.62 ~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg) ). % 0.47/0.62 % 0.47/0.62 cnf(cls_Message_Oparts_OInj_0,axiom, % 0.47/0.62 ( ~ c_in(V_X,V_H,tc_Message_Omsg) % 0.47/0.62 | c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg) ) ). % 0.47/0.62 % 0.47/0.62 cnf(cls_Set_OsubsetD_0,axiom, % 0.47/0.62 ( ~ c_in(V_c,V_A,T_a) % 0.47/0.62 | ~ c_lessequals(V_A,V_B,tc_set(T_a)) % 0.47/0.62 | c_in(V_c,V_B,T_a) ) ). % 0.47/0.62 % 0.47/0.62 %------------------------------------------------------------------------------ % 0.47/0.62 %------------------------------------------- % 0.47/0.62 % Proof found % 0.47/0.62 % SZS status Theorem for theBenchmark % 0.47/0.62 % SZS output start Proof % 0.47/0.62 %ClaNum:5(EqnAxiom:0) % 0.47/0.63 %VarNum:13(SingletonVarNum:6) % 0.47/0.63 %MaxLitNum:3 % 0.47/0.63 %MaxfuncDepth:1 % 0.47/0.63 %SharedTerms:9 % 0.47/0.63 %goalClause: 1 2 3 % 0.47/0.63 %singleGoalClaCount:3 % 0.47/0.63 [1]P1(a1,a2,a3) % 0.47/0.63 [2]P2(a2,a6,f5(a3)) % 0.47/0.63 [3]~P1(a1,f4(a6),a3) % 0.47/0.63 [4]~P1(x41,x42,a3)+P1(x41,f4(x42),a3) % 0.47/0.63 [5]P1(x51,x52,x53)+~P1(x51,x54,x53)+~P2(x54,x52,f5(x53)) % 0.47/0.63 %EqnAxiom % 0.47/0.63 % 0.47/0.63 %------------------------------------------- % 0.47/0.63 cnf(8,plain, % 0.47/0.63 ($false), % 0.47/0.63 inference(scs_inference,[],[1,2,3,4,5]), % 0.47/0.63 ['proof']). % 0.47/0.63 % SZS output end Proof % 0.47/0.63 % Total time :0.000000s %------------------------------------------------------------------------------