TSTP Solution File: SWW959+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW959+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n011.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 : Tue Aug 22 11:08:24 EDT 2023
% Result : Theorem 6.22s 2.45s
% Output : CNFRefutation 6.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 63
% Syntax : Number of formulae : 88 ( 19 unt; 54 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 53 ( 25 ~; 17 |; 5 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 54 ( 39 >; 15 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 49 ( 49 usr; 15 con; 0-2 aty)
% Number of variables : 34 (; 34 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pred_mess > pred_equal > pred_eq_bitstring_bitstring > pred_table > pred_attacker > tuple_keys > tuple_key_retrieval_server_in_1 > tuple_key_register_server_in_1 > tuple_client_B_out_1 > tuple_client_A_out_1 > tuple_2 > constr_sign > constr_enc > constr_dec > constr_checksign > constr_aenc > constr_adec > #nlpp > tuple_out_3 > tuple_out_2 > tuple_out_1 > tuple_key_retrieval_server_out_2 > tuple_client_B_out_6 > tuple_client_B_out_4 > tuple_client_B_in_5 > tuple_client_B_in_3 > tuple_client_B_in_2 > tuple_client_A_out_5 > tuple_client_A_out_3 > tuple_client_A_in_4 > tuple_client_A_in_2 > name_new0x2Dname > name_Nb > name_Na > constr_tuple_2_get_1_bitstring > constr_tuple_2_get_1 > constr_tuple_2_get_0x30_bitstring > constr_tuple_2_get_0x30 > constr_pkey > constr_getmess > tuple_true > tuple_false > name_skS > name_skB > name_skA > name_objective > name_c > name_I > name_B > name_A > constr_CONST_4 > constr_CONST_3 > constr_CONST_2 > constr_CONST_1 > constr_CONST_0x30
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(tuple_out_1,type,
tuple_out_1: $i > $i ).
tff(tuple_key_retrieval_server_in_1,type,
tuple_key_retrieval_server_in_1: ( $i * $i ) > $i ).
tff(tuple_client_A_in_2,type,
tuple_client_A_in_2: $i > $i ).
tff(name_I,type,
name_I: $i ).
tff(constr_dec,type,
constr_dec: ( $i * $i ) > $i ).
tff(pred_mess,type,
pred_mess: ( $i * $i ) > $o ).
tff(name_c,type,
name_c: $i ).
tff(tuple_out_3,type,
tuple_out_3: $i > $i ).
tff(pred_equal,type,
pred_equal: ( $i * $i ) > $o ).
tff(name_objective,type,
name_objective: $i ).
tff(tuple_client_A_out_3,type,
tuple_client_A_out_3: $i > $i ).
tff(tuple_client_B_out_6,type,
tuple_client_B_out_6: $i > $i ).
tff(constr_getmess,type,
constr_getmess: $i > $i ).
tff(tuple_client_B_in_2,type,
tuple_client_B_in_2: $i > $i ).
tff(pred_table,type,
pred_table: $i > $o ).
tff(constr_CONST_2,type,
constr_CONST_2: $i ).
tff(name_Nb,type,
name_Nb: $i > $i ).
tff(tuple_client_B_in_5,type,
tuple_client_B_in_5: $i > $i ).
tff(tuple_client_A_out_1,type,
tuple_client_A_out_1: ( $i * $i ) > $i ).
tff(constr_sign,type,
constr_sign: ( $i * $i ) > $i ).
tff(name_skB,type,
name_skB: $i ).
tff(tuple_client_B_out_4,type,
tuple_client_B_out_4: $i > $i ).
tff(name_A,type,
name_A: $i ).
tff(constr_adec,type,
constr_adec: ( $i * $i ) > $i ).
tff(pred_attacker,type,
pred_attacker: $i > $o ).
tff(tuple_false,type,
tuple_false: $i ).
tff(tuple_key_retrieval_server_out_2,type,
tuple_key_retrieval_server_out_2: $i > $i ).
tff(tuple_client_B_out_1,type,
tuple_client_B_out_1: ( $i * $i ) > $i ).
tff(constr_tuple_2_get_1,type,
constr_tuple_2_get_1: $i > $i ).
tff(name_B,type,
name_B: $i ).
tff(constr_tuple_2_get_0x30_bitstring,type,
constr_tuple_2_get_0x30_bitstring: $i > $i ).
tff(constr_checksign,type,
constr_checksign: ( $i * $i ) > $i ).
tff(constr_CONST_4,type,
constr_CONST_4: $i ).
tff(constr_tuple_2_get_1_bitstring,type,
constr_tuple_2_get_1_bitstring: $i > $i ).
tff(tuple_client_A_out_5,type,
tuple_client_A_out_5: $i > $i ).
tff(tuple_keys,type,
tuple_keys: ( $i * $i ) > $i ).
tff(name_Na,type,
name_Na: $i > $i ).
tff(tuple_2,type,
tuple_2: ( $i * $i ) > $i ).
tff(name_skA,type,
name_skA: $i ).
tff(constr_pkey,type,
constr_pkey: $i > $i ).
tff(constr_CONST_0x30,type,
constr_CONST_0x30: $i ).
tff(tuple_out_2,type,
tuple_out_2: $i > $i ).
tff(name_skS,type,
name_skS: $i ).
tff(tuple_key_register_server_in_1,type,
tuple_key_register_server_in_1: ( $i * $i ) > $i ).
tff(constr_CONST_3,type,
constr_CONST_3: $i ).
tff(constr_CONST_1,type,
constr_CONST_1: $i ).
tff(tuple_client_B_in_3,type,
tuple_client_B_in_3: $i > $i ).
tff(constr_aenc,type,
constr_aenc: ( $i * $i ) > $i ).
tff(name_new0x2Dname,type,
name_new0x2Dname: $i > $i ).
tff(constr_tuple_2_get_0x30,type,
constr_tuple_2_get_0x30: $i > $i ).
tff(pred_eq_bitstring_bitstring,type,
pred_eq_bitstring_bitstring: ( $i * $i ) > $o ).
tff(tuple_client_A_in_4,type,
tuple_client_A_in_4: $i > $i ).
tff(constr_enc,type,
constr_enc: ( $i * $i ) > $i ).
tff(tuple_true,type,
tuple_true: $i ).
tff(f_529,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
tff(f_203,axiom,
! [VAR_X_35,VAR_Y_36] : pred_eq_bitstring_bitstring(VAR_X_35,VAR_Y_36),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax86) ).
tff(f_511,axiom,
! [VAR_0X40SID_545,VAR_AENC_NA_A_547,VAR_AENC_NB_546,VAR_SIGN_A_PKA_548] :
( ( pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_545),constr_adec(VAR_AENC_NB_546,name_skB))
& pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_546))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_547,name_skB)))
& pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_548,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax165) ).
tff(f_341,axiom,
! [VAR_V_151] :
( pred_attacker(VAR_V_151)
=> pred_attacker(tuple_client_B_in_5(VAR_V_151)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax119) ).
tff(f_467,axiom,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax157) ).
tff(f_254,axiom,
! [VAR_V_71] :
( pred_attacker(tuple_out_1(VAR_V_71))
=> pred_attacker(VAR_V_71) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax99) ).
tff(f_349,axiom,
! [VAR_V_157] :
( pred_attacker(VAR_V_157)
=> pred_attacker(tuple_client_B_in_3(VAR_V_157)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax121) ).
tff(f_357,axiom,
! [VAR_V_163] :
( pred_attacker(VAR_V_163)
=> pred_attacker(tuple_client_B_in_2(VAR_V_163)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax123) ).
tff(f_315,axiom,
! [VAR_V_126] :
( pred_attacker(tuple_client_B_out_6(VAR_V_126))
=> pred_attacker(VAR_V_126) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax113) ).
tff(c_338,plain,
~ pred_attacker(name_objective),
inference(cnfTransformation,[status(thm)],[f_529]) ).
tff(c_174,plain,
! [VAR_X_35_17,VAR_Y_36_18] : pred_eq_bitstring_bitstring(VAR_X_35_17,VAR_Y_36_18),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_332,plain,
! [VAR_SIGN_A_PKA_548_110,VAR_AENC_NA_A_547_108,VAR_AENC_NB_546_109,VAR_0X40SID_545_107] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548_110))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_548_110,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547_108))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_547_108,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_546_109))
| ~ pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_545_107),constr_adec(VAR_AENC_NB_546_109,name_skB)) ),
inference(cnfTransformation,[status(thm)],[f_511]) ).
tff(c_342,plain,
! [VAR_SIGN_A_PKA_548_110,VAR_AENC_NA_A_547_108,VAR_AENC_NB_546_109] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548_110))
| ~ pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547_108))
| ~ pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_546_109)) ),
inference(demodulation,[status(thm),theory(equality)],[c_174,c_174,c_174,c_332]) ).
tff(c_646,plain,
! [VAR_AENC_NB_546_109] : ~ pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_546_109)),
inference(splitLeft,[status(thm)],[c_342]) ).
tff(c_240,plain,
! [VAR_V_151_61] :
( pred_attacker(tuple_client_B_in_5(VAR_V_151_61))
| ~ pred_attacker(VAR_V_151_61) ),
inference(cnfTransformation,[status(thm)],[f_341]) ).
tff(c_647,plain,
! [VAR_V_151_61] : ~ pred_attacker(VAR_V_151_61),
inference(negUnitSimplification,[status(thm)],[c_646,c_240]) ).
tff(c_316,plain,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
inference(cnfTransformation,[status(thm)],[f_467]) ).
tff(c_497,plain,
! [VAR_V_71_161] :
( pred_attacker(VAR_V_71_161)
| ~ pred_attacker(tuple_out_1(VAR_V_71_161)) ),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_505,plain,
pred_attacker(constr_pkey(name_skA)),
inference(resolution,[status(thm)],[c_316,c_497]) ).
tff(c_724,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_647,c_505]) ).
tff(c_725,plain,
! [VAR_SIGN_A_PKA_548_110,VAR_AENC_NA_A_547_108] :
( ~ pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548_110))
| ~ pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547_108))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(splitRight,[status(thm)],[c_342]) ).
tff(c_726,plain,
! [VAR_AENC_NA_A_547_108] : ~ pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547_108)),
inference(splitLeft,[status(thm)],[c_725]) ).
tff(c_244,plain,
! [VAR_V_157_63] :
( pred_attacker(tuple_client_B_in_3(VAR_V_157_63))
| ~ pred_attacker(VAR_V_157_63) ),
inference(cnfTransformation,[status(thm)],[f_349]) ).
tff(c_727,plain,
! [VAR_V_157_63] : ~ pred_attacker(VAR_V_157_63),
inference(negUnitSimplification,[status(thm)],[c_726,c_244]) ).
tff(c_809,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_727,c_505]) ).
tff(c_810,plain,
! [VAR_SIGN_A_PKA_548_110] :
( ~ pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548_110))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(splitRight,[status(thm)],[c_725]) ).
tff(c_811,plain,
! [VAR_SIGN_A_PKA_548_110] : ~ pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548_110)),
inference(splitLeft,[status(thm)],[c_810]) ).
tff(c_248,plain,
! [VAR_V_163_65] :
( pred_attacker(tuple_client_B_in_2(VAR_V_163_65))
| ~ pred_attacker(VAR_V_163_65) ),
inference(cnfTransformation,[status(thm)],[f_357]) ).
tff(c_812,plain,
! [VAR_V_163_65] : ~ pred_attacker(VAR_V_163_65),
inference(negUnitSimplification,[status(thm)],[c_811,c_248]) ).
tff(c_889,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_812,c_505]) ).
tff(c_890,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(splitRight,[status(thm)],[c_810]) ).
tff(c_228,plain,
! [VAR_V_126_52] :
( pred_attacker(VAR_V_126_52)
| ~ pred_attacker(tuple_client_B_out_6(VAR_V_126_52)) ),
inference(cnfTransformation,[status(thm)],[f_315]) ).
tff(c_893,plain,
pred_attacker(name_objective),
inference(resolution,[status(thm)],[c_890,c_228]) ).
tff(c_897,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_338,c_893]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWW959+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.10 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.30 % Computer : n011.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Thu Aug 3 19:32:36 EDT 2023
% 0.09/0.30 % CPUTime :
% 6.22/2.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.22/2.46
% 6.22/2.46 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.22/2.49
% 6.22/2.49 Inference rules
% 6.22/2.49 ----------------------
% 6.22/2.49 #Ref : 0
% 6.22/2.49 #Sup : 60
% 6.22/2.49 #Fact : 0
% 6.22/2.49 #Define : 0
% 6.22/2.49 #Split : 3
% 6.22/2.49 #Chain : 0
% 6.22/2.49 #Close : 0
% 6.22/2.49
% 6.22/2.49 Ordering : KBO
% 6.22/2.49
% 6.22/2.49 Simplification rules
% 6.22/2.49 ----------------------
% 6.22/2.49 #Subsume : 186
% 6.22/2.49 #Demod : 12
% 6.22/2.49 #Tautology : 47
% 6.22/2.49 #SimpNegUnit : 230
% 6.22/2.49 #BackRed : 63
% 6.22/2.49
% 6.22/2.49 #Partial instantiations: 0
% 6.22/2.49 #Strategies tried : 1
% 6.22/2.49
% 6.22/2.49 Timing (in seconds)
% 6.22/2.49 ----------------------
% 6.22/2.49 Preprocessing : 0.69
% 6.22/2.49 Parsing : 0.37
% 6.22/2.49 CNF conversion : 0.05
% 6.22/2.49 Main loop : 0.67
% 6.22/2.49 Inferencing : 0.21
% 6.22/2.49 Reduction : 0.22
% 6.22/2.49 Demodulation : 0.14
% 6.22/2.50 BG Simplification : 0.04
% 6.22/2.50 Subsumption : 0.14
% 6.22/2.50 Abstraction : 0.02
% 6.22/2.50 MUC search : 0.00
% 6.22/2.50 Cooper : 0.00
% 6.22/2.50 Total : 1.41
% 6.22/2.50 Index Insertion : 0.00
% 6.22/2.50 Index Deletion : 0.00
% 6.22/2.50 Index Matching : 0.00
% 6.22/2.50 BG Taut test : 0.00
%------------------------------------------------------------------------------