%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV256-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:18 EDT 2024 % Result : Unsatisfiable 0.52s 0.59s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV256-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.31 % Computer : n029.cluster.edu % 0.12/0.31 % Model : x86_64 x86_64 % 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.31 % Memory : 8042.1875MB % 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.31 % CPULimit : 300 % 0.12/0.31 % WCLimit : 300 % 0.12/0.31 % DateTime : Thu Jun 20 14:35:54 EDT 2024 % 0.12/0.31 % CPUTime : % 0.18/0.56 start to proof:theBenchmark % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % File :CSE---1.7 % 0.52/0.59 % Problem :theBenchmark % 0.52/0.59 % Transform :cnf % 0.52/0.59 % Format :tptp:raw % 0.52/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.59 % 0.52/0.59 % Result :Theorem 0.000000s % 0.52/0.59 % Output :CNFRefutation 0.000000s % 0.52/0.59 %------------------------------------------- % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 % File : SWV256-2 : TPTP v8.2.0. Released v3.2.0. % 0.52/0.59 % Domain : Software Verification (Security) % 0.52/0.59 % Problem : Cryptographic protocol problem for messages % 0.52/0.59 % Version : [Pau06] axioms : Reduced > Especial. % 0.52/0.59 % English : % 0.52/0.59 % 0.52/0.59 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.52/0.59 % Source : [Pau06] % 0.52/0.59 % Names : % 0.52/0.59 % 0.52/0.59 % Status : Unsatisfiable % 0.52/0.59 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.52/0.59 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 0.52/0.59 % Number of literals : 4 ( 0 equ; 2 neg) % 0.52/0.59 % Maximal clause size : 2 ( 1 avg) % 0.52/0.59 % Maximal term depth : 3 ( 2 avg) % 0.52/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.52/0.59 % Number of functors : 5 ( 5 usr; 2 con; 0-1 aty) % 0.52/0.59 % Number of variables : 3 ( 0 sgn) % 0.52/0.59 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.52/0.59 % 0.52/0.59 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.52/0.59 % of which only a small selection are required for the refutation. % 0.52/0.59 % The mission is to find those few axioms, after which a refutation % 0.52/0.59 % can be quite easily found. This version has only the necessary % 0.52/0.59 % axioms. % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 cnf(cls_conjecture_0,negated_conjecture, % 0.52/0.59 ~ c_lessequals(c_Message_Oparts(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_Message_Oanalz__subset__parts_0,axiom, % 0.52/0.59 c_lessequals(c_Message_Oanalz(V_H),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_Message_Oparts__subset__iff_1,axiom, % 0.52/0.59 ( ~ c_lessequals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) % 0.52/0.59 | c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ). % 0.52/0.59 % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % Proof found % 0.52/0.59 % SZS status Theorem for theBenchmark % 0.52/0.59 % SZS output start Proof % 0.52/0.60 %ClaNum:3(EqnAxiom:0) % 0.52/0.60 %VarNum:6(SingletonVarNum:3) % 0.52/0.60 %MaxLitNum:2 % 0.52/0.60 %MaxfuncDepth:2 % 0.52/0.60 %SharedTerms:7 % 0.52/0.60 %goalClause: 2 % 0.52/0.60 %singleGoalClaCount:1 % 0.52/0.60 [2]~P1(f2(f1(a5)),f2(a5),f4(a3)) % 0.52/0.60 [1]P1(f1(x11),f2(x11),f4(a3)) % 0.52/0.60 [3]P1(f2(x31),f2(x32),f4(a3))+~P1(x31,f2(x32),f4(a3)) % 0.52/0.60 %EqnAxiom % 0.52/0.60 % 0.52/0.60 %------------------------------------------- % 0.57/0.60 cnf(4,plain, % 0.57/0.60 ($false), % 0.57/0.60 inference(scs_inference,[],[2,1,3]), % 0.57/0.60 ['proof']). % 0.57/0.60 % SZS output end Proof % 0.57/0.60 % Total time :0.000000s %------------------------------------------------------------------------------