%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV257-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:19 EDT 2024 % Result : Unsatisfiable 0.60s 0.65s % Output : CNFRefutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV257-2 : TPTP v8.2.0. Released v3.2.0. % 0.06/0.12 % 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.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Thu Jun 20 16:35:39 EDT 2024 % 0.12/0.33 % CPUTime : % 0.41/0.61 start to proof:theBenchmark % 0.60/0.64 %------------------------------------------- % 0.60/0.64 % File :CSE---1.7 % 0.60/0.64 % Problem :theBenchmark % 0.60/0.64 % Transform :cnf % 0.60/0.64 % Format :tptp:raw % 0.60/0.64 % Command :java -jar mcs_scs.jar %d %s % 0.60/0.64 % 0.60/0.64 % Result :Theorem 0.000000s % 0.60/0.64 % Output :CNFRefutation 0.000000s % 0.60/0.64 %------------------------------------------- % 0.60/0.64 %------------------------------------------------------------------------------ % 0.60/0.64 % File : SWV257-2 : TPTP v8.2.0. Released v3.2.0. % 0.60/0.64 % Domain : Software Verification (Security) % 0.60/0.64 % Problem : Cryptographic protocol problem for messages % 0.60/0.64 % Version : [Pau06] axioms : Reduced > Especial. % 0.60/0.64 % English : % 0.60/0.64 % 0.60/0.64 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.60/0.64 % Source : [Pau06] % 0.60/0.64 % Names : % 0.60/0.64 % 0.60/0.64 % Status : Unsatisfiable % 0.60/0.64 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.60/0.65 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 0.60/0.65 % Number of literals : 4 ( 0 equ; 2 neg) % 0.60/0.65 % Maximal clause size : 2 ( 1 avg) % 0.60/0.65 % Maximal term depth : 3 ( 2 avg) % 0.60/0.65 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.60/0.65 % Number of functors : 5 ( 5 usr; 2 con; 0-1 aty) % 0.60/0.65 % Number of variables : 3 ( 0 sgn) % 0.60/0.65 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.60/0.65 % 0.60/0.65 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.60/0.65 % of which only a small selection are required for the refutation. % 0.60/0.65 % The mission is to find those few axioms, after which a refutation % 0.60/0.65 % can be quite easily found. This version has only the necessary % 0.60/0.65 % axioms. % 0.60/0.65 %------------------------------------------------------------------------------ % 0.60/0.65 cnf(cls_conjecture_0,negated_conjecture, % 0.60/0.65 ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)) ). % 0.60/0.65 % 0.60/0.65 cnf(cls_Message_Oanalz__increasing_0,axiom, % 0.60/0.65 c_lessequals(V_H,c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)) ). % 0.60/0.65 % 0.60/0.65 cnf(cls_Message_Oparts__mono_0,axiom, % 0.60/0.65 ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg)) % 0.60/0.65 | c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ). % 0.60/0.65 % 0.60/0.65 %------------------------------------------------------------------------------ % 0.60/0.65 %------------------------------------------- % 0.60/0.65 % Proof found % 0.60/0.65 % SZS status Theorem for theBenchmark % 0.60/0.65 % SZS output start Proof % 0.60/0.65 %ClaNum:3(EqnAxiom:0) % 0.60/0.65 %VarNum:6(SingletonVarNum:3) % 0.60/0.65 %MaxLitNum:2 % 0.60/0.65 %MaxfuncDepth:2 % 0.60/0.65 %SharedTerms:7 % 0.60/0.65 %goalClause: 2 % 0.60/0.65 %singleGoalClaCount:1 % 0.60/0.65 [2]~P1(f3(a5),f3(f1(a5)),f4(a2)) % 0.60/0.65 [1]P1(x11,f1(x11),f4(a2)) % 0.60/0.65 [3]~P1(x31,x32,f4(a2))+P1(f3(x31),f3(x32),f4(a2)) % 0.60/0.65 %EqnAxiom % 0.60/0.65 % 0.60/0.65 %------------------------------------------- % 0.60/0.65 cnf(4,plain, % 0.60/0.65 ($false), % 0.60/0.65 inference(scs_inference,[],[1,2,3]), % 0.60/0.65 ['proof']). % 0.60/0.65 % SZS output end Proof % 0.60/0.65 % Total time :0.000000s %------------------------------------------------------------------------------