TSTP Solution File: SWW961+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW961+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 : n013.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:25 EDT 2023
% Result : Theorem 7.00s 2.63s
% Output : CNFRefutation 7.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 64
% Syntax : Number of formulae : 78 ( 16 unt; 57 typ; 0 def)
% Number of atoms : 26 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 58 ( 42 >; 16 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 52 ( 52 usr; 15 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 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_assoc_pair > 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_0x30 > constr_pkey > constr_getmess > constr_assoc_pair_2_get_1_bitstring > constr_assoc_pair_2_get_1 > constr_assoc_pair_2_get_0x30_bitstring > constr_assoc_pair_2_get_0x30 > 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_assoc_pair,type,
tuple_assoc_pair: ( $i * $i ) > $i ).
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(name_B,type,
name_B: $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(constr_assoc_pair_2_get_1_bitstring,type,
constr_assoc_pair_2_get_1_bitstring: $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_assoc_pair_2_get_0x30_bitstring,type,
constr_assoc_pair_2_get_0x30_bitstring: $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(constr_assoc_pair_2_get_1,type,
constr_assoc_pair_2_get_1: $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(constr_assoc_pair_2_get_0x30,type,
constr_assoc_pair_2_get_0x30: $i > $i ).
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_561,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
tff(f_205,axiom,
! [VAR_X0X30_9,VAR_X1_10X30] : ( constr_assoc_pair_2_get_0x30(tuple_assoc_pair(VAR_X0X30_9,VAR_X1_10X30)) = VAR_X0X30_9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax86) ).
tff(f_197,axiom,
! [VAR_X_17,VAR_Y_18,VAR_Z_0X30] : ( tuple_assoc_pair(VAR_X_17,tuple_assoc_pair(VAR_Y_18,VAR_Z_0X30)) = tuple_assoc_pair(tuple_assoc_pair(VAR_X_17,VAR_Y_18),VAR_Z_0X30) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
tff(f_199,axiom,
! [VAR_X0X30_15,VAR_X1_16] : ( constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(VAR_X0X30_15,VAR_X1_16)) = VAR_X1_16 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
tff(f_417,axiom,
! [VAR_V_215] :
( pred_attacker(VAR_V_215)
=> pred_attacker(constr_assoc_pair_2_get_1_bitstring(VAR_V_215)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax138) ).
tff(f_498,axiom,
pred_attacker(tuple_out_2(constr_pkey(name_skB))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax166) ).
tff(f_246,axiom,
! [VAR_V_67] :
( pred_attacker(tuple_out_2(VAR_V_67))
=> pred_attacker(VAR_V_67) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax98) ).
tff(c_354,plain,
~ pred_attacker(name_objective),
inference(cnfTransformation,[status(thm)],[f_561]) ).
tff(c_174,plain,
! [VAR_X0X30_9_18,VAR_X1_10X30_19] : ( constr_assoc_pair_2_get_0x30(tuple_assoc_pair(VAR_X0X30_9_18,VAR_X1_10X30_19)) = VAR_X0X30_9_18 ),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_698,plain,
! [VAR_X_17_247,VAR_Y_18_248,VAR_Z_0X30_249] : ( tuple_assoc_pair(tuple_assoc_pair(VAR_X_17_247,VAR_Y_18_248),VAR_Z_0X30_249) = tuple_assoc_pair(VAR_X_17_247,tuple_assoc_pair(VAR_Y_18_248,VAR_Z_0X30_249)) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_716,plain,
! [VAR_X_17_247,VAR_Y_18_248,VAR_Z_0X30_249] : ( constr_assoc_pair_2_get_0x30(tuple_assoc_pair(VAR_X_17_247,tuple_assoc_pair(VAR_Y_18_248,VAR_Z_0X30_249))) = tuple_assoc_pair(VAR_X_17_247,VAR_Y_18_248) ),
inference(superposition,[status(thm),theory(equality)],[c_698,c_174]) ).
tff(c_734,plain,
! [VAR_X_17_247,VAR_Y_18_248] : ( tuple_assoc_pair(VAR_X_17_247,VAR_Y_18_248) = VAR_X_17_247 ),
inference(demodulation,[status(thm),theory(equality)],[c_174,c_716]) ).
tff(c_168,plain,
! [VAR_X0X30_15_12,VAR_X1_16_13] : ( constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(VAR_X0X30_15_12,VAR_X1_16_13)) = VAR_X1_16_13 ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_1237,plain,
! [VAR_X0X30_15_254] : ( constr_assoc_pair_2_get_1_bitstring(VAR_X0X30_15_254) = name_objective ),
inference(demodulation,[status(thm),theory(equality)],[c_734,c_168]) ).
tff(c_278,plain,
! [VAR_V_215_88] :
( pred_attacker(constr_assoc_pair_2_get_1_bitstring(VAR_V_215_88))
| ~ pred_attacker(VAR_V_215_88) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_1240,plain,
! [VAR_X0X30_15_254] :
( pred_attacker(name_objective)
| ~ pred_attacker(VAR_X0X30_15_254) ),
inference(superposition,[status(thm),theory(equality)],[c_1237,c_278]) ).
tff(c_1708,plain,
! [VAR_X0X30_15_254] : ~ pred_attacker(VAR_X0X30_15_254),
inference(negUnitSimplification,[status(thm)],[c_354,c_1240]) ).
tff(c_334,plain,
pred_attacker(tuple_out_2(constr_pkey(name_skB))),
inference(cnfTransformation,[status(thm)],[f_498]) ).
tff(c_496,plain,
! [VAR_V_67_173] :
( pred_attacker(VAR_V_67_173)
| ~ pred_attacker(tuple_out_2(VAR_V_67_173)) ),
inference(cnfTransformation,[status(thm)],[f_246]) ).
tff(c_504,plain,
pred_attacker(constr_pkey(name_skB)),
inference(resolution,[status(thm)],[c_334,c_496]) ).
tff(c_1800,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1708,c_504]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWW961+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 19:07:18 EDT 2023
% 0.15/0.37 % CPUTime :
% 7.00/2.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.00/2.64
% 7.00/2.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.00/2.66
% 7.00/2.66 Inference rules
% 7.00/2.66 ----------------------
% 7.00/2.66 #Ref : 0
% 7.00/2.66 #Sup : 329
% 7.00/2.66 #Fact : 0
% 7.00/2.66 #Define : 0
% 7.00/2.66 #Split : 1
% 7.00/2.66 #Chain : 0
% 7.00/2.66 #Close : 0
% 7.00/2.66
% 7.00/2.66 Ordering : KBO
% 7.00/2.66
% 7.00/2.66 Simplification rules
% 7.00/2.66 ----------------------
% 7.00/2.66 #Subsume : 139
% 7.00/2.66 #Demod : 47
% 7.00/2.66 #Tautology : 77
% 7.00/2.66 #SimpNegUnit : 156
% 7.00/2.66 #BackRed : 46
% 7.00/2.66
% 7.00/2.66 #Partial instantiations: 8944
% 7.00/2.66 #Strategies tried : 1
% 7.00/2.66
% 7.00/2.66 Timing (in seconds)
% 7.00/2.66 ----------------------
% 7.00/2.67 Preprocessing : 0.70
% 7.00/2.67 Parsing : 0.37
% 7.00/2.67 CNF conversion : 0.05
% 7.00/2.67 Main loop : 0.82
% 7.00/2.67 Inferencing : 0.32
% 7.00/2.67 Reduction : 0.24
% 7.00/2.67 Demodulation : 0.15
% 7.00/2.67 BG Simplification : 0.05
% 7.00/2.67 Subsumption : 0.15
% 7.00/2.67 Abstraction : 0.02
% 7.00/2.67 MUC search : 0.00
% 7.00/2.67 Cooper : 0.00
% 7.00/2.67 Total : 1.57
% 7.00/2.67 Index Insertion : 0.00
% 7.00/2.67 Index Deletion : 0.00
% 7.00/2.67 Index Matching : 0.00
% 7.00/2.67 BG Taut test : 0.00
%------------------------------------------------------------------------------