TSTP Solution File: SWV335-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV335-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n002.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 : Thu Aug 31 21:33:04 EDT 2023
% Result : Unsatisfiable 265.70s 265.80s
% Output : CNFRefutation 266.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV335-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n002.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 : Tue Aug 29 08:09:35 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof:theBenchmark
% 265.65/265.75 %-------------------------------------------
% 265.65/265.75 % File :CSE---1.6
% 265.65/265.75 % Problem :theBenchmark
% 265.65/265.75 % Transform :cnf
% 265.65/265.75 % Format :tptp:raw
% 265.65/265.75 % Command :java -jar mcs_scs.jar %d %s
% 265.65/265.75
% 265.65/265.75 % Result :Theorem 265.000000s
% 265.65/265.75 % Output :CNFRefutation 265.000000s
% 265.65/265.75 %-------------------------------------------
% 265.65/265.80 %------------------------------------------------------------------------------
% 265.65/265.80 % File : SWV335-2 : TPTP v8.1.2. Released v3.2.0.
% 265.65/265.80 % Domain : Software Verification (Security)
% 265.65/265.80 % Problem : Cryptographic protocol problem for Yahalom
% 265.70/265.80 % Version : [Pau06] axioms : Reduced > Especial.
% 265.70/265.80 % English :
% 265.70/265.80
% 265.70/265.80 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 265.70/265.80 % Source : [Pau06]
% 265.70/265.80 % Names :
% 265.70/265.80
% 265.70/265.80 % Status : Unsatisfiable
% 265.70/265.80 % Rating : 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0
% 265.70/265.80 % Syntax : Number of clauses : 9 ( 4 unt; 2 nHn; 9 RR)
% 265.70/265.80 % Number of literals : 17 ( 0 equ; 8 neg)
% 265.70/265.80 % Maximal clause size : 3 ( 1 avg)
% 265.70/265.80 % Maximal term depth : 4 ( 1 avg)
% 265.70/265.80 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 265.70/265.80 % Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% 265.70/265.80 % Number of variables : 14 ( 0 sgn)
% 265.70/265.80 % SPC : CNF_UNS_RFO_NEQ_NHN
% 265.70/265.80
% 265.70/265.80 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 265.70/265.80 % of which only a small selection are required for the refutation.
% 265.70/265.80 % The mission is to find those few axioms, after which a refutation
% 265.70/265.80 % can be quite easily found. This version has only the necessary
% 265.70/265.80 % axioms.
% 265.70/265.80 %------------------------------------------------------------------------------
% 265.70/265.80 cnf(cls_conjecture_1,negated_conjecture,
% 265.70/265.80 c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_conjecture_2,negated_conjecture,
% 265.70/265.80 ~ c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_conjecture_3,negated_conjecture,
% 265.70/265.80 c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg)),tc_Message_Omsg) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_conjecture_4,negated_conjecture,
% 265.70/265.80 ~ c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_Message_OCrypt__synth_1,axiom,
% 265.70/265.80 ( ~ c_in(c_Message_Omsg_OCrypt(V_K,V_X),c_Message_Osynth(V_H),tc_Message_Omsg)
% 265.70/265.80 | c_in(V_X,c_Message_Osynth(V_H),tc_Message_Omsg)
% 265.70/265.80 | c_in(c_Message_Omsg_OCrypt(V_K,V_X),V_H,tc_Message_Omsg) ) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_Message_OFake__parts__insert__in__Un__dest_0,axiom,
% 265.70/265.80 ( ~ c_in(V_Z,c_Message_Oparts(c_insert(V_X,V_H,tc_Message_Omsg)),tc_Message_Omsg)
% 265.70/265.80 | ~ c_in(V_X,c_Message_Osynth(c_Message_Oanalz(V_H)),tc_Message_Omsg)
% 265.70/265.80 | c_in(V_Z,c_union(c_Message_Osynth(c_Message_Oanalz(V_H)),c_Message_Oparts(V_H),tc_Message_Omsg),tc_Message_Omsg) ) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_Message_ONonce__synth_0,axiom,
% 265.70/265.80 ( ~ c_in(c_Message_Omsg_ONonce(V_n),c_Message_Osynth(V_H),tc_Message_Omsg)
% 265.70/265.80 | c_in(c_Message_Omsg_ONonce(V_n),V_H,tc_Message_Omsg) ) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_Message_Oanalz__into__parts__dest_0,axiom,
% 265.70/265.80 ( ~ c_in(V_c,c_Message_Oanalz(V_H),tc_Message_Omsg)
% 265.70/265.80 | c_in(V_c,c_Message_Oparts(V_H),tc_Message_Omsg) ) ).
% 265.70/265.80
% 265.70/265.80 cnf(cls_Set_OUnE_0,axiom,
% 265.70/265.80 ( ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a)
% 265.70/265.80 | c_in(V_c,V_B,T_a)
% 265.70/265.80 | c_in(V_c,V_A,T_a) ) ).
% 265.70/265.80
% 265.70/265.80 %------------------------------------------------------------------------------
% 265.70/265.80 %-------------------------------------------
% 265.70/265.80 % Proof found
% 265.70/265.80 % SZS status Theorem for theBenchmark
% 265.70/265.80 % SZS output start Proof
% 265.70/265.85 %ClaNum:9(EqnAxiom:0)
% 265.70/265.85 %VarNum:35(SingletonVarNum:14)
% 265.70/265.85 %MaxLitNum:3
% 265.70/265.85 %MaxfuncDepth:3
% 265.70/265.85 %SharedTerms:18
% 265.70/265.85 %goalClause: 1 2 3 4
% 265.70/265.85 %singleGoalClaCount:4
% 265.70/265.85 [3]~P1(f6(a13),f4(f3(a2,a14)),a9)
% 265.70/265.85 [4]~P1(f7(a12,f6(a13)),f8(f3(a2,a14)),a9)
% 265.70/265.85 [1]P1(a1,f5(f4(f3(a2,a14))),a9)
% 265.70/265.85 [2]P1(f7(a12,f6(a13)),f8(f10(a1,f3(a2,a14),a9)),a9)
% 265.70/265.85 [5]~P1(x51,f4(x52),a9)+P1(x51,f8(x52),a9)
% 265.70/265.85 [6]~P1(f6(x61),f5(x62),a9)+P1(f6(x61),x62,a9)
% 265.70/265.85 [7]P1(x71,f5(x72),a9)+P1(f7(x73,x71),x72,a9)+~P1(f7(x73,x71),f5(x72),a9)
% 265.70/265.85 [9]~P1(x93,f5(f4(x92)),a9)+~P1(x91,f8(f10(x93,x92,a9)),a9)+P1(x91,f11(f5(f4(x92)),f8(x92),a9),a9)
% 265.70/265.85 [8]P1(x81,x82,x83)+P1(x81,x84,x83)+~P1(x81,f11(x84,x82,x83),x83)
% 265.70/265.85 %EqnAxiom
% 265.70/265.85
% 265.70/265.85 %-------------------------------------------
% 265.91/266.00 cnf(12,plain,
% 265.91/266.00 (~P1(f7(a12,f6(a13)),f5(f4(f3(a2,a14))),a9)),
% 265.91/266.00 inference(scs_inference,[],[3,4,5,6,7])).
% 265.91/266.00 cnf(167584,plain,
% 265.91/266.00 ($false),
% 265.91/266.00 inference(scs_inference,[],[1,12,2,4,9,8]),
% 265.91/266.00 ['proof']).
% 266.14/266.24 % SZS output end Proof
% 266.14/266.24 % Total time :265.000000s
%------------------------------------------------------------------------------