%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWW967+1 : TPTP v9.2.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:33:29 PM UTC 2026
% Result : Theorem 1.31s 1.72s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 124 ( 56 ~; 54 |; 7 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 4 con; 0-3 aty)
% Number of variables : 75 ( 32 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax171,axiom,
! [X207,X208,X209,X210,X211] :
( ( pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X210,X209,X207)),constr_cbc_dec_1(X211,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X208,name_Kas))))
& pred_attacker(tuple_client_A_in_8(X211))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X208,name_Kas)))
& pred_attacker(tuple_client_A_in_6(X208))
& pred_attacker(tuple_client_A_in_4(X210))
& pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X209,name_Kas)))
& pred_eq_bitstring_bitstring(name_Na(X207),constr_tuple_4_get_0x30(constr_cbc_dec_4(X209,name_Kas)))
& pred_attacker(tuple_client_A_in_2(X209)) )
=> pred_attacker(tuple_client_A_out_9(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax171) ).
fof(ax83,axiom,
! [X63,X64] : pred_eq_bitstring_bitstring(X63,X64),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(ax120,axiom,
! [X117] :
( pred_attacker(X117)
=> pred_attacker(tuple_client_A_in_8(X117)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax120) ).
fof(ax122,axiom,
! [X119] :
( pred_attacker(X119)
=> pred_attacker(tuple_client_A_in_6(X119)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax122) ).
fof(ax124,axiom,
! [X121] :
( pred_attacker(X121)
=> pred_attacker(tuple_client_A_in_4(X121)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax124) ).
fof(ax126,axiom,
! [X123] :
( pred_attacker(X123)
=> pred_attacker(tuple_client_A_in_2(X123)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax126) ).
fof(ax119,axiom,
! [X114,X115,X116] :
( pred_attacker(tuple_client_A_out_1(X114,X115,X116))
=> pred_attacker(X116) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax119) ).
fof(ax167,axiom,
! [X197] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X197))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax167) ).
fof(ax109,axiom,
! [X98] :
( pred_attacker(tuple_client_A_out_9(X98))
=> pred_attacker(X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax109) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(c_0_10,plain,
! [X641,X642,X643,X644,X645] :
( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X644,X643,X641)),constr_cbc_dec_1(X645,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X642,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X645))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X642,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X642))
| ~ pred_attacker(tuple_client_A_in_4(X644))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X643,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X641),constr_tuple_4_get_0x30(constr_cbc_dec_4(X643,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X643))
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax171])]) ).
fof(c_0_11,plain,
! [X497,X498] : pred_eq_bitstring_bitstring(X497,X498),
inference(variable_rename,[status(thm)],[ax83]) ).
cnf(c_0_12,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ 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_10]) ).
cnf(c_0_13,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X551] :
( ~ pred_attacker(X551)
| pred_attacker(tuple_client_A_in_8(X551)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax120])]) ).
cnf(c_0_15,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ 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_12,c_0_13]),c_0_13]),c_0_13]),c_0_13])]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_client_A_in_8(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X553] :
( ~ pred_attacker(X553)
| pred_attacker(tuple_client_A_in_6(X553)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])]) ).
cnf(c_0_18,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_4(X2))
| ~ pred_attacker(tuple_client_A_in_2(X3))
| ~ pred_attacker(X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X555] :
( ~ pred_attacker(X555)
| pred_attacker(tuple_client_A_in_4(X555)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax124])]) ).
cnf(c_0_21,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_attacker(tuple_client_A_in_2(X2))
| ~ pred_attacker(X3)
| ~ pred_attacker(X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X557] :
( ~ pred_attacker(X557)
| pred_attacker(tuple_client_A_in_2(X557)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax126])]) ).
fof(c_0_24,plain,
! [X548,X549,X550] :
( ~ pred_attacker(tuple_client_A_out_1(X548,X549,X550))
| pred_attacker(X550) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax119])]) ).
fof(c_0_25,plain,
! [X631] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X631))),
inference(variable_rename,[status(thm)],[ax167]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(X2)
| ~ pred_attacker(X3)
| ~ pred_attacker(X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( pred_attacker(X3)
| ~ pred_attacker(tuple_client_A_out_1(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X1))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2)
| ~ pred_attacker(X3)
| ~ pred_attacker(X4) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
pred_attacker(name_Na(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
fof(c_0_34,plain,
! [X532] :
( ~ pred_attacker(tuple_client_A_out_9(X532))
| pred_attacker(X532) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax109])]) ).
cnf(c_0_35,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
fof(c_0_36,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_37,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_out_9(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
pred_attacker(tuple_client_A_out_9(name_objective)),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW967+1 : TPTP v9.2.1. Released v7.4.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n028.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 07:37:16 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.31/1.72 % Version : CSE_E---1.7
% 1.31/1.72 % Problem : theBenchmark.p
% 1.31/1.72 % SZS status Theorem for theBenchmark.p
% 1.31/1.72 % SZS output start CNFRefutation
% See solution above
% 1.31/1.72 % Total time : 1.372s
%------------------------------------------------------------------------------