%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV280-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 : n023.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:28 EDT 2024 % Result : Unsatisfiable 0.45s 0.62s % Output : CNFRefutation 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV280-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.11/0.33 % Computer : n023.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Thu Jun 20 19:04:09 EDT 2024 % 0.11/0.33 % CPUTime : % 0.45/0.59 start to proof:theBenchmark % 0.45/0.62 %------------------------------------------- % 0.45/0.62 % File :CSE---1.7 % 0.45/0.62 % Problem :theBenchmark % 0.45/0.62 % Transform :cnf % 0.45/0.62 % Format :tptp:raw % 0.45/0.62 % Command :java -jar mcs_scs.jar %d %s % 0.45/0.62 % 0.45/0.62 % Result :Theorem 0.000000s % 0.45/0.62 % Output :CNFRefutation 0.000000s % 0.45/0.62 %------------------------------------------- % 0.45/0.62 %------------------------------------------------------------------------------ % 0.45/0.62 % File : SWV280-2 : TPTP v8.2.0. Released v3.2.0. % 0.45/0.62 % Domain : Software Verification (Security) % 0.45/0.62 % Problem : Cryptographic protocol problem for public % 0.45/0.62 % Version : [Pau06] axioms : Reduced > Especial. % 0.45/0.62 % English : % 0.45/0.62 % 0.45/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.45/0.62 % Source : [Pau06] % 0.45/0.62 % Names : % 0.45/0.62 % 0.45/0.62 % Status : Unsatisfiable % 0.45/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.45/0.62 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 1 RR) % 0.45/0.62 % Number of literals : 4 ( 0 equ; 2 neg) % 0.45/0.62 % Maximal clause size : 2 ( 1 avg) % 0.45/0.62 % Maximal term depth : 2 ( 1 avg) % 0.45/0.62 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.45/0.62 % Number of functors : 7 ( 7 usr; 3 con; 0-3 aty) % 0.45/0.62 % Number of variables : 5 ( 2 sgn) % 0.45/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.45/0.62 % 0.45/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.45/0.62 % of which only a small selection are required for the refutation. % 0.45/0.62 % The mission is to find those few axioms, after which a refutation % 0.45/0.62 % can be quite easily found. This version has only the necessary % 0.45/0.62 % axioms. % 0.45/0.62 %------------------------------------------------------------------------------ % 0.45/0.62 cnf(cls_conjecture_0,negated_conjecture, % 0.45/0.62 c_in(c_Message_Omsg_ONonce(V_U),c_Event_Oused(v_evs),tc_Message_Omsg) ). % 0.45/0.62 % 0.45/0.62 cnf(cls_Nat_Ole__add1_0,axiom, % 0.45/0.62 c_lessequals(V_n,c_plus(V_n,V_m,tc_nat),tc_nat) ). % 0.45/0.62 % 0.45/0.62 cnf(cls_Public_ONonce__supply__lemma_0,axiom, % 0.45/0.62 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Event_Oused(V_evs),tc_Message_Omsg) % 0.45/0.62 | ~ c_lessequals(v_sko__urX(V_evs),V_U,tc_nat) ) ). % 0.45/0.62 % 0.45/0.62 %------------------------------------------------------------------------------ % 0.45/0.62 %------------------------------------------- % 0.45/0.62 % Proof found % 0.45/0.62 % SZS status Theorem for theBenchmark % 0.45/0.62 % SZS output start Proof % 0.45/0.62 %ClaNum:3(EqnAxiom:0) % 0.45/0.62 %VarNum:8(SingletonVarNum:5) % 0.45/0.62 %MaxLitNum:2 % 0.45/0.62 %MaxfuncDepth:1 % 0.45/0.62 %SharedTerms:4 % 0.45/0.62 %goalClause: 1 % 0.45/0.62 %singleGoalClaCount:1 % 0.45/0.62 [1]P1(f1(x11),f2(a3),a4) % 0.45/0.62 [2]P2(x21,f5(x21,x22,a6),a6) % 0.45/0.62 [3]~P1(f1(x32),f2(x31),a4)+~P2(f7(x31),x32,a6) % 0.45/0.62 %EqnAxiom % 0.45/0.62 % 0.45/0.62 %------------------------------------------- % 0.45/0.63 cnf(4,plain, % 0.45/0.63 ($false), % 0.45/0.63 inference(scs_inference,[],[1,2,3]), % 0.45/0.63 ['proof']). % 0.45/0.63 % SZS output end Proof % 0.45/0.63 % Total time :0.000000s %------------------------------------------------------------------------------