TSTP Solution File: SWW968+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW968+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Mon Jun 24 18:13:11 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 23
% Syntax : Number of formulae : 94 ( 30 unt; 0 def)
% Number of atoms : 226 ( 12 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 240 ( 108 ~; 99 |; 18 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 7 con; 0-5 aty)
% Number of variables : 186 ( 32 sgn 94 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax185,axiom,
! [X209,X210,X211,X212,X213] :
( ( pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X212,X211,X209)),constr_cbc_dec_1(X213,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X210,name_Kas))))
& pred_attacker(tuple_client_A_in_8(X213))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X210,name_Kas)))
& pred_attacker(tuple_client_A_in_6(X210))
& pred_attacker(tuple_client_A_in_4(X212))
& pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X211,name_Kas)))
& pred_eq_bitstring_bitstring(name_Na(X209),constr_tuple_4_get_0x30(constr_cbc_dec_4(X211,name_Kas)))
& pred_attacker(tuple_client_A_in_2(X211)) )
=> pred_attacker(tuple_client_A_out_9(name_objective1)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax185) ).
fof(ax95,axiom,
! [X63,X64] : pred_eq_bitstring_bitstring(X63,X64),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax95) ).
fof(ax134,axiom,
! [X119] :
( pred_attacker(X119)
=> pred_attacker(tuple_client_A_in_8(X119)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax134) ).
fof(ax136,axiom,
! [X121] :
( pred_attacker(X121)
=> pred_attacker(tuple_client_A_in_6(X121)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax136) ).
fof(ax186,axiom,
! [X214,X215,X216,X217,X218] :
( ( pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X217,X216,X214)),constr_cbc_dec_1(X218,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X215,name_Kas))))
& pred_attacker(tuple_client_A_in_8(X218))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X215,name_Kas)))
& pred_attacker(tuple_client_A_in_6(X215))
& pred_attacker(tuple_client_A_in_4(X217))
& pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X216,name_Kas)))
& pred_eq_bitstring_bitstring(name_Na(X214),constr_tuple_4_get_0x30(constr_cbc_dec_4(X216,name_Kas)))
& pred_attacker(tuple_client_A_in_2(X216)) )
=> pred_attacker(tuple_client_A_out_10(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X215,name_Kas))))) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax186) ).
fof(ax138,axiom,
! [X123] :
( pred_attacker(X123)
=> pred_attacker(tuple_client_A_in_4(X123)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax138) ).
fof(ax140,axiom,
! [X125] :
( pred_attacker(X125)
=> pred_attacker(tuple_client_A_in_2(X125)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax140) ).
fof(ax133,axiom,
! [X116,X117,X118] :
( pred_attacker(tuple_client_A_out_1(X116,X117,X118))
=> pred_attacker(X118) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax133) ).
fof(ax181,axiom,
! [X199] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X199))),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax181) ).
fof(co0,conjecture,
pred_attacker(tuple_2(name_objective1,name_objective2)),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',co0) ).
fof(ax170,axiom,
! [X187,X188] :
( ( pred_attacker(X187)
& pred_attacker(X188) )
=> pred_attacker(tuple_2(X187,X188)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax170) ).
fof(ax121,axiom,
! [X98] :
( pred_attacker(tuple_client_A_out_9(X98))
=> pred_attacker(X98) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax121) ).
fof(ax113,axiom,
! [X89,X90] :
( ( pred_attacker(X89)
& pred_attacker(X90) )
=> pred_attacker(constr_dec(X89,X90)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax113) ).
fof(ax88,axiom,
! [X41,X42] : constr_dec(constr_enc(X42,X41),X41) = X42,
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax88) ).
fof(ax129,axiom,
! [X106] :
( pred_attacker(tuple_client_A_out_10(X106))
=> pred_attacker(X106) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax129) ).
fof(ax151,axiom,
! [X150] :
( pred_attacker(X150)
=> pred_attacker(constr_cbc_4_get_2_prefixes(X150)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax151) ).
fof(ax83,axiom,
! [X20,X21,X22,X23,X24] : constr_cbc_4_get_2_prefixes(constr_cbc_enc_4(X21,X22,X23,X24,X20)) = constr_cbc_enc_2(X21,X22,X20),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax83) ).
fof(ax106,axiom,
! [X74] :
( pred_attacker(tuple_server_S_out_2(X74))
=> pred_attacker(X74) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax106) ).
fof(ax188,axiom,
! [X221,X222,X223,X224] :
( pred_attacker(tuple_server_S_in_1(X222,X223,X224))
=> pred_attacker(tuple_server_S_out_2(constr_cbc_enc_4(X224,X223,name_Kab_66(X221),constr_cbc_enc_2(name_Kab_66(X221),X222,name_Kbs),name_Kas))) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax188) ).
fof(ax80,axiom,
! [X10,X11,X12] : constr_cbc_dec_2(constr_cbc_enc_2(X11,X12,X10),X10) = tuple_2(X11,X12),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax80) ).
fof(ax91,axiom,
! [X51,X52] : constr_tuple_2_get_0x30_bitstring(tuple_2(X51,X52)) = X51,
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax91) ).
fof(ax107,axiom,
! [X75,X76,X77] :
( ( pred_attacker(X75)
& pred_attacker(X76)
& pred_attacker(X77) )
=> pred_attacker(tuple_server_S_in_1(X75,X76,X77)) ),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax107) ).
fof(ax160,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p',ax160) ).
fof(c_0_23,plain,
! [X433,X434,X435,X436,X437] :
( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X436,X435,X433)),constr_cbc_dec_1(X437,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X434,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X437))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X434,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X434))
| ~ pred_attacker(tuple_client_A_in_4(X436))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X435,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X433),constr_tuple_4_get_0x30(constr_cbc_dec_4(X435,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X435))
| pred_attacker(tuple_client_A_out_9(name_objective1)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax185])])]) ).
fof(c_0_24,plain,
! [X287,X288] : pred_eq_bitstring_bitstring(X287,X288),
inference(variable_rename,[status(thm)],[ax95]) ).
cnf(c_0_25,plain,
( pred_attacker(tuple_client_A_out_9(name_objective1))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X1,X2,X3)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X5,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X5,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X5))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X3),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_27,plain,
! [X343] :
( ~ pred_attacker(X343)
| pred_attacker(tuple_client_A_in_8(X343)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax134])])]) ).
cnf(c_0_28,plain,
( pred_attacker(tuple_client_A_out_9(name_objective1))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_attacker(tuple_client_A_in_6(X5))
| ~ 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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_26]),c_0_26])]) ).
cnf(c_0_29,plain,
( pred_attacker(tuple_client_A_in_8(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_30,plain,
! [X345] :
( ~ pred_attacker(X345)
| pred_attacker(tuple_client_A_in_6(X345)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax136])])]) ).
fof(c_0_31,plain,
! [X438,X439,X440,X441,X442] :
( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X441,X440,X438)),constr_cbc_dec_1(X442,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X439,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X442))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X439,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X439))
| ~ pred_attacker(tuple_client_A_in_4(X441))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X440,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X438),constr_tuple_4_get_0x30(constr_cbc_dec_4(X440,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X440))
| pred_attacker(tuple_client_A_out_10(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X439,name_Kas))))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax186])])]) ).
cnf(c_0_32,plain,
( pred_attacker(tuple_client_A_out_9(name_objective1))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_4(X2))
| ~ pred_attacker(tuple_client_A_in_2(X3)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,plain,
( pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_34,plain,
! [X347] :
( ~ pred_attacker(X347)
| pred_attacker(tuple_client_A_in_4(X347)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax138])])]) ).
cnf(c_0_35,plain,
( pred_attacker(tuple_client_A_out_10(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X5,name_Kas)))))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X1,X2,X3)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X5,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X5,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X5))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X3),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( pred_attacker(tuple_client_A_out_9(name_objective1))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_37,plain,
( pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_38,plain,
! [X349] :
( ~ pred_attacker(X349)
| pred_attacker(tuple_client_A_in_2(X349)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax140])])]) ).
fof(c_0_39,plain,
! [X340,X341,X342] :
( ~ pred_attacker(tuple_client_A_out_1(X340,X341,X342))
| pred_attacker(X342) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax133])])]) ).
fof(c_0_40,plain,
! [X423] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X423))),
inference(variable_rename,[status(thm)],[ax181]) ).
cnf(c_0_41,plain,
( pred_attacker(tuple_client_A_out_10(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X5,name_Kas)))))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_attacker(tuple_client_A_in_6(X5))
| ~ 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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_26]),c_0_26]),c_0_26]),c_0_26])]) ).
fof(c_0_42,negated_conjecture,
~ pred_attacker(tuple_2(name_objective1,name_objective2)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_43,plain,
( pred_attacker(tuple_client_A_out_9(name_objective1))
| ~ pred_attacker(tuple_client_A_in_2(X1)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_44,plain,
( pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( pred_attacker(X3)
| ~ pred_attacker(tuple_client_A_out_1(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X1))),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( pred_attacker(tuple_client_A_out_10(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas)))))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_4(X2))
| ~ pred_attacker(tuple_client_A_in_2(X3)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29])]) ).
fof(c_0_48,negated_conjecture,
~ pred_attacker(tuple_2(name_objective1,name_objective2)),
inference(fof_nnf,[status(thm)],[c_0_42]) ).
fof(c_0_49,plain,
! [X411,X412] :
( ~ pred_attacker(X411)
| ~ pred_attacker(X412)
| pred_attacker(tuple_2(X411,X412)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax170])])]) ).
fof(c_0_50,plain,
! [X322] :
( ~ pred_attacker(tuple_client_A_out_9(X322))
| pred_attacker(X322) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax121])])]) ).
cnf(c_0_51,plain,
( pred_attacker(tuple_client_A_out_9(name_objective1))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,plain,
pred_attacker(name_Na(X1)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
fof(c_0_53,plain,
! [X313,X314] :
( ~ pred_attacker(X313)
| ~ pred_attacker(X314)
| pred_attacker(constr_dec(X313,X314)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax113])])]) ).
fof(c_0_54,plain,
! [X265,X266] : constr_dec(constr_enc(X266,X265),X265) = X266,
inference(variable_rename,[status(thm)],[ax88]) ).
fof(c_0_55,plain,
! [X330] :
( ~ pred_attacker(tuple_client_A_out_10(X330))
| pred_attacker(X330) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax129])])]) ).
cnf(c_0_56,plain,
( pred_attacker(tuple_client_A_out_10(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas)))))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37])]) ).
cnf(c_0_57,negated_conjecture,
~ pred_attacker(tuple_2(name_objective1,name_objective2)),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,plain,
( pred_attacker(tuple_2(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_59,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_out_9(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,plain,
pred_attacker(tuple_client_A_out_9(name_objective1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,plain,
( pred_attacker(constr_dec(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_63,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_out_10(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_64,plain,
( pred_attacker(tuple_client_A_out_10(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas)))))
| ~ pred_attacker(tuple_client_A_in_6(X1)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_44])]) ).
cnf(c_0_65,negated_conjecture,
( ~ pred_attacker(name_objective2)
| ~ pred_attacker(name_objective1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_66,plain,
pred_attacker(name_objective1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
fof(c_0_67,plain,
! [X374] :
( ~ pred_attacker(X374)
| pred_attacker(constr_cbc_4_get_2_prefixes(X374)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax151])])]) ).
fof(c_0_68,plain,
! [X244,X245,X246,X247,X248] : constr_cbc_4_get_2_prefixes(constr_cbc_enc_4(X245,X246,X247,X248,X244)) = constr_cbc_enc_2(X245,X246,X244),
inference(variable_rename,[status(thm)],[ax83]) ).
fof(c_0_69,plain,
! [X298] :
( ~ pred_attacker(tuple_server_S_out_2(X298))
| pred_attacker(X298) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax106])])]) ).
fof(c_0_70,plain,
! [X445,X446,X447,X448] :
( ~ pred_attacker(tuple_server_S_in_1(X446,X447,X448))
| pred_attacker(tuple_server_S_out_2(constr_cbc_enc_4(X448,X447,name_Kab_66(X445),constr_cbc_enc_2(name_Kab_66(X445),X446,name_Kbs),name_Kas))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax188])])]) ).
cnf(c_0_71,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_enc(X1,X2))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_72,plain,
( pred_attacker(constr_enc(name_objective2,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_6(X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_73,negated_conjecture,
~ pred_attacker(name_objective2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
fof(c_0_74,plain,
! [X234,X235,X236] : constr_cbc_dec_2(constr_cbc_enc_2(X235,X236,X234),X234) = tuple_2(X235,X236),
inference(variable_rename,[status(thm)],[ax80]) ).
fof(c_0_75,plain,
! [X275,X276] : constr_tuple_2_get_0x30_bitstring(tuple_2(X275,X276)) = X275,
inference(variable_rename,[status(thm)],[ax91]) ).
cnf(c_0_76,plain,
( pred_attacker(constr_cbc_4_get_2_prefixes(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_77,plain,
constr_cbc_4_get_2_prefixes(constr_cbc_enc_4(X1,X2,X3,X4,X5)) = constr_cbc_enc_2(X1,X2,X5),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_78,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_server_S_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_79,plain,
( pred_attacker(tuple_server_S_out_2(constr_cbc_enc_4(X3,X2,name_Kab_66(X4),constr_cbc_enc_2(name_Kab_66(X4),X1,name_Kbs),name_Kas)))
| ~ pred_attacker(tuple_server_S_in_1(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_80,plain,
( ~ pred_attacker(constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_81,plain,
constr_cbc_dec_2(constr_cbc_enc_2(X1,X2,X3),X3) = tuple_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,plain,
constr_tuple_2_get_0x30_bitstring(tuple_2(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_83,plain,
( pred_attacker(constr_cbc_enc_2(X1,X2,X3))
| ~ pred_attacker(constr_cbc_enc_4(X1,X2,X4,X5,X3)) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_84,plain,
( pred_attacker(constr_cbc_enc_4(X1,X2,name_Kab_66(X3),constr_cbc_enc_2(name_Kab_66(X3),X4,name_Kbs),name_Kas))
| ~ pred_attacker(tuple_server_S_in_1(X4,X2,X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
fof(c_0_85,plain,
! [X299,X300,X301] :
( ~ pred_attacker(X299)
| ~ pred_attacker(X300)
| ~ pred_attacker(X301)
| pred_attacker(tuple_server_S_in_1(X299,X300,X301)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax107])])]) ).
cnf(c_0_86,plain,
( ~ pred_attacker(tuple_client_A_in_6(constr_cbc_enc_2(X1,X2,name_Kas)))
| ~ pred_attacker(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_87,plain,
( pred_attacker(constr_cbc_enc_2(X1,X2,name_Kas))
| ~ pred_attacker(tuple_server_S_in_1(X3,X2,X1)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,plain,
( pred_attacker(tuple_server_S_in_1(X1,X2,X3))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_89,plain,
( ~ pred_attacker(constr_cbc_enc_2(X1,X2,name_Kas))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_33]) ).
cnf(c_0_90,plain,
( pred_attacker(constr_cbc_enc_2(X1,X2,name_Kas))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_91,plain,
pred_attacker(constr_CONST_0x30),
inference(split_conjunct,[status(thm)],[ax160]) ).
cnf(c_0_92,plain,
~ pred_attacker(X1),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90])]) ).
cnf(c_0_93,plain,
$false,
inference(sr,[status(thm)],[c_0_91,c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW968+1 : TPTP v8.2.0. Released v7.4.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 09:48:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.LfQGtt1HTf/E---3.1_20160.p
% 0.20/0.54 # Version: 3.2.0
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 20248 completed with status 0
% 0.20/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FHUSM-FFMM31-DFFFFFNN
% 0.20/0.54 # partial match(1): FHUSM-FFMM21-DFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting new_ho_10 with 271s (1) cores
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.54 # Starting ho_unfolding_3 with 271s (1) cores
% 0.20/0.54 # Starting new_ho_10_cnf2 with 271s (1) cores
% 0.20/0.54 # Starting pre_casc_2 with 271s (1) cores
% 0.20/0.55 # new_ho_10_cnf2 with pid 20260 completed with status 0
% 0.20/0.55 # Result found by new_ho_10_cnf2
% 0.20/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.55 # No SInE strategy applied
% 0.20/0.55 # Search class: FHUSM-FFMM31-DFFFFFNN
% 0.20/0.55 # partial match(1): FHUSM-FFMM21-DFFFFFNN
% 0.20/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.55 # Starting new_ho_10 with 271s (1) cores
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.55 # Starting ho_unfolding_3 with 271s (1) cores
% 0.20/0.55 # Starting new_ho_10_cnf2 with 271s (1) cores
% 0.20/0.55 # Preprocessing time : 0.001 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Theorem
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 190
% 0.20/0.55 # Removed by relevancy pruning/SinE : 0
% 0.20/0.55 # Initial clauses : 190
% 0.20/0.55 # Removed in clause preprocessing : 1
% 0.20/0.55 # Initial clauses in saturation : 189
% 0.20/0.55 # Processed clauses : 481
% 0.20/0.55 # ...of these trivial : 0
% 0.20/0.55 # ...subsumed : 28
% 0.20/0.55 # ...remaining for further processing : 453
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 149
% 0.20/0.55 # Backward-rewritten : 2
% 0.20/0.55 # Generated clauses : 240
% 0.20/0.55 # ...of the previous two non-redundant : 189
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 1
% 0.20/0.55 # Paramodulations : 224
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 29
% 0.20/0.55 # ...of those cached : 20
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 97
% 0.20/0.55 # Positive orientable unit clauses : 18
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 79
% 0.20/0.55 # Non-unit-clauses : 0
% 0.20/0.55 # Current number of unprocessed clauses: 20
% 0.20/0.55 # ...number of literals in the above : 73
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 357
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 17525
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 12829
% 0.20/0.55 # Non-unit clause-clause subsumptions : 73
% 0.20/0.55 # Unit Clause-clause subsumption calls : 2440
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 2
% 0.20/0.55 # BW rewrite match successes : 2
% 0.20/0.55 # Condensation attempts : 481
% 0.20/0.55 # Condensation successes : 30
% 0.20/0.55 # Termbank termtop insertions : 14967
% 0.20/0.55 # Search garbage collected termcells : 1605
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.023 s
% 0.20/0.55 # System time : 0.007 s
% 0.20/0.55 # Total time : 0.030 s
% 0.20/0.55 # Maximum resident set size: 2484 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.108 s
% 0.20/0.55 # System time : 0.019 s
% 0.20/0.55 # Total time : 0.127 s
% 0.20/0.55 # Maximum resident set size: 1972 pages
% 0.20/0.55 % E---3.1 exiting
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------