TSTP Solution File: SWW962+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWW962+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 : n025.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 8.52s 2.98s
% Output   : CNFRefutation 8.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   66
% Syntax   : Number of formulae    :   92 (  31 unt;  58 typ;   0 def)
%            Number of atoms       :   39 (  19 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   15 (  10   ~;   3   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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    :   53 (  53 usr;  16 con; 0-2 aty)
%            Number of variables   :   44 (;  44   !;   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 > #skF_1

%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('#skF_1',type,
    '#skF_1': $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_488,axiom,
    pred_attacker(name_c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax157) ).

tff(f_206,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/sandbox/benchmark/theBenchmark.p',ax86) ).

tff(f_198,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/sandbox/benchmark/theBenchmark.p',ax82) ).

tff(f_200,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/sandbox/benchmark/theBenchmark.p',ax83) ).

tff(f_459,axiom,
    pred_attacker(constr_CONST_2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax149) ).

tff(f_202,axiom,
    ! [VAR_X0X30_13,VAR_X1_14] : ( constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(VAR_X0X30_13,VAR_X1_14)) = VAR_X0X30_13 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).

tff(f_467,axiom,
    ! [VAR_V_253,VAR_V_254] :
      ( ( pred_attacker(VAR_V_253)
        & pred_attacker(VAR_V_254) )
     => pred_attacker(tuple_2(VAR_V_253,VAR_V_254)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax152) ).

tff(f_563,negated_conjecture,
    ~ ! [VAR_V_711] : pred_attacker(tuple_2(name_Nb(VAR_V_711),name_objective)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).

tff(c_316,plain,
    pred_attacker(name_c),
    inference(cnfTransformation,[status(thm)],[f_488]) ).

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_206]) ).

tff(c_2225,plain,
    ! [VAR_X_17_17839,VAR_Y_18_17840,VAR_Z_0X30_17841] : ( tuple_assoc_pair(tuple_assoc_pair(VAR_X_17_17839,VAR_Y_18_17840),VAR_Z_0X30_17841) = tuple_assoc_pair(VAR_X_17_17839,tuple_assoc_pair(VAR_Y_18_17840,VAR_Z_0X30_17841)) ),
    inference(cnfTransformation,[status(thm)],[f_198]) ).

tff(c_2243,plain,
    ! [VAR_X_17_17839,VAR_Y_18_17840,VAR_Z_0X30_17841] : ( constr_assoc_pair_2_get_0x30(tuple_assoc_pair(VAR_X_17_17839,tuple_assoc_pair(VAR_Y_18_17840,VAR_Z_0X30_17841))) = tuple_assoc_pair(VAR_X_17_17839,VAR_Y_18_17840) ),
    inference(superposition,[status(thm),theory(equality)],[c_2225,c_174]) ).

tff(c_2261,plain,
    ! [VAR_X_17_17839,VAR_Y_18_17840] : ( tuple_assoc_pair(VAR_X_17_17839,VAR_Y_18_17840) = VAR_X_17_17839 ),
    inference(demodulation,[status(thm),theory(equality)],[c_174,c_2243]) ).

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_200]) ).

tff(c_2306,plain,
    ! [VAR_X0X30_15_17848] : ( constr_assoc_pair_2_get_1_bitstring(VAR_X0X30_15_17848) = name_c ),
    inference(demodulation,[status(thm),theory(equality)],[c_2261,c_168]) ).

tff(c_2270,plain,
    ! [VAR_X0X30_15_12,VAR_X1_16_13] : ( constr_assoc_pair_2_get_1_bitstring(VAR_X0X30_15_12) = VAR_X1_16_13 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2261,c_168]) ).

tff(c_3201,plain,
    ! [VAR_X1_16_26600] : ( name_c = VAR_X1_16_26600 ),
    inference(superposition,[status(thm),theory(equality)],[c_2306,c_2270]) ).

tff(c_300,plain,
    pred_attacker(constr_CONST_2),
    inference(cnfTransformation,[status(thm)],[f_459]) ).

tff(c_170,plain,
    ! [VAR_X0X30_13_14,VAR_X1_14_15] : ( constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(VAR_X0X30_13_14,VAR_X1_14_15)) = VAR_X0X30_13_14 ),
    inference(cnfTransformation,[status(thm)],[f_202]) ).

tff(c_703,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_198]) ).

tff(c_727,plain,
    ! [VAR_X_17_247,VAR_Y_18_248,VAR_Z_0X30_249] : ( constr_assoc_pair_2_get_0x30_bitstring(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_703,c_170]) ).

tff(c_740,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_170,c_727]) ).

tff(c_873,plain,
    ! [VAR_X0X30_15_257] : ( constr_assoc_pair_2_get_1_bitstring(VAR_X0X30_15_257) = constr_CONST_2 ),
    inference(demodulation,[status(thm),theory(equality)],[c_740,c_168]) ).

tff(c_833,plain,
    ! [VAR_X0X30_15_12,VAR_X1_16_13] : ( constr_assoc_pair_2_get_1_bitstring(VAR_X0X30_15_12) = VAR_X1_16_13 ),
    inference(demodulation,[status(thm),theory(equality)],[c_740,c_168]) ).

tff(c_1763,plain,
    ! [VAR_X1_16_9026] : ( constr_CONST_2 = VAR_X1_16_9026 ),
    inference(superposition,[status(thm),theory(equality)],[c_873,c_833]) ).

tff(c_654,plain,
    ! [VAR_V_253_231,VAR_V_254_232] :
      ( pred_attacker(tuple_2(VAR_V_253_231,VAR_V_254_232))
      | ~ pred_attacker(VAR_V_254_232)
      | ~ pred_attacker(VAR_V_253_231) ),
    inference(cnfTransformation,[status(thm)],[f_467]) ).

tff(c_354,plain,
    ~ pred_attacker(tuple_2(name_Nb('#skF_1'),name_objective)),
    inference(cnfTransformation,[status(thm)],[f_563]) ).

tff(c_666,plain,
    ( ~ pred_attacker(name_objective)
    | ~ pred_attacker(name_Nb('#skF_1')) ),
    inference(resolution,[status(thm)],[c_654,c_354]) ).

tff(c_668,plain,
    ~ pred_attacker(name_Nb('#skF_1')),
    inference(splitLeft,[status(thm)],[c_666]) ).

tff(c_1796,plain,
    ~ pred_attacker(constr_CONST_2),
    inference(superposition,[status(thm),theory(equality)],[c_1763,c_668]) ).

tff(c_2188,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_300,c_1796]) ).

tff(c_2189,plain,
    ~ pred_attacker(name_objective),
    inference(splitRight,[status(thm)],[c_666]) ).

tff(c_3254,plain,
    ~ pred_attacker(name_c),
    inference(superposition,[status(thm),theory(equality)],[c_3201,c_2189]) ).

tff(c_3599,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_316,c_3254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWW962+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.14  % 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.14/0.36  % Computer : n025.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 19:43:49 EDT 2023
% 0.14/0.37  % CPUTime  : 
% 8.52/2.98  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.52/2.99  
% 8.52/2.99  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.52/3.02  
% 8.52/3.02  Inference rules
% 8.52/3.02  ----------------------
% 8.52/3.02  #Ref     : 0
% 8.52/3.02  #Sup     : 1006
% 8.52/3.02  #Fact    : 0
% 8.52/3.02  #Define  : 0
% 8.52/3.02  #Split   : 2
% 8.52/3.02  #Chain   : 0
% 8.52/3.02  #Close   : 0
% 8.52/3.02  
% 8.52/3.02  Ordering : KBO
% 8.52/3.02  
% 8.52/3.02  Simplification rules
% 8.52/3.02  ----------------------
% 8.52/3.02  #Subsume      : 107
% 8.52/3.02  #Demod        : 98
% 8.52/3.02  #Tautology    : 120
% 8.52/3.02  #SimpNegUnit  : 82
% 8.52/3.02  #BackRed      : 31
% 8.52/3.02  
% 8.52/3.02  #Partial instantiations: 20712
% 8.52/3.02  #Strategies tried      : 1
% 8.52/3.02  
% 8.52/3.02  Timing (in seconds)
% 8.52/3.02  ----------------------
% 8.52/3.02  Preprocessing        : 0.75
% 8.52/3.02  Parsing              : 0.40
% 8.52/3.02  CNF conversion       : 0.06
% 8.52/3.03  Main loop            : 1.21
% 8.52/3.03  Inferencing          : 0.58
% 8.52/3.03  Reduction            : 0.31
% 8.52/3.03  Demodulation         : 0.20
% 8.52/3.03  BG Simplification    : 0.05
% 8.52/3.03  Subsumption          : 0.17
% 8.52/3.03  Abstraction          : 0.03
% 8.52/3.03  MUC search           : 0.00
% 8.52/3.03  Cooper               : 0.00
% 8.52/3.03  Total                : 2.01
% 8.52/3.03  Index Insertion      : 0.00
% 8.52/3.03  Index Deletion       : 0.00
% 8.52/3.03  Index Matching       : 0.00
% 8.52/3.03  BG Taut test         : 0.00
%------------------------------------------------------------------------------