%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW958+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:11:27 PM UTC 2026
% Result : Theorem 33.48s 7.14s
% Output : CNFRefutation 33.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of formulae : 101 ( 41 unt; 0 def)
% Number of atoms : 196 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 179 ( 84 ~; 76 |; 6 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 5 con; 0-2 aty)
% Number of variables : 147 ( 13 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax192,axiom,
! [X4] : constr_add(X4,constr_ZERO) = X4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax192) ).
fof(ax193,axiom,
! [X5,X6] : constr_add(X5,X6) = constr_add(X6,X5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax193) ).
fof(ax194,axiom,
! [X7,X8,X9] : constr_add(X7,constr_add(X8,X9)) = constr_add(constr_add(X7,X8),X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax194) ).
fof(ax191,axiom,
! [X3] : constr_add(X3,constr_neg(X3)) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax191) ).
fof(ax251,axiom,
! [X90,X91] :
( ( pred_attacker(X91)
& pred_attacker(X90) )
=> pred_attacker(constr_add(X90,X91)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax251) ).
fof(ax271,axiom,
! [X98,X99] :
( ( pred_attacker(tuple_client_A_in_1(X99))
& pred_attacker(tuple_client_A_in_2(X98)) )
=> pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X99))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax271) ).
fof(ax245,axiom,
! [X82] :
( pred_attacker(X82)
=> pred_attacker(tuple_client_A_in_2(X82)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax245) ).
fof(ax272,axiom,
! [X100,X101,X102] :
( ( pred_attacker(tuple_client_A_in_1(X102))
& pred_attacker(tuple_client_A_in_2(X101))
& pred_attacker(tuple_client_A_in_4(X101,X100)) )
=> pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X100,name_skA),constr_neg(name_Na)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax272) ).
fof(ax242,axiom,
! [X76,X77] :
( ( pred_attacker(X77)
& pred_attacker(X76) )
=> pred_attacker(tuple_client_A_in_4(X76,X77)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax242) ).
fof(ax246,axiom,
! [X83] :
( pred_attacker(tuple_client_A_in_2(X83))
=> pred_attacker(X83) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax246) ).
fof(ax205,axiom,
! [X19] :
( pred_attacker(X19)
=> pred_attacker(constr_neg(X19)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax205) ).
fof(ax266,axiom,
! [X97] : pred_attacker(name_new0x2Dname(X97)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax266) ).
fof(ax250,axiom,
! [X88,X89] :
( ( pred_attacker(X89)
& pred_attacker(X88) )
=> pred_attacker(constr_adec(X88,X89)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax250) ).
fof(ax190,axiom,
! [X1,X2] : constr_adec(constr_aenc(X2,constr_pkey(X1)),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax190) ).
fof(ax241,axiom,
! [X74,X75] :
( pred_attacker(tuple_client_A_out_3(X74,X75))
=> pred_attacker(X75) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax241) ).
fof(ax247,axiom,
! [X84] :
( pred_attacker(X84)
=> pred_attacker(tuple_client_A_in_1(X84)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax247) ).
fof(ax196,axiom,
! [X10] :
( pred_attacker(X10)
=> pred_attacker(constr_pkey(X10)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax196) ).
fof(co0,conjecture,
pred_attacker(name_Sa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax238,axiom,
! [X69] :
( pred_attacker(tuple_client_A_out_5(X69))
=> pred_attacker(X69) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax238) ).
fof(ax204,axiom,
! [X18] :
( pred_attacker(tuple_out_1(X18))
=> pred_attacker(X18) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax204) ).
fof(ax267,axiom,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax267) ).
fof(c_0_21,plain,
! [X115] : constr_add(X115,constr_ZERO) = X115,
inference(variable_rename,[status(thm)],[ax192]) ).
fof(c_0_22,plain,
! [X116,X117] : constr_add(X116,X117) = constr_add(X117,X116),
inference(variable_rename,[status(thm)],[ax193]) ).
fof(c_0_23,plain,
! [X118,X119,X120] : constr_add(X118,constr_add(X119,X120)) = constr_add(constr_add(X118,X119),X120),
inference(variable_rename,[status(thm)],[ax194]) ).
fof(c_0_24,plain,
! [X114] : constr_add(X114,constr_neg(X114)) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax191]) ).
cnf(c_0_25,plain,
constr_add(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
constr_add(X1,X2) = constr_add(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
constr_add(X1,constr_add(X2,X3)) = constr_add(constr_add(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
constr_add(X1,constr_neg(X1)) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
constr_add(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
constr_add(X1,constr_add(constr_neg(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
constr_neg(constr_neg(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_25]) ).
fof(c_0_32,plain,
! [X201,X202] :
( pred_attacker(constr_add(X201,X202))
| ~ pred_attacker(X202)
| ~ pred_attacker(X201) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax251])])]) ).
cnf(c_0_33,plain,
constr_add(constr_neg(X1),constr_add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
constr_add(X1,constr_add(X2,constr_neg(constr_add(X1,X2)))) = constr_ZERO,
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
fof(c_0_35,plain,
! [X209,X210] :
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X210)))
| ~ pred_attacker(tuple_client_A_in_1(X210))
| ~ pred_attacker(tuple_client_A_in_2(X209)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax271])])]) ).
fof(c_0_36,plain,
! [X193] :
( pred_attacker(tuple_client_A_in_2(X193))
| ~ pred_attacker(X193) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax245])])]) ).
fof(c_0_37,plain,
! [X211,X212,X213] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X211,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_1(X213))
| ~ pred_attacker(tuple_client_A_in_2(X212))
| ~ pred_attacker(tuple_client_A_in_4(X212,X211)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax272])])]) ).
fof(c_0_38,plain,
! [X187,X188] :
( pred_attacker(tuple_client_A_in_4(X187,X188))
| ~ pred_attacker(X188)
| ~ pred_attacker(X187) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax242])])]) ).
fof(c_0_39,plain,
! [X194] :
( pred_attacker(X194)
| ~ pred_attacker(tuple_client_A_in_2(X194)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax246])])]) ).
cnf(c_0_40,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(constr_add(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
constr_add(X1,constr_neg(constr_add(X2,X1))) = constr_neg(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_25]) ).
fof(c_0_42,plain,
! [X130] :
( pred_attacker(constr_neg(X130))
| ~ pred_attacker(X130) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax205])])]) ).
cnf(c_0_43,plain,
constr_add(X1,constr_add(X2,constr_neg(X1))) = X2,
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_44,plain,
( ~ pred_attacker(tuple_client_A_in_1(X2))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_46,plain,
! [X208] : pred_attacker(name_new0x2Dname(X208)),
inference(variable_rename,[status(thm)],[ax266]) ).
cnf(c_0_47,plain,
( ~ pred_attacker(tuple_client_A_in_1(X3))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(tuple_client_A_in_4(X1,X2))
| pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X2,name_skA),constr_neg(name_Na)))) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_in_4(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
( ~ pred_attacker(tuple_client_A_in_2(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_50,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_neg(constr_add(X1,X2)))
| pred_attacker(constr_neg(X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,plain,
( ~ pred_attacker(X1)
| pred_attacker(constr_neg(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_52,plain,
constr_add(constr_neg(X1),constr_add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_43,c_0_31]) ).
fof(c_0_53,plain,
! [X199,X200] :
( pred_attacker(constr_adec(X199,X200))
| ~ pred_attacker(X200)
| ~ pred_attacker(X199) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax250])])]) ).
fof(c_0_54,plain,
! [X112,X113] : constr_adec(constr_aenc(X113,constr_pkey(X112)),X112) = X113,
inference(variable_rename,[status(thm)],[ax190]) ).
fof(c_0_55,plain,
! [X185,X186] :
( pred_attacker(X186)
| ~ pred_attacker(tuple_client_A_out_3(X185,X186)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax241])])]) ).
cnf(c_0_56,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(tuple_client_A_in_1(X1))
| pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_57,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_58,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_in_1(X3))
| ~ pred_attacker(tuple_client_A_in_2(X2))
| pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
fof(c_0_59,plain,
! [X195] :
( pred_attacker(tuple_client_A_in_1(X195))
| ~ pred_attacker(X195) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax247])])]) ).
cnf(c_0_60,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_add(X1,X2))
| pred_attacker(constr_neg(X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_61,plain,
constr_add(constr_neg(X1),constr_neg(X2)) = constr_neg(constr_add(X2,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_41]) ).
cnf(c_0_62,plain,
constr_add(X1,constr_neg(constr_add(X1,X2))) = constr_neg(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_52]),c_0_26]) ).
cnf(c_0_63,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(constr_adec(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_64,plain,
constr_adec(constr_aenc(X1,constr_pkey(X2)),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_65,plain,
( ~ pred_attacker(tuple_client_A_out_3(X1,X2))
| pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_66,plain,
( ~ pred_attacker(tuple_client_A_in_1(X1))
| pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1))) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_in_1(X2))
| pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na)))) ),
inference(spm,[status(thm)],[c_0_58,c_0_45]) ).
cnf(c_0_68,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_69,plain,
( ~ pred_attacker(constr_neg(X2))
| ~ pred_attacker(constr_neg(constr_add(X2,X1)))
| pred_attacker(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_31]) ).
cnf(c_0_70,plain,
constr_neg(constr_add(constr_neg(X1),X2)) = constr_add(X1,constr_neg(X2)),
inference(spm,[status(thm)],[c_0_30,c_0_62]) ).
cnf(c_0_71,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_aenc(X1,constr_pkey(X2)))
| pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_72,plain,
( ~ pred_attacker(tuple_client_A_in_1(X1))
| pred_attacker(constr_aenc(constr_add(name_Na,name_Sa),X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
fof(c_0_73,plain,
! [X121] :
( pred_attacker(constr_pkey(X121))
| ~ pred_attacker(X121) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax196])])]) ).
fof(c_0_74,negated_conjecture,
~ pred_attacker(name_Sa),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_75,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na)))) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_add(X2,constr_neg(X1)))
| pred_attacker(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_31]) ).
cnf(c_0_77,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_in_1(constr_pkey(X1)))
| pred_attacker(constr_add(name_Na,name_Sa)) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,plain,
( ~ pred_attacker(X1)
| pred_attacker(constr_pkey(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
fof(c_0_79,negated_conjecture,
~ pred_attacker(name_Sa),
inference(fof_simplification,[status(thm)],[c_0_74]) ).
fof(c_0_80,plain,
! [X180] :
( pred_attacker(X180)
| ~ pred_attacker(tuple_client_A_out_5(X180)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax238])])]) ).
cnf(c_0_81,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na)))) ),
inference(spm,[status(thm)],[c_0_75,c_0_57]) ).
cnf(c_0_82,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_add(constr_neg(X1),X2))
| pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_26]) ).
cnf(c_0_83,plain,
( ~ pred_attacker(X1)
| pred_attacker(constr_add(name_Na,name_Sa)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_68]),c_0_78]) ).
fof(c_0_84,negated_conjecture,
~ pred_attacker(name_Sa),
inference(fof_nnf,[status(thm)],[c_0_79]) ).
cnf(c_0_85,plain,
( ~ pred_attacker(tuple_client_A_out_5(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_86,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na)))) ),
inference(spm,[status(thm)],[c_0_81,c_0_57]) ).
cnf(c_0_87,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_add(X2,X1))
| pred_attacker(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_43]),c_0_31]) ).
cnf(c_0_88,plain,
pred_attacker(constr_add(name_Na,name_Sa)),
inference(spm,[status(thm)],[c_0_83,c_0_57]) ).
cnf(c_0_89,negated_conjecture,
~ pred_attacker(name_Sa),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_90,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_add(X2,X1))
| pred_attacker(constr_neg(X1)) ),
inference(spm,[status(thm)],[c_0_60,c_0_26]) ).
cnf(c_0_91,plain,
( ~ pred_attacker(X1)
| pred_attacker(constr_add(constr_adec(X1,name_skA),constr_neg(name_Na))) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_92,plain,
~ pred_attacker(name_Na),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]) ).
cnf(c_0_93,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(constr_adec(X1,name_skA)) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_31]),c_0_92]) ).
fof(c_0_94,plain,
! [X129] :
( pred_attacker(X129)
| ~ pred_attacker(tuple_out_1(X129)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax204])])]) ).
cnf(c_0_95,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(constr_aenc(X1,constr_pkey(name_skA))) ),
inference(spm,[status(thm)],[c_0_93,c_0_64]) ).
cnf(c_0_96,plain,
( ~ pred_attacker(tuple_out_1(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_97,plain,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
inference(split_conjunct,[status(thm)],[ax267]) ).
cnf(c_0_98,plain,
~ pred_attacker(tuple_client_A_in_1(constr_pkey(name_skA))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_72]),c_0_88])]) ).
cnf(c_0_99,plain,
pred_attacker(constr_pkey(name_skA)),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_100,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_68]),c_0_99])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW958+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 10:20:17 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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/benchmark/theBenchmark.p
% 33.48/7.14 % Version: 3.5.1
% 33.48/7.14 % Preprocessing class: FSLSSMSMSSSNFFN.
% 33.48/7.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.48/7.14 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.48/7.14 % Starting new_bool_3 with 300s (1) cores
% 33.48/7.14 % Starting new_bool_1 with 300s (1) cores
% 33.48/7.14 % Starting sh5l with 300s (1) cores
% 33.48/7.14 % new_bool_3 with pid 3210364 completed with status 9
% 33.48/7.14 % new_bool_1 with pid 3210365 completed with status 9
% 33.48/7.14 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3210363 completed with status 0
% 33.48/7.14 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 33.48/7.14 % Preprocessing class: FSLSSMSMSSSNFFN.
% 33.48/7.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.48/7.14 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.48/7.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.48/7.14 % No SInE strategy applied
% 33.48/7.14 % Search class: FHUSM-FFMM21-MFFFFFNN
% 33.48/7.14 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 33.48/7.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 33.48/7.14 % Starting SubtermCWHack with 136s (1) cores
% 33.48/7.14 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 33.48/7.14 % Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with 212s (1) cores
% 33.48/7.14 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 33.48/7.14 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 33.48/7.14 % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 3210374 completed with status 0
% 33.48/7.14 % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 33.48/7.14 % Preprocessing class: FSLSSMSMSSSNFFN.
% 33.48/7.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.48/7.14 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.48/7.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 33.48/7.14 % No SInE strategy applied
% 33.48/7.14 % Search class: FHUSM-FFMM21-MFFFFFNN
% 33.48/7.14 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 33.48/7.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 33.48/7.14 % Starting SubtermCWHack with 136s (1) cores
% 33.48/7.14 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 33.48/7.14 % Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with 212s (1) cores
% 33.48/7.14 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 33.48/7.14 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 33.48/7.14 % Preprocessing time : 0.003 s
% 33.48/7.14 % Presaturation interreduction done
% 33.48/7.14
% 33.48/7.14 % Proof found!
% 33.48/7.14 % SZS status Theorem
% 33.48/7.14 % SZS output start CNFRefutation
% See solution above
% 33.48/7.14 % Parsed axioms : 277
% 33.48/7.14 % Removed by relevancy pruning/SinE : 0
% 33.48/7.14 % Initial clauses : 277
% 33.48/7.14 % Removed in clause preprocessing : 0
% 33.48/7.14 % Initial clauses in saturation : 277
% 33.48/7.14 % Processed clauses : 32284
% 33.48/7.14 % ...of these trivial : 4693
% 33.48/7.14 % ...subsumed : 25334
% 33.48/7.14 % ...remaining for further processing : 2257
% 33.48/7.14 % Other redundant clauses eliminated : 0
% 33.48/7.14 % Clauses deleted for lack of memory : 0
% 33.48/7.14 % Backward-subsumed : 29
% 33.48/7.14 % Backward-rewritten : 29
% 33.48/7.14 % Generated clauses : 332534
% 33.48/7.14 % ...of the previous two non-redundant : 319673
% 33.48/7.14 % ...aggressively subsumed : 0
% 33.48/7.14 % Contextual simplify-reflections : 5
% 33.48/7.14 % Paramodulations : 332534
% 33.48/7.14 % Factorizations : 0
% 33.48/7.14 % NegExts : 0
% 33.48/7.14 % Equation resolutions : 0
% 33.48/7.14 % Disequality decompositions : 0
% 33.48/7.14 % Total rewrite steps : 562645
% 33.48/7.14 % ...of those cached : 496829
% 33.48/7.14 % Propositional unsat checks : 0
% 33.48/7.14 % Propositional check models : 0
% 33.48/7.14 % Propositional check unsatisfiable : 0
% 33.48/7.14 % Propositional clauses : 0
% 33.48/7.14 % Propositional clauses after purity: 0
% 33.48/7.14 % Propositional unsat core size : 0
% 33.48/7.14 % Propositional preprocessing time : 0.000
% 33.48/7.14 % Propositional encoding time : 0.000
% 33.48/7.14 % Propositional solver time : 0.000
% 33.48/7.14 % Success case prop preproc time : 0.000
% 33.48/7.14 % Success case prop encoding time : 0.000
% 33.48/7.14 % Success case prop solver time : 0.000
% 33.48/7.14 % Current number of processed clauses : 1922
% 33.48/7.14 % Positive orientable unit clauses : 113
% 33.48/7.14 % Positive unorientable unit clauses: 4
% 33.48/7.14 % Negative unit clauses : 195
% 33.48/7.14 % Non-unit-clauses : 1610
% 33.48/7.14 % Current number of unprocessed clauses: 286251
% 33.48/7.14 % ...number of literals in the above : 1090355
% 33.48/7.14 % Current number of archived formulas : 0
% 33.48/7.14 % Current number of archived clauses : 335
% 33.48/7.14 % Clause-clause subsumption calls (NU) : 5340114
% 33.48/7.14 % Rec. Clause-clause subsumption calls : 1507638
% 33.48/7.14 % Non-unit clause-clause subsumptions : 18473
% 33.48/7.14 % Unit Clause-clause subsumption calls : 4142
% 33.48/7.14 % Rewrite failures with RHS unbound : 0
% 33.48/7.14 % BW rewrite match attempts : 1971
% 33.48/7.14 % BW rewrite match successes : 71
% 33.48/7.14 % Condensation attempts : 0
% 33.48/7.14 % Condensation successes : 0
% 33.48/7.14 % Termbank termtop insertions : 5957900
% 33.48/7.14 % Search garbage collected termcells : 1570
% 33.48/7.14
% 33.48/7.14 % -------------------------------------------------
% 33.48/7.14 % User time : 6.346 s
% 33.48/7.14 % System time : 0.249 s
% 33.48/7.14 % Total time : 6.596 s
% 33.48/7.14 % Maximum resident set size: 4096 pages
% 33.48/7.14
% 33.48/7.14 % -------------------------------------------------
% 33.48/7.14 % User time : 32.042 s
% 33.48/7.14 % System time : 1.277 s
% 33.48/7.14 % Total time : 33.319 s
% 33.48/7.14 % Maximum resident set size: 5120 pages
% 33.48/7.14 % E exiting
%------------------------------------------------------------------------------