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