%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV273-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/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:26 EDT 2024 % Result : Unsatisfiable 0.58s 0.62s % Output : CNFRefutation 0.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV273-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n029.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Thu Jun 20 21:32:24 EDT 2024 % 0.13/0.35 % CPUTime : % 0.22/0.59 start to proof:theBenchmark % 0.58/0.62 %------------------------------------------- % 0.58/0.62 % File :CSE---1.7 % 0.58/0.62 % Problem :theBenchmark % 0.58/0.62 % Transform :cnf % 0.58/0.62 % Format :tptp:raw % 0.58/0.62 % Command :java -jar mcs_scs.jar %d %s % 0.58/0.62 % 0.58/0.62 % Result :Theorem 0.000000s % 0.58/0.62 % Output :CNFRefutation 0.000000s % 0.58/0.62 %------------------------------------------- % 0.58/0.62 %------------------------------------------------------------------------------ % 0.58/0.62 % File : SWV273-2 : TPTP v8.2.0. Released v3.2.0. % 0.58/0.62 % Domain : Software Verification (Security) % 0.58/0.62 % Problem : Cryptographic protocol problem for messages % 0.58/0.62 % Version : [Pau06] axioms : Reduced > Especial. % 0.58/0.62 % English : % 0.58/0.62 % 0.58/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.58/0.62 % Source : [Pau06] % 0.58/0.62 % Names : % 0.58/0.62 % 0.58/0.62 % Status : Unsatisfiable % 0.58/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.58/0.62 % Syntax : Number of clauses : 6 ( 3 unt; 0 nHn; 4 RR) % 0.58/0.62 % Number of literals : 10 ( 0 equ; 5 neg) % 0.58/0.62 % Maximal clause size : 3 ( 1 avg) % 0.58/0.62 % Maximal term depth : 3 ( 1 avg) % 0.58/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.58/0.62 % Number of functors : 6 ( 6 usr; 2 con; 0-3 aty) % 0.58/0.62 % Number of variables : 11 ( 1 sgn) % 0.58/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.58/0.62 % 0.58/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.58/0.62 % of which only a small selection are required for the refutation. % 0.58/0.62 % The mission is to find those few axioms, after which a refutation % 0.58/0.62 % can be quite easily found. This version has only the necessary % 0.58/0.62 % axioms. % 0.58/0.62 %------------------------------------------------------------------------------ % 0.58/0.62 cnf(cls_conjecture_0,negated_conjecture, % 0.58/0.62 ~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Message_Oparts__mono_0,axiom, % 0.58/0.62 ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg)) % 0.58/0.62 | c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Message_Oparts__subset__iff_0,axiom, % 0.58/0.62 ( ~ c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) % 0.58/0.62 | c_lessequals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Message_Osynth__increasing_0,axiom, % 0.58/0.62 c_lessequals(V_H,c_Message_Osynth(V_H),tc_set(tc_Message_Omsg)) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Set_OUn__subset__iff_2,axiom, % 0.58/0.62 ( ~ c_lessequals(V_B,V_C,tc_set(T_a)) % 0.58/0.62 | ~ c_lessequals(V_A,V_C,tc_set(T_a)) % 0.58/0.62 | c_lessequals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a)) ) ). % 0.58/0.62 % 0.58/0.62 cnf(cls_Set_Osubset__refl_0,axiom, % 0.58/0.62 c_lessequals(V_A,V_A,tc_set(T_a)) ). % 0.58/0.62 % 0.58/0.62 %------------------------------------------------------------------------------ % 0.58/0.62 %------------------------------------------- % 0.58/0.62 % Proof found % 0.58/0.62 % SZS status Theorem for theBenchmark % 0.58/0.62 % SZS output start Proof % 0.58/0.63 %ClaNum:6(EqnAxiom:0) % 0.58/0.63 %VarNum:24(SingletonVarNum:11) % 0.58/0.63 %MaxLitNum:3 % 0.58/0.63 %MaxfuncDepth:2 % 0.58/0.63 %SharedTerms:8 % 0.58/0.63 %goalClause: 3 % 0.58/0.63 %singleGoalClaCount:1 % 0.58/0.63 [3]~P1(f5(f3(a6),f2(a6),a4),f3(f2(a6)),f1(a4)) % 0.58/0.63 [2]P1(x21,f2(x21),f1(a4)) % 0.58/0.63 [1]P1(x11,x11,f1(x12)) % 0.58/0.63 [4]~P1(x41,x42,f1(a4))+P1(f3(x41),f3(x42),f1(a4)) % 0.58/0.63 [5]P1(x51,f3(x52),f1(a4))+~P1(f3(x51),f3(x52),f1(a4)) % 0.58/0.63 [6]~P1(x61,x64,f1(x63))+~P1(x62,x64,f1(x63))+P1(f5(x61,x62,x63),x64,f1(x63)) % 0.58/0.63 %EqnAxiom % 0.58/0.63 % 0.58/0.63 %------------------------------------------- % 0.61/0.63 cnf(12,plain, % 0.61/0.63 (~P1(f2(a6),f3(f2(a6)),f1(a4))), % 0.61/0.63 inference(scs_inference,[],[3,2,6,4])). % 0.61/0.63 cnf(13,plain, % 0.61/0.63 ($false), % 0.61/0.63 inference(scs_inference,[],[12,1,5]), % 0.61/0.63 ['proof']). % 0.61/0.63 % SZS output end Proof % 0.61/0.63 % Total time :0.000000s %------------------------------------------------------------------------------