TSTP Solution File: SWW966+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWW966+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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  : 600s
% DateTime : Thu Jul 21 00:11:46 EDT 2022

% Result   : Theorem 0.25s 2.44s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   31
% Syntax   : Number of formulae    :  130 (  36 unt;   0 def)
%            Number of atoms       :  310 (  28 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  323 ( 143   ~; 142   |;  18   &)
%                                         (   0 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   34 (  34 usr;   8 con; 0-2 aty)
%            Number of variables   :  226 (  53 sgn  94   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax183,axiom,
    ! [X113,X114,X115] :
      ( ( pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X114,name_skB)))
        & pred_attacker(tuple_client_B_in_3(X114))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X115,constr_pkey(name_skS))))
        & pred_attacker(tuple_client_B_in_2(X115)) )
     => pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(X114,name_skB)),name_B),name_Nb(X113)),constr_tuple_2_get_1_bitstring(constr_checksign(X115,constr_pkey(name_skS)))))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax183) ).

fof(ax103,axiom,
    ! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax103) ).

fof(ax97,axiom,
    ! [X11,X12] : constr_xor(X11,X12) = constr_xor(X12,X11),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax97) ).

fof(ax185,axiom,
    ! [X120,X121,X122] :
      ( ( pred_table(tuple_keys(X120,X121))
        & pred_attacker(tuple_key_retrieval_server_in_1(X122,X120)) )
     => pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(X120,X121),name_skS))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax185) ).

fof(ax120,axiom,
    ! [X43,X44] :
      ( ( pred_attacker(X43)
        & pred_attacker(X44) )
     => pred_attacker(tuple_key_retrieval_server_in_1(X43,X44)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax120) ).

fof(ax94,axiom,
    ! [X7,X8] : constr_checksign(constr_sign(X8,X7),constr_pkey(X7)) = X8,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax94) ).

fof(ax173,axiom,
    ! [X107] : pred_attacker(name_new0x2Dname(X107)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax173) ).

fof(ax181,axiom,
    ! [X110,X111,X112] :
      ( ( pred_eq_bitstring_bitstring(name_I,constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(X111,name_skA)),name_Na(X110)))
        & pred_attacker(tuple_client_A_in_4(X111))
        & pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(X112,constr_pkey(name_skS))))
        & pred_attacker(tuple_client_A_in_2(X112)) )
     => pred_attacker(tuple_client_A_out_5(constr_aenc(constr_tuple_2_get_1_bitstring(constr_adec(X111,name_skA)),constr_tuple_2_get_1_bitstring(constr_checksign(X112,constr_pkey(name_skS)))))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax181) ).

fof(ax99,axiom,
    ! [X16,X17] : constr_tuple_2_get_1_bitstring(tuple_2(X16,X17)) = X17,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax99) ).

fof(ax119,axiom,
    ! [X42] :
      ( pred_attacker(tuple_key_retrieval_server_out_2(X42))
     => pred_attacker(X42) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax119) ).

fof(ax91,axiom,
    ! [X1,X2] : constr_adec(constr_aenc(X2,constr_pkey(X1)),X1) = X2,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax91) ).

fof(ax141,axiom,
    ! [X74] :
      ( pred_attacker(X74)
     => pred_attacker(tuple_client_B_in_2(X74)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax141) ).

fof(ax174,axiom,
    pred_table(tuple_keys(name_A,constr_pkey(name_skA))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax174) ).

fof(ax171,axiom,
    pred_attacker(name_A),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax171) ).

fof(ax150,axiom,
    ! [X86] :
      ( pred_attacker(X86)
     => pred_attacker(tuple_client_A_in_4(X86)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax150) ).

fof(ax133,axiom,
    ! [X63] :
      ( pred_attacker(tuple_client_B_out_4(X63))
     => pred_attacker(X63) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax133) ).

fof(ax139,axiom,
    ! [X72] :
      ( pred_attacker(X72)
     => pred_attacker(tuple_client_B_in_3(X72)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax139) ).

fof(ax184,axiom,
    ! [X116,X117,X118,X119] :
      ( ( pred_eq_bitstring_bitstring(name_Nb(X116),constr_adec(X118,name_skB))
        & pred_attacker(tuple_client_B_in_5(X118))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X117,name_skB)))
        & pred_attacker(tuple_client_B_in_3(X117))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X119,constr_pkey(name_skS))))
        & pred_attacker(tuple_client_B_in_2(X119)) )
     => pred_attacker(tuple_client_B_out_6(name_objective)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax184) ).

fof(ax137,axiom,
    ! [X70] :
      ( pred_attacker(X70)
     => pred_attacker(tuple_client_B_in_5(X70)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax137) ).

fof(ax144,axiom,
    ! [X77] :
      ( pred_attacker(tuple_client_A_out_5(X77))
     => pred_attacker(X77) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax144) ).

fof(ax152,axiom,
    ! [X88] :
      ( pred_attacker(X88)
     => pred_attacker(tuple_client_A_in_2(X88)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax152) ).

fof(ax186,axiom,
    ! [X123,X124] :
      ( ( X123 != name_B
        & X123 != name_A
        & pred_attacker(tuple_key_register_server_in_1(X123,X124)) )
     => pred_table(tuple_keys(X123,X124)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax186) ).

fof(ax124,axiom,
    ! [X51,X52] :
      ( pred_attacker(tuple_key_register_server_in_1(X51,X52))
     => pred_attacker(X51) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax124) ).

fof(ax123,axiom,
    ! [X49,X50] :
      ( ( pred_attacker(X49)
        & pred_attacker(X50) )
     => pred_attacker(tuple_key_register_server_in_1(X49,X50)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax123) ).

fof(ax131,axiom,
    ! [X61] :
      ( pred_attacker(tuple_client_B_out_6(X61))
     => pred_attacker(X61) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax131) ).

fof(co0,conjecture,
    ! [X125] : pred_attacker(tuple_2(name_Nb(X125),name_objective)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).

fof(ax156,axiom,
    ! [X94,X95] :
      ( ( pred_attacker(X94)
        & pred_attacker(X95) )
     => pred_attacker(constr_adec(X94,X95)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax156) ).

fof(ax163,axiom,
    ! [X96,X97] :
      ( ( pred_attacker(X96)
        & pred_attacker(X97) )
     => pred_attacker(tuple_2(X96,X97)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax163) ).

fof(ax66,axiom,
    name_A != name_objective,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax66) ).

fof(ax72,axiom,
    name_B != name_objective,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax72) ).

fof(ax111,axiom,
    ! [X34] :
      ( pred_attacker(X34)
     => pred_attacker(constr_pkey(X34)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax111) ).

fof(c_0_31,plain,
    ! [X116,X117,X118] :
      ( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X117,name_skB)))
      | ~ pred_attacker(tuple_client_B_in_3(X117))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X118,constr_pkey(name_skS))))
      | ~ pred_attacker(tuple_client_B_in_2(X118))
      | pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(X117,name_skB)),name_B),name_Nb(X116)),constr_tuple_2_get_1_bitstring(constr_checksign(X118,constr_pkey(name_skS)))))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax183])]) ).

fof(c_0_32,plain,
    ! [X26,X27] : pred_eq_bitstring_bitstring(X26,X27),
    inference(variable_rename,[status(thm)],[ax103]) ).

cnf(c_0_33,plain,
    ( pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB)),name_B),name_Nb(X2)),constr_tuple_2_get_1_bitstring(constr_checksign(X3,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_B_in_2(X3))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
    | ~ pred_attacker(tuple_client_B_in_3(X1))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB))) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_34,plain,
    pred_eq_bitstring_bitstring(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

fof(c_0_35,plain,
    ! [X13,X14] : constr_xor(X13,X14) = constr_xor(X14,X13),
    inference(variable_rename,[status(thm)],[ax97]) ).

fof(c_0_36,plain,
    ! [X123,X124,X125] :
      ( ~ pred_table(tuple_keys(X123,X124))
      | ~ pred_attacker(tuple_key_retrieval_server_in_1(X125,X123))
      | pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(X123,X124),name_skS))) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax185])])])]) ).

fof(c_0_37,plain,
    ! [X45,X46] :
      ( ~ pred_attacker(X45)
      | ~ pred_attacker(X46)
      | pred_attacker(tuple_key_retrieval_server_in_1(X45,X46)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax120])]) ).

cnf(c_0_38,plain,
    ( pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB)),name_B),name_Nb(X2)),constr_tuple_2_get_1_bitstring(constr_checksign(X3,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_B_in_3(X1))
    | ~ pred_attacker(tuple_client_B_in_2(X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34])]) ).

cnf(c_0_39,plain,
    constr_xor(X1,X2) = constr_xor(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

fof(c_0_40,plain,
    ! [X9,X10] : constr_checksign(constr_sign(X10,X9),constr_pkey(X9)) = X10,
    inference(variable_rename,[status(thm)],[ax94]) ).

cnf(c_0_41,plain,
    ( pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(X1,X2),name_skS)))
    | ~ pred_attacker(tuple_key_retrieval_server_in_1(X3,X1))
    | ~ pred_table(tuple_keys(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_42,plain,
    ( pred_attacker(tuple_key_retrieval_server_in_1(X1,X2))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

fof(c_0_43,plain,
    ! [X108] : pred_attacker(name_new0x2Dname(X108)),
    inference(variable_rename,[status(thm)],[ax173]) ).

fof(c_0_44,plain,
    ! [X113,X114,X115] :
      ( ~ pred_eq_bitstring_bitstring(name_I,constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(X114,name_skA)),name_Na(X113)))
      | ~ pred_attacker(tuple_client_A_in_4(X114))
      | ~ pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(X115,constr_pkey(name_skS))))
      | ~ pred_attacker(tuple_client_A_in_2(X115))
      | pred_attacker(tuple_client_A_out_5(constr_aenc(constr_tuple_2_get_1_bitstring(constr_adec(X114,name_skA)),constr_tuple_2_get_1_bitstring(constr_checksign(X115,constr_pkey(name_skS)))))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax181])]) ).

cnf(c_0_45,plain,
    ( pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(name_B,constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB))),name_Nb(X2)),constr_tuple_2_get_1_bitstring(constr_checksign(X3,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_B_in_3(X1))
    | ~ pred_attacker(tuple_client_B_in_2(X3)) ),
    inference(rw,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_46,plain,
    constr_checksign(constr_sign(X1,X2),constr_pkey(X2)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

fof(c_0_47,plain,
    ! [X18,X19] : constr_tuple_2_get_1_bitstring(tuple_2(X18,X19)) = X19,
    inference(variable_rename,[status(thm)],[ax99]) ).

fof(c_0_48,plain,
    ! [X43] :
      ( ~ pred_attacker(tuple_key_retrieval_server_out_2(X43))
      | pred_attacker(X43) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax119])]) ).

cnf(c_0_49,plain,
    ( pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(X1,X2),name_skS)))
    | ~ pred_table(tuple_keys(X1,X2))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_50,plain,
    pred_attacker(name_new0x2Dname(X1)),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_51,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(constr_tuple_2_get_1_bitstring(constr_adec(X1,name_skA)),constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_A_in_2(X2))
    | ~ pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(X2,constr_pkey(name_skS))))
    | ~ pred_attacker(tuple_client_A_in_4(X1))
    | ~ pred_eq_bitstring_bitstring(name_I,constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skA)),name_Na(X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

fof(c_0_52,plain,
    ! [X3,X4] : constr_adec(constr_aenc(X4,constr_pkey(X3)),X3) = X4,
    inference(variable_rename,[status(thm)],[ax91]) ).

cnf(c_0_53,plain,
    ( pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(name_B,constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB))),name_Nb(X2)),constr_tuple_2_get_1_bitstring(X3))))
    | ~ pred_attacker(tuple_client_B_in_2(constr_sign(X3,name_skS)))
    | ~ pred_attacker(tuple_client_B_in_3(X1)) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_54,plain,
    constr_tuple_2_get_1_bitstring(tuple_2(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

fof(c_0_55,plain,
    ! [X75] :
      ( ~ pred_attacker(X75)
      | pred_attacker(tuple_client_B_in_2(X75)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])]) ).

cnf(c_0_56,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_key_retrieval_server_out_2(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

cnf(c_0_57,plain,
    ( pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(X1,X2),name_skS)))
    | ~ pred_table(tuple_keys(X1,X2))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_58,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(constr_tuple_2_get_1_bitstring(constr_adec(X1,name_skA)),constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_A_in_4(X1))
    | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_34]),c_0_34])]) ).

cnf(c_0_59,plain,
    constr_adec(constr_aenc(X1,constr_pkey(X2)),X2) = X1,
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_60,plain,
    ( pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(name_B,constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB))),name_Nb(X2)),X3)))
    | ~ pred_attacker(tuple_client_B_in_2(constr_sign(tuple_2(X4,X3),name_skS)))
    | ~ pred_attacker(tuple_client_B_in_3(X1)) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_61,plain,
    ( pred_attacker(tuple_client_B_in_2(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_55]) ).

cnf(c_0_62,plain,
    ( pred_attacker(constr_sign(tuple_2(X1,X2),name_skS))
    | ~ pred_table(tuple_keys(X1,X2))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_63,plain,
    pred_table(tuple_keys(name_A,constr_pkey(name_skA))),
    inference(split_conjunct,[status(thm)],[ax174]) ).

cnf(c_0_64,plain,
    pred_attacker(name_A),
    inference(split_conjunct,[status(thm)],[ax171]) ).

cnf(c_0_65,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(constr_tuple_2_get_1_bitstring(X1),constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_A_in_4(constr_aenc(X1,constr_pkey(name_skA))))
    | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

fof(c_0_66,plain,
    ! [X87] :
      ( ~ pred_attacker(X87)
      | pred_attacker(tuple_client_A_in_4(X87)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax150])]) ).

fof(c_0_67,plain,
    ! [X64] :
      ( ~ pred_attacker(tuple_client_B_out_4(X64))
      | pred_attacker(X64) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax133])]) ).

cnf(c_0_68,plain,
    ( pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(name_B,constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB))),name_Nb(X2)),X3)))
    | ~ pred_attacker(constr_sign(tuple_2(X4,X3),name_skS))
    | ~ pred_attacker(tuple_client_B_in_3(X1)) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_69,plain,
    pred_attacker(constr_sign(tuple_2(name_A,constr_pkey(name_skA)),name_skS)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).

cnf(c_0_70,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(X1,constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_A_in_4(constr_aenc(tuple_2(X3,X1),constr_pkey(name_skA))))
    | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(spm,[status(thm)],[c_0_65,c_0_54]) ).

cnf(c_0_71,plain,
    ( pred_attacker(tuple_client_A_in_4(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_66]) ).

cnf(c_0_72,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_client_B_out_4(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_67]) ).

cnf(c_0_73,plain,
    ( pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(name_B,constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB))),name_Nb(X2)),constr_pkey(name_skA))))
    | ~ pred_attacker(tuple_client_B_in_3(X1)) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_74,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(X1,constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(constr_aenc(tuple_2(X3,X1),constr_pkey(name_skA)))
    | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]) ).

cnf(c_0_75,plain,
    ( pred_attacker(constr_aenc(tuple_2(constr_xor(name_B,constr_tuple_2_get_0x30_bitstring(constr_adec(X1,name_skB))),name_Nb(X2)),constr_pkey(name_skA)))
    | ~ pred_attacker(tuple_client_B_in_3(X1)) ),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

fof(c_0_76,plain,
    ! [X73] :
      ( ~ pred_attacker(X73)
      | pred_attacker(tuple_client_B_in_3(X73)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])]) ).

fof(c_0_77,plain,
    ! [X120,X121,X122,X123] :
      ( ~ pred_eq_bitstring_bitstring(name_Nb(X120),constr_adec(X122,name_skB))
      | ~ pred_attacker(tuple_client_B_in_5(X122))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X121,name_skB)))
      | ~ pred_attacker(tuple_client_B_in_3(X121))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X123,constr_pkey(name_skS))))
      | ~ pred_attacker(tuple_client_B_in_2(X123))
      | pred_attacker(tuple_client_B_out_6(name_objective)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax184])])])]) ).

cnf(c_0_78,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(name_Nb(X1),constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_A_in_2(X2))
    | ~ pred_attacker(tuple_client_B_in_3(X3)) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_79,plain,
    ( pred_attacker(tuple_client_B_in_3(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_76]) ).

cnf(c_0_80,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_2(X1))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X1,constr_pkey(name_skS))))
    | ~ pred_attacker(tuple_client_B_in_3(X2))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X2,name_skB)))
    | ~ pred_attacker(tuple_client_B_in_5(X3))
    | ~ pred_eq_bitstring_bitstring(name_Nb(X4),constr_adec(X3,name_skB)) ),
    inference(split_conjunct,[status(thm)],[c_0_77]) ).

fof(c_0_81,plain,
    ! [X71] :
      ( ~ pred_attacker(X71)
      | pred_attacker(tuple_client_B_in_5(X71)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax137])]) ).

cnf(c_0_82,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(name_Nb(X1),constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_A_in_2(X2))
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_78,c_0_79]) ).

cnf(c_0_83,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_5(X3))
    | ~ pred_attacker(tuple_client_B_in_3(X2))
    | ~ pred_attacker(tuple_client_B_in_2(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_34]),c_0_34]),c_0_34])]) ).

cnf(c_0_84,plain,
    ( pred_attacker(tuple_client_B_in_5(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_81]) ).

fof(c_0_85,plain,
    ! [X78] :
      ( ~ pred_attacker(tuple_client_A_out_5(X78))
      | pred_attacker(X78) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax144])]) ).

cnf(c_0_86,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(name_Nb(X1),constr_tuple_2_get_1_bitstring(constr_checksign(X2,constr_pkey(name_skS))))))
    | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(spm,[status(thm)],[c_0_82,c_0_50]) ).

cnf(c_0_87,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_3(X1))
    | ~ pred_attacker(tuple_client_B_in_2(X2))
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_88,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_client_A_out_5(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_85]) ).

cnf(c_0_89,plain,
    ( pred_attacker(tuple_client_A_out_5(constr_aenc(name_Nb(X1),constr_tuple_2_get_1_bitstring(X2))))
    | ~ pred_attacker(tuple_client_A_in_2(constr_sign(X2,name_skS))) ),
    inference(spm,[status(thm)],[c_0_86,c_0_46]) ).

cnf(c_0_90,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_2(X1))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_87,c_0_79]) ).

cnf(c_0_91,plain,
    ( pred_attacker(constr_aenc(name_Nb(X1),constr_tuple_2_get_1_bitstring(X2)))
    | ~ pred_attacker(tuple_client_A_in_2(constr_sign(X2,name_skS))) ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

fof(c_0_92,plain,
    ! [X89] :
      ( ~ pred_attacker(X89)
      | pred_attacker(tuple_client_A_in_2(X89)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax152])]) ).

fof(c_0_93,plain,
    ! [X125,X126] :
      ( X125 = name_B
      | X125 = name_A
      | ~ pred_attacker(tuple_key_register_server_in_1(X125,X126))
      | pred_table(tuple_keys(X125,X126)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax186])]) ).

fof(c_0_94,plain,
    ! [X53,X54] :
      ( ~ pred_attacker(tuple_key_register_server_in_1(X53,X54))
      | pred_attacker(X53) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax124])])])]) ).

cnf(c_0_95,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_90,c_0_61]) ).

cnf(c_0_96,plain,
    ( pred_attacker(constr_aenc(name_Nb(X1),X2))
    | ~ pred_attacker(tuple_client_A_in_2(constr_sign(tuple_2(X3,X2),name_skS))) ),
    inference(spm,[status(thm)],[c_0_91,c_0_54]) ).

cnf(c_0_97,plain,
    ( pred_attacker(tuple_client_A_in_2(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_92]) ).

cnf(c_0_98,plain,
    ( pred_table(tuple_keys(X1,X2))
    | X1 = name_A
    | X1 = name_B
    | ~ pred_attacker(tuple_key_register_server_in_1(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_93]) ).

cnf(c_0_99,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_key_register_server_in_1(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_94]) ).

cnf(c_0_100,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_95,c_0_50]) ).

cnf(c_0_101,plain,
    ( pred_attacker(constr_aenc(name_Nb(X1),X2))
    | ~ pred_attacker(constr_sign(tuple_2(X3,X2),name_skS)) ),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_102,plain,
    ( X1 = name_A
    | X1 = name_B
    | pred_attacker(constr_sign(tuple_2(X1,X2),name_skS))
    | ~ pred_attacker(tuple_key_register_server_in_1(X1,X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_98]),c_0_99]) ).

fof(c_0_103,plain,
    ! [X51,X52] :
      ( ~ pred_attacker(X51)
      | ~ pred_attacker(X52)
      | pred_attacker(tuple_key_register_server_in_1(X51,X52)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax123])]) ).

fof(c_0_104,plain,
    ! [X62] :
      ( ~ pred_attacker(tuple_client_B_out_6(X62))
      | pred_attacker(X62) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax131])]) ).

cnf(c_0_105,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_100,c_0_50]) ).

fof(c_0_106,negated_conjecture,
    ~ ! [X125] : pred_attacker(tuple_2(name_Nb(X125),name_objective)),
    inference(assume_negation,[status(cth)],[co0]) ).

fof(c_0_107,plain,
    ! [X96,X97] :
      ( ~ pred_attacker(X96)
      | ~ pred_attacker(X97)
      | pred_attacker(constr_adec(X96,X97)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax156])]) ).

cnf(c_0_108,plain,
    ( X1 = name_B
    | X1 = name_A
    | pred_attacker(constr_aenc(name_Nb(X2),X3))
    | ~ pred_attacker(tuple_key_register_server_in_1(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_109,plain,
    ( pred_attacker(tuple_key_register_server_in_1(X1,X2))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_103]) ).

cnf(c_0_110,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_client_B_out_6(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_104]) ).

cnf(c_0_111,plain,
    pred_attacker(tuple_client_B_out_6(name_objective)),
    inference(spm,[status(thm)],[c_0_105,c_0_50]) ).

fof(c_0_112,negated_conjecture,
    ~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_106])])]) ).

fof(c_0_113,plain,
    ! [X98,X99] :
      ( ~ pred_attacker(X98)
      | ~ pred_attacker(X99)
      | pred_attacker(tuple_2(X98,X99)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax163])]) ).

cnf(c_0_114,plain,
    ( pred_attacker(constr_adec(X1,X2))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_107]) ).

cnf(c_0_115,plain,
    ( X1 = name_A
    | X1 = name_B
    | pred_attacker(constr_aenc(name_Nb(X2),X3))
    | ~ pred_attacker(X3)
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_108,c_0_109]) ).

cnf(c_0_116,plain,
    pred_attacker(name_objective),
    inference(spm,[status(thm)],[c_0_110,c_0_111]) ).

cnf(c_0_117,plain,
    name_A != name_objective,
    inference(split_conjunct,[status(thm)],[ax66]) ).

cnf(c_0_118,plain,
    name_B != name_objective,
    inference(split_conjunct,[status(thm)],[ax72]) ).

fof(c_0_119,plain,
    ! [X35] :
      ( ~ pred_attacker(X35)
      | pred_attacker(constr_pkey(X35)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax111])]) ).

cnf(c_0_120,negated_conjecture,
    ~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
    inference(split_conjunct,[status(thm)],[c_0_112]) ).

cnf(c_0_121,plain,
    ( pred_attacker(tuple_2(X1,X2))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_113]) ).

cnf(c_0_122,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_aenc(X1,constr_pkey(X2)))
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_114,c_0_59]) ).

cnf(c_0_123,plain,
    ( pred_attacker(constr_aenc(name_Nb(X1),X2))
    | ~ pred_attacker(X2) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117]),c_0_118]) ).

cnf(c_0_124,plain,
    ( pred_attacker(constr_pkey(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_119]) ).

cnf(c_0_125,negated_conjecture,
    ( ~ pred_attacker(name_Nb(esk1_0))
    | ~ pred_attacker(name_objective) ),
    inference(spm,[status(thm)],[c_0_120,c_0_121]) ).

cnf(c_0_126,plain,
    ( pred_attacker(name_Nb(X1))
    | ~ pred_attacker(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_124]) ).

cnf(c_0_127,negated_conjecture,
    ~ pred_attacker(name_Nb(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_116])]) ).

cnf(c_0_128,plain,
    pred_attacker(name_Nb(X1)),
    inference(spm,[status(thm)],[c_0_126,c_0_50]) ).

cnf(c_0_129,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_128])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWW966+1 : TPTP v8.1.0. Released v7.4.0.
% 0.04/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n025.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.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun  5 07:45:32 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.25/2.44  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/2.44  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/2.44  # Preprocessing time       : 0.017 s
% 0.25/2.44  
% 0.25/2.44  # Failure: Out of unprocessed clauses!
% 0.25/2.44  # OLD status GaveUp
% 0.25/2.44  # Parsed axioms                        : 188
% 0.25/2.44  # Removed by relevancy pruning/SinE    : 87
% 0.25/2.44  # Initial clauses                      : 101
% 0.25/2.44  # Removed in clause preprocessing      : 0
% 0.25/2.44  # Initial clauses in saturation        : 101
% 0.25/2.44  # Processed clauses                    : 102
% 0.25/2.44  # ...of these trivial                  : 0
% 0.25/2.44  # ...subsumed                          : 0
% 0.25/2.44  # ...remaining for further processing  : 102
% 0.25/2.44  # Other redundant clauses eliminated   : 0
% 0.25/2.44  # Clauses deleted for lack of memory   : 0
% 0.25/2.44  # Backward-subsumed                    : 0
% 0.25/2.44  # Backward-rewritten                   : 0
% 0.25/2.44  # Generated clauses                    : 3
% 0.25/2.44  # ...of the previous two non-trivial   : 1
% 0.25/2.44  # Contextual simplify-reflections      : 0
% 0.25/2.44  # Paramodulations                      : 3
% 0.25/2.44  # Factorizations                       : 0
% 0.25/2.44  # Equation resolutions                 : 0
% 0.25/2.44  # Current number of processed clauses  : 102
% 0.25/2.44  #    Positive orientable unit clauses  : 9
% 0.25/2.44  #    Positive unorientable unit clauses: 0
% 0.25/2.44  #    Negative unit clauses             : 87
% 0.25/2.44  #    Non-unit-clauses                  : 6
% 0.25/2.44  # Current number of unprocessed clauses: 0
% 0.25/2.44  # ...number of literals in the above   : 0
% 0.25/2.44  # Current number of archived formulas  : 0
% 0.25/2.44  # Current number of archived clauses   : 0
% 0.25/2.44  # Clause-clause subsumption calls (NU) : 38
% 0.25/2.44  # Rec. Clause-clause subsumption calls : 2
% 0.25/2.44  # Non-unit clause-clause subsumptions  : 0
% 0.25/2.44  # Unit Clause-clause subsumption calls : 838
% 0.25/2.44  # Rewrite failures with RHS unbound    : 0
% 0.25/2.44  # BW rewrite match attempts            : 0
% 0.25/2.44  # BW rewrite match successes           : 0
% 0.25/2.44  # Condensation attempts                : 0
% 0.25/2.44  # Condensation successes               : 0
% 0.25/2.44  # Termbank termtop insertions          : 2485
% 0.25/2.44  
% 0.25/2.44  # -------------------------------------------------
% 0.25/2.44  # User time                : 0.014 s
% 0.25/2.44  # System time              : 0.005 s
% 0.25/2.44  # Total time               : 0.019 s
% 0.25/2.44  # Maximum resident set size: 3320 pages
% 0.25/2.44  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/2.44  # Preprocessing time       : 0.020 s
% 0.25/2.44  
% 0.25/2.44  # Proof found!
% 0.25/2.44  # SZS status Theorem
% 0.25/2.44  # SZS output start CNFRefutation
% See solution above
% 0.25/2.44  # Proof object total steps             : 130
% 0.25/2.44  # Proof object clause steps            : 71
% 0.25/2.44  # Proof object formula steps           : 59
% 0.25/2.44  # Proof object conjectures             : 7
% 0.25/2.44  # Proof object clause conjectures      : 4
% 0.25/2.44  # Proof object formula conjectures     : 3
% 0.25/2.44  # Proof object initial clauses used    : 31
% 0.25/2.44  # Proof object initial formulas used   : 31
% 0.25/2.44  # Proof object generating inferences   : 34
% 0.25/2.44  # Proof object simplifying inferences  : 21
% 0.25/2.44  # Training examples: 0 positive, 0 negative
% 0.25/2.44  # Parsed axioms                        : 188
% 0.25/2.44  # Removed by relevancy pruning/SinE    : 0
% 0.25/2.44  # Initial clauses                      : 188
% 0.25/2.44  # Removed in clause preprocessing      : 1
% 0.25/2.44  # Initial clauses in saturation        : 187
% 0.25/2.44  # Processed clauses                    : 15907
% 0.25/2.44  # ...of these trivial                  : 90
% 0.25/2.44  # ...subsumed                          : 14469
% 0.25/2.44  # ...remaining for further processing  : 1348
% 0.25/2.44  # Other redundant clauses eliminated   : 0
% 0.25/2.44  # Clauses deleted for lack of memory   : 0
% 0.25/2.44  # Backward-subsumed                    : 42
% 0.25/2.44  # Backward-rewritten                   : 14
% 0.25/2.44  # Generated clauses                    : 89956
% 0.25/2.44  # ...of the previous two non-trivial   : 86750
% 0.25/2.44  # Contextual simplify-reflections      : 3059
% 0.25/2.44  # Paramodulations                      : 89956
% 0.25/2.44  # Factorizations                       : 0
% 0.25/2.44  # Equation resolutions                 : 0
% 0.25/2.44  # Current number of processed clauses  : 1292
% 0.25/2.44  #    Positive orientable unit clauses  : 89
% 0.25/2.44  #    Positive unorientable unit clauses: 4
% 0.25/2.44  #    Negative unit clauses             : 95
% 0.25/2.44  #    Non-unit-clauses                  : 1104
% 0.25/2.44  # Current number of unprocessed clauses: 66193
% 0.25/2.44  # ...number of literals in the above   : 309539
% 0.25/2.44  # Current number of archived formulas  : 0
% 0.25/2.44  # Current number of archived clauses   : 57
% 0.25/2.44  # Clause-clause subsumption calls (NU) : 3378917
% 0.25/2.44  # Rec. Clause-clause subsumption calls : 2195456
% 0.25/2.44  # Non-unit clause-clause subsumptions  : 17296
% 0.25/2.44  # Unit Clause-clause subsumption calls : 3935
% 0.25/2.44  # Rewrite failures with RHS unbound    : 0
% 0.25/2.44  # BW rewrite match attempts            : 720
% 0.25/2.44  # BW rewrite match successes           : 88
% 0.25/2.44  # Condensation attempts                : 0
% 0.25/2.44  # Condensation successes               : 0
% 0.25/2.44  # Termbank termtop insertions          : 1416757
% 0.25/2.44  
% 0.25/2.44  # -------------------------------------------------
% 0.25/2.44  # User time                : 1.597 s
% 0.25/2.44  # System time              : 0.029 s
% 0.25/2.44  # Total time               : 1.626 s
% 0.25/2.44  # Maximum resident set size: 54212 pages
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------