TSTP Solution File: SWW970+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW970+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n015.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:26 EDT 2023
% Result : Theorem 5.58s 2.19s
% Output : CNFRefutation 5.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 52
% Syntax : Number of formulae : 65 ( 12 unt; 46 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 5 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 56 ( 32 >; 24 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 14 con; 0-5 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pred_mess > pred_equal > pred_eq_bitstring_bitstring > pred_attacker > constr_cbc_enc_4 > tuple_4 > constr_cbc_enc_3 > tuple_3 > constr_cbc_enc_2 > tuple_server_S_in_1 > tuple_2 > constr_cbc_enc_1 > constr_cbc_dec_4 > constr_cbc_dec_3 > constr_cbc_dec_2 > constr_cbc_dec_1 > #nlpp > tuple_server_S_out_3 > tuple_server_S_out_2 > tuple_client_B_out_2 > tuple_client_B_in_1 > name_new0x2Dname > name_T_55 > name_Kab_54 > constr_tuple_3_get_2_bitstring > constr_tuple_3_get_1_bitstring > constr_tuple_3_get_0x30 > constr_cbc_4_get_3_prefixes > constr_cbc_4_get_2_prefixes > constr_cbc_4_get_1_prefixes > constr_cbc_3_get_2_prefixes > constr_cbc_3_get_1_prefixes > constr_cbc_2_get_1_prefixes > tuple_true > tuple_false > name_objective > name_c > name_Kbs > name_Kas > 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_server_S_out_2,type,
tuple_server_S_out_2: $i > $i ).
tff(name_I,type,
name_I: $i ).
tff(pred_mess,type,
pred_mess: ( $i * $i ) > $o ).
tff(name_c,type,
name_c: $i ).
tff(pred_equal,type,
pred_equal: ( $i * $i ) > $o ).
tff(name_objective,type,
name_objective: $i ).
tff(constr_tuple_3_get_1_bitstring,type,
constr_tuple_3_get_1_bitstring: $i > $i ).
tff(constr_cbc_4_get_2_prefixes,type,
constr_cbc_4_get_2_prefixes: $i > $i ).
tff(constr_cbc_4_get_3_prefixes,type,
constr_cbc_4_get_3_prefixes: $i > $i ).
tff(constr_cbc_dec_3,type,
constr_cbc_dec_3: ( $i * $i ) > $i ).
tff(constr_CONST_2,type,
constr_CONST_2: $i ).
tff(constr_cbc_dec_4,type,
constr_cbc_dec_4: ( $i * $i ) > $i ).
tff(constr_cbc_enc_1,type,
constr_cbc_enc_1: ( $i * $i ) > $i ).
tff(tuple_client_B_out_2,type,
tuple_client_B_out_2: $i > $i ).
tff(name_A,type,
name_A: $i ).
tff(name_T_55,type,
name_T_55: $i > $i ).
tff(pred_attacker,type,
pred_attacker: $i > $o ).
tff(tuple_false,type,
tuple_false: $i ).
tff(constr_tuple_3_get_0x30,type,
constr_tuple_3_get_0x30: $i > $i ).
tff(name_Kab_54,type,
name_Kab_54: $i > $i ).
tff(tuple_server_S_in_1,type,
tuple_server_S_in_1: ( $i * $i ) > $i ).
tff(constr_cbc_dec_1,type,
constr_cbc_dec_1: ( $i * $i ) > $i ).
tff(name_B,type,
name_B: $i ).
tff(constr_tuple_3_get_2_bitstring,type,
constr_tuple_3_get_2_bitstring: $i > $i ).
tff(name_Kas,type,
name_Kas: $i ).
tff(constr_CONST_4,type,
constr_CONST_4: $i ).
tff(constr_cbc_enc_4,type,
constr_cbc_enc_4: ( $i * $i * $i * $i * $i ) > $i ).
tff(constr_cbc_3_get_1_prefixes,type,
constr_cbc_3_get_1_prefixes: $i > $i ).
tff(constr_cbc_enc_3,type,
constr_cbc_enc_3: ( $i * $i * $i * $i ) > $i ).
tff(constr_cbc_dec_2,type,
constr_cbc_dec_2: ( $i * $i ) > $i ).
tff(constr_cbc_4_get_1_prefixes,type,
constr_cbc_4_get_1_prefixes: $i > $i ).
tff(tuple_2,type,
tuple_2: ( $i * $i ) > $i ).
tff(tuple_client_B_in_1,type,
tuple_client_B_in_1: $i > $i ).
tff(constr_cbc_2_get_1_prefixes,type,
constr_cbc_2_get_1_prefixes: $i > $i ).
tff(constr_CONST_0x30,type,
constr_CONST_0x30: $i ).
tff(name_Kbs,type,
name_Kbs: $i ).
tff(constr_cbc_3_get_2_prefixes,type,
constr_cbc_3_get_2_prefixes: $i > $i ).
tff(tuple_server_S_out_3,type,
tuple_server_S_out_3: $i > $i ).
tff(constr_CONST_3,type,
constr_CONST_3: $i ).
tff(constr_CONST_1,type,
constr_CONST_1: $i ).
tff(constr_cbc_enc_2,type,
constr_cbc_enc_2: ( $i * $i * $i ) > $i ).
tff(name_new0x2Dname,type,
name_new0x2Dname: $i > $i ).
tff(pred_eq_bitstring_bitstring,type,
pred_eq_bitstring_bitstring: ( $i * $i ) > $o ).
tff(tuple_3,type,
tuple_3: ( $i * $i * $i ) > $i ).
tff(tuple_4,type,
tuple_4: ( $i * $i * $i * $i ) > $i ).
tff(tuple_true,type,
tuple_true: $i ).
tff(f_433,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
tff(f_188,axiom,
! [VAR_X_67,VAR_Y_68] : pred_eq_bitstring_bitstring(VAR_X_67,VAR_Y_68),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
tff(f_423,axiom,
! [VAR_ENC_A_KAB_T_330X30] :
( ( pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(VAR_ENC_A_KAB_T_330X30,name_Kbs)))
& pred_attacker(tuple_client_B_in_1(VAR_ENC_A_KAB_T_330X30)) )
=> pred_attacker(tuple_client_B_out_2(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax135) ).
tff(f_244,axiom,
! [VAR_V_115] :
( pred_attacker(VAR_V_115)
=> pred_attacker(tuple_client_B_in_1(VAR_V_115)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax94) ).
tff(f_417,axiom,
! [VAR_V_280X30] : pred_attacker(name_new0x2Dname(VAR_V_280X30)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax134) ).
tff(f_240,axiom,
! [VAR_V_112] :
( pred_attacker(tuple_client_B_out_2(VAR_V_112))
=> pred_attacker(VAR_V_112) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
tff(c_278,plain,
~ pred_attacker(name_objective),
inference(cnfTransformation,[status(thm)],[f_433]) ).
tff(c_160,plain,
! [VAR_X_67_50,VAR_Y_68_51] : pred_eq_bitstring_bitstring(VAR_X_67_50,VAR_Y_68_51),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_272,plain,
! [VAR_ENC_A_KAB_T_330X30_141] :
( pred_attacker(tuple_client_B_out_2(name_objective))
| ~ pred_attacker(tuple_client_B_in_1(VAR_ENC_A_KAB_T_330X30_141))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(VAR_ENC_A_KAB_T_330X30_141,name_Kbs))) ),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_280,plain,
! [VAR_ENC_A_KAB_T_330X30_141] :
( pred_attacker(tuple_client_B_out_2(name_objective))
| ~ pred_attacker(tuple_client_B_in_1(VAR_ENC_A_KAB_T_330X30_141)) ),
inference(demodulation,[status(thm),theory(equality)],[c_160,c_272]) ).
tff(c_366,plain,
! [VAR_ENC_A_KAB_T_330X30_141] : ~ pred_attacker(tuple_client_B_in_1(VAR_ENC_A_KAB_T_330X30_141)),
inference(splitLeft,[status(thm)],[c_280]) ).
tff(c_190,plain,
! [VAR_V_115_67] :
( pred_attacker(tuple_client_B_in_1(VAR_V_115_67))
| ~ pred_attacker(VAR_V_115_67) ),
inference(cnfTransformation,[status(thm)],[f_244]) ).
tff(c_367,plain,
! [VAR_V_115_67] : ~ pred_attacker(VAR_V_115_67),
inference(negUnitSimplification,[status(thm)],[c_366,c_190]) ).
tff(c_270,plain,
! [VAR_V_280X30_140] : pred_attacker(name_new0x2Dname(VAR_V_280X30_140)),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_400,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_367,c_270]) ).
tff(c_401,plain,
pred_attacker(tuple_client_B_out_2(name_objective)),
inference(splitRight,[status(thm)],[c_280]) ).
tff(c_188,plain,
! [VAR_V_112_66] :
( pred_attacker(VAR_V_112_66)
| ~ pred_attacker(tuple_client_B_out_2(VAR_V_112_66)) ),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_405,plain,
pred_attacker(name_objective),
inference(resolution,[status(thm)],[c_401,c_188]) ).
tff(c_409,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_278,c_405]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW970+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n015.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.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 19:45:14 EDT 2023
% 0.13/0.35 % CPUTime :
% 5.58/2.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.58/2.20
% 5.58/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.79/2.24
% 5.79/2.24 Inference rules
% 5.79/2.24 ----------------------
% 5.79/2.24 #Ref : 0
% 5.79/2.24 #Sup : 16
% 5.79/2.24 #Fact : 0
% 5.79/2.24 #Define : 0
% 5.79/2.24 #Split : 1
% 5.79/2.24 #Chain : 0
% 5.79/2.24 #Close : 0
% 5.79/2.24
% 5.79/2.24 Ordering : KBO
% 5.79/2.24
% 5.79/2.24 Simplification rules
% 5.79/2.24 ----------------------
% 5.79/2.24 #Subsume : 22
% 5.79/2.24 #Demod : 1
% 5.79/2.24 #Tautology : 12
% 5.79/2.24 #SimpNegUnit : 33
% 5.79/2.24 #BackRed : 13
% 5.79/2.24
% 5.79/2.24 #Partial instantiations: 0
% 5.79/2.24 #Strategies tried : 1
% 5.79/2.24
% 5.79/2.24 Timing (in seconds)
% 5.79/2.24 ----------------------
% 5.79/2.24 Preprocessing : 0.68
% 5.79/2.24 Parsing : 0.36
% 5.79/2.24 CNF conversion : 0.05
% 5.79/2.24 Main loop : 0.49
% 5.79/2.24 Inferencing : 0.15
% 5.79/2.24 Reduction : 0.16
% 5.79/2.24 Demodulation : 0.11
% 5.79/2.24 BG Simplification : 0.04
% 5.79/2.24 Subsumption : 0.10
% 5.79/2.24 Abstraction : 0.01
% 5.79/2.24 MUC search : 0.00
% 5.79/2.24 Cooper : 0.00
% 5.79/2.24 Total : 1.24
% 5.79/2.24 Index Insertion : 0.00
% 5.79/2.24 Index Deletion : 0.00
% 5.79/2.24 Index Matching : 0.00
% 5.79/2.24 BG Taut test : 0.00
%------------------------------------------------------------------------------