%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV265-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 : n022.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:22 EDT 2024 % Result : Unsatisfiable 0.51s 0.59s % Output : CNFRefutation 0.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWV265-2 : TPTP v8.2.0. Released v3.2.0. % 0.04/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n022.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:01:53 EDT 2024 % 0.12/0.33 % CPUTime : % 0.51/0.55 start to proof:theBenchmark % 0.51/0.58 %------------------------------------------- % 0.51/0.58 % File :CSE---1.7 % 0.51/0.58 % Problem :theBenchmark % 0.51/0.58 % Transform :cnf % 0.51/0.58 % Format :tptp:raw % 0.51/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.51/0.58 % 0.51/0.58 % Result :Theorem 0.000000s % 0.51/0.58 % Output :CNFRefutation 0.000000s % 0.51/0.58 %------------------------------------------- % 0.51/0.59 %------------------------------------------------------------------------------ % 0.51/0.59 % File : SWV265-2 : TPTP v8.2.0. Released v3.2.0. % 0.51/0.59 % Domain : Software Verification (Security) % 0.51/0.59 % Problem : Cryptographic protocol problem for messages % 0.51/0.59 % Version : [Pau06] axioms : Reduced > Especial. % 0.51/0.59 % English : % 0.51/0.59 % 0.51/0.59 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.51/0.59 % Source : [Pau06] % 0.51/0.59 % Names : % 0.51/0.59 % 0.51/0.59 % Status : Unsatisfiable % 0.51/0.59 % Rating : 0.00 v5.3.0, 0.05 v5.2.0, 0.00 v3.2.0 % 0.51/0.59 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 3 RR) % 0.51/0.59 % Number of literals : 4 ( 0 equ; 2 neg) % 0.51/0.59 % Maximal clause size : 2 ( 1 avg) % 0.51/0.59 % Maximal term depth : 2 ( 1 avg) % 0.51/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.51/0.59 % Number of functors : 6 ( 6 usr; 4 con; 0-2 aty) % 0.51/0.59 % Number of variables : 3 ( 1 sgn) % 0.51/0.59 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.51/0.59 % 0.51/0.59 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.51/0.59 % of which only a small selection are required for the refutation. % 0.51/0.59 % The mission is to find those few axioms, after which a refutation % 0.51/0.59 % can be quite easily found. This version has only the necessary % 0.51/0.59 % axioms. % 0.51/0.59 %------------------------------------------------------------------------------ % 0.51/0.59 cnf(cls_conjecture_2,negated_conjecture, % 0.51/0.59 c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oparts(v_H),tc_Message_Omsg) ). % 0.51/0.59 % 0.51/0.59 cnf(cls_conjecture_3,negated_conjecture, % 0.51/0.59 ~ c_in(v_Y,c_Message_Oparts(v_H),tc_Message_Omsg) ). % 0.51/0.59 % 0.51/0.59 cnf(cls_Message_Oparts_OSnd_0,axiom, % 0.51/0.59 ( ~ c_in(c_Message_Omsg_OMPair(V_X,V_Y),c_Message_Oparts(V_H),tc_Message_Omsg) % 0.51/0.59 | c_in(V_Y,c_Message_Oparts(V_H),tc_Message_Omsg) ) ). % 0.51/0.59 % 0.51/0.59 %------------------------------------------------------------------------------ % 0.51/0.59 %------------------------------------------- % 0.51/0.59 % Proof found % 0.51/0.59 % SZS status Theorem for theBenchmark % 0.51/0.59 % SZS output start Proof % 0.51/0.59 %ClaNum:3(EqnAxiom:0) % 0.51/0.59 %VarNum:5(SingletonVarNum:3) % 0.51/0.59 %MaxLitNum:2 % 0.51/0.59 %MaxfuncDepth:1 % 0.51/0.59 %SharedTerms:8 % 0.51/0.59 %goalClause: 1 2 % 0.51/0.59 %singleGoalClaCount:2 % 0.51/0.59 [1]P1(f2(a1,a6),f4(a3),a5) % 0.51/0.59 [2]~P1(a6,f4(a3),a5) % 0.51/0.59 [3]P1(x31,f4(x32),a5)+~P1(f2(x33,x31),f4(x32),a5) % 0.51/0.59 %EqnAxiom % 0.51/0.59 % 0.51/0.59 %------------------------------------------- % 0.51/0.59 cnf(4,plain, % 0.51/0.59 ($false), % 0.51/0.59 inference(scs_inference,[],[2,1,3]), % 0.51/0.59 ['proof']). % 0.51/0.59 % SZS output end Proof % 0.51/0.59 % Total time :0.000000s %------------------------------------------------------------------------------