TSTP Solution File: SWV239-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV239-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 : n031.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:32:23 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWV239-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n031.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 07:48:41 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % File :CSE---1.6
% 0.20/0.62 % Problem :theBenchmark
% 0.20/0.62 % Transform :cnf
% 0.20/0.62 % Format :tptp:raw
% 0.20/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.62
% 0.20/0.62 % Result :Theorem 0.000000s
% 0.20/0.62 % Output :CNFRefutation 0.000000s
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 % File : SWV239-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.62 % Domain : Software Verification (Security)
% 0.20/0.62 % Problem : Cryptographic protocol problem for messages
% 0.20/0.62 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.62 % English :
% 0.20/0.62
% 0.20/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.62 % Source : [Pau06]
% 0.20/0.62 % Names :
% 0.20/0.62
% 0.20/0.62 % Status : Unsatisfiable
% 0.20/0.62 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0
% 0.20/0.62 % Syntax : Number of clauses : 6 ( 2 unt; 1 nHn; 4 RR)
% 0.20/0.62 % Number of literals : 11 ( 0 equ; 5 neg)
% 0.20/0.62 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.62 % Maximal term depth : 4 ( 1 avg)
% 0.20/0.62 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty)
% 0.20/0.62 % Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% 0.20/0.62 % Number of variables : 14 ( 1 sgn)
% 0.20/0.62 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.62
% 0.20/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.62 % of which only a small selection are required for the refutation.
% 0.20/0.62 % The mission is to find those few axioms, after which a refutation
% 0.20/0.62 % can be quite easily found. This version has only the necessary
% 0.20/0.62 % axioms.
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.62 ~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Message_Oanalz__analzD__dest_0,axiom,
% 0.20/0.62 ( ~ c_in(V_X,c_Message_Oanalz(c_Message_Oanalz(V_H)),tc_Message_Omsg)
% 0.20/0.62 | c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Message_Oanalz__subset__cong_0,axiom,
% 0.20/0.62 ( ~ c_lessequals(c_Message_Oanalz(V_H),c_Message_Oanalz(V_H_H),tc_set(tc_Message_Omsg))
% 0.20/0.62 | ~ c_lessequals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_G_H),tc_set(tc_Message_Omsg))
% 0.20/0.62 | c_lessequals(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(V_G_H,V_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Set_OsubsetI_0,axiom,
% 0.20/0.62 ( c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)
% 0.20/0.62 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Set_OsubsetI_1,axiom,
% 0.20/0.62 ( ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)
% 0.20/0.62 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Set_Osubset__refl_0,axiom,
% 0.20/0.62 c_lessequals(V_A,V_A,tc_set(T_a)) ).
% 0.20/0.62
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:6(EqnAxiom:0)
% 0.20/0.62 %VarNum:31(SingletonVarNum:14)
% 0.20/0.62 %MaxLitNum:3
% 0.20/0.62 %MaxfuncDepth:3
% 0.20/0.62 %SharedTerms:10
% 0.20/0.62 %goalClause: 2
% 0.20/0.62 %singleGoalClaCount:1
% 0.20/0.62 [2]~P1(f2(f5(f2(a6),a7,a4)),f2(f5(a6,a7,a4)),f1(a4))
% 0.20/0.62 [1]P1(x11,x11,f1(x12))
% 0.20/0.62 [3]P2(x31,f2(x32),a4)+~P2(x31,f2(f2(x32)),a4)
% 0.20/0.62 [4]P2(f3(x41,x42,x43),x41,x43)+P1(x41,x42,f1(x43))
% 0.20/0.62 [5]~P2(f3(x51,x52,x53),x52,x53)+P1(x51,x52,f1(x53))
% 0.20/0.62 [6]~P1(f2(x61),f2(x63),f1(a4))+~P1(f2(x62),f2(x64),f1(a4))+P1(f2(f5(x61,x62,a4)),f2(f5(x63,x64,a4)),f1(a4))
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.63 cnf(9,plain,
% 0.20/0.63 (~P2(f3(f2(f2(a6)),f2(a6),a4),f2(a6),a4)),
% 0.20/0.63 inference(scs_inference,[],[2,1,6,5])).
% 0.20/0.63 cnf(11,plain,
% 0.20/0.63 (P2(f3(f2(f2(a6)),f2(a6),a4),f2(f2(a6)),a4)),
% 0.20/0.63 inference(scs_inference,[],[2,1,6,5,4])).
% 0.20/0.63 cnf(13,plain,
% 0.20/0.63 ($false),
% 0.20/0.63 inference(scs_inference,[],[11,9,3]),
% 0.20/0.63 ['proof']).
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------