TSTP Solution File: SWV244-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV244-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 : n005.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:25 EDT 2023
% Result : Unsatisfiable 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV244-2 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.33 % Computer : n005.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 : Tue Aug 29 08:17:08 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 % File : SWV244-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.61 % Domain : Software Verification (Security)
% 0.20/0.61 % Problem : Cryptographic protocol problem for messages
% 0.20/0.61 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.61 % English :
% 0.20/0.61
% 0.20/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.61 % Source : [Pau06]
% 0.20/0.61 % Names :
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0
% 0.20/0.61 % Syntax : Number of clauses : 6 ( 2 unt; 1 nHn; 4 RR)
% 0.20/0.61 % Number of literals : 11 ( 0 equ; 5 neg)
% 0.20/0.61 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.61 % Maximal term depth : 4 ( 1 avg)
% 0.20/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.20/0.61 % Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% 0.20/0.61 % Number of variables : 14 ( 2 sgn)
% 0.20/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.61
% 0.20/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.61 % of which only a small selection are required for the refutation.
% 0.20/0.61 % The mission is to find those few axioms, after which a refutation
% 0.20/0.61 % can be quite easily found. This version has only the necessary
% 0.20/0.61 % axioms.
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.61 c_in(v_X,c_union(c_Message_Osynth(v_G),v_H,tc_Message_Omsg),tc_Message_Omsg) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.61 ~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Message_Oanalz_OInj_0,axiom,
% 0.20/0.61 ( ~ c_in(V_X,V_H,tc_Message_Omsg)
% 0.20/0.61 | c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Set_OUnCI_0,axiom,
% 0.20/0.61 ( ~ c_in(V_c,V_B,T_a)
% 0.20/0.61 | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Set_OUnCI_1,axiom,
% 0.20/0.61 ( ~ c_in(V_c,V_A,T_a)
% 0.20/0.61 | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Set_OUnE_0,axiom,
% 0.20/0.61 ( ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a)
% 0.20/0.61 | c_in(V_c,V_B,T_a)
% 0.20/0.61 | c_in(V_c,V_A,T_a) ) ).
% 0.20/0.61
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark
% 0.20/0.61 % SZS output start Proof
% 0.20/0.61 %ClaNum:6(EqnAxiom:0)
% 0.20/0.61 %VarNum:31(SingletonVarNum:14)
% 0.20/0.61 %MaxLitNum:3
% 0.20/0.61 %MaxfuncDepth:2
% 0.20/0.61 %SharedTerms:11
% 0.20/0.61 %goalClause: 1 2
% 0.20/0.61 %singleGoalClaCount:2
% 0.20/0.61 [1]P1(a1,f6(f3(a2),a7,a5),a5)
% 0.20/0.61 [2]~P1(a1,f6(f4(f6(a2,a7,a5)),f3(a2),a5),a5)
% 0.20/0.61 [3]~P1(x31,x32,a5)+P1(x31,f4(x32),a5)
% 0.20/0.61 [4]~P1(x41,x43,x44)+P1(x41,f6(x42,x43,x44),x44)
% 0.20/0.61 [5]~P1(x51,x52,x54)+P1(x51,f6(x52,x53,x54),x54)
% 0.20/0.61 [6]P1(x61,x62,x63)+P1(x61,x64,x63)+~P1(x61,f6(x64,x62,x63),x63)
% 0.20/0.61 %EqnAxiom
% 0.20/0.61
% 0.20/0.61 %-------------------------------------------
% 0.20/0.62 cnf(7,plain,
% 0.20/0.62 (~P1(a1,f4(f6(a2,a7,a5)),a5)),
% 0.20/0.62 inference(scs_inference,[],[2,5])).
% 0.20/0.62 cnf(9,plain,
% 0.20/0.62 (P1(a1,a7,a5)),
% 0.20/0.62 inference(scs_inference,[],[1,2,5,4,6])).
% 0.20/0.62 cnf(17,plain,
% 0.20/0.62 (~P1(a1,f6(a2,a7,a5),a5)),
% 0.20/0.62 inference(scs_inference,[],[1,7,5,4,3])).
% 0.20/0.62 cnf(23,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[17,9,5,4]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------