%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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 : Sun Sep 27 09:14:57 AM UTC 2026
% Result : Theorem 0.15s 7.94s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 62 ( 27 ~; 25 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 6 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax86,axiom,
! [VAR_X_35,VAR_Y_36] : pred_eq_bitstring_bitstring(VAR_X_35,VAR_Y_36),
file('theBenchmark.p',ax86) ).
fof(ax113,axiom,
! [VAR_V_126] :
( pred_attacker(tuple_client_B_out_6(VAR_V_126))
=> pred_attacker(VAR_V_126) ),
file('theBenchmark.p',ax113) ).
fof(ax119,axiom,
! [VAR_V_151] :
( pred_attacker(VAR_V_151)
=> pred_attacker(tuple_client_B_in_5(VAR_V_151)) ),
file('theBenchmark.p',ax119) ).
fof(ax121,axiom,
! [VAR_V_157] :
( pred_attacker(VAR_V_157)
=> pred_attacker(tuple_client_B_in_3(VAR_V_157)) ),
file('theBenchmark.p',ax121) ).
fof(ax123,axiom,
! [VAR_V_163] :
( pred_attacker(VAR_V_163)
=> pred_attacker(tuple_client_B_in_2(VAR_V_163)) ),
file('theBenchmark.p',ax123) ).
fof(ax165,axiom,
! [VAR_0X40SID_545,VAR_AENC_NA_A_547,VAR_AENC_NB_546,VAR_SIGN_A_PKA_548] :
( ( pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_548,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_547,name_skB)))
& pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_546))
& pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_545),constr_adec(VAR_AENC_NB_546,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('theBenchmark.p',ax165) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('theBenchmark.p',co0) ).
fof(co0_neg,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_82,plain,
pred_eq_bitstring_bitstring(A,B),
inference(clausify,[status(thm)],[ax86]) ).
cnf(c_109,plain,
( pred_attacker(A)
| ~ pred_attacker(tuple_client_B_out_6(A)) ),
inference(clausify,[status(thm)],[ax113]) ).
cnf(c_115,plain,
( pred_attacker(tuple_client_B_in_5(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax119]) ).
cnf(c_117,plain,
( pred_attacker(tuple_client_B_in_3(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax121]) ).
cnf(c_119,plain,
( pred_attacker(tuple_client_B_in_2(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax123]) ).
cnf(c_152,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(D))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(D,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(C))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(C,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(B))
| ~ pred_eq_bitstring_bitstring(name_Nb(A),constr_adec(B,name_skB)) ),
inference(clausify,[status(thm)],[ax165]) ).
fof(ax139,axiom,
pred_attacker(constr_CONST_4),
file('theBenchmark.p',ax139) ).
cnf(c_269,plain,
pred_attacker(constr_CONST_4),
inference(clausify,[status(thm)],[ax139]) ).
cnf(c_278,negated_conjecture,
~ pred_attacker(name_objective),
inference(clausify,[status(thm)],[co0_neg]) ).
cnf(c_295,plain,
pred_attacker(tuple_client_B_in_2(constr_CONST_4)),
inference(resolve,[status(thm)],[c_269,c_119]) ).
cnf(c_296,plain,
pred_attacker(tuple_client_B_in_3(constr_CONST_4)),
inference(resolve,[status(thm)],[c_269,c_117]) ).
cnf(c_297,plain,
pred_attacker(tuple_client_B_in_5(constr_CONST_4)),
inference(resolve,[status(thm)],[c_269,c_115]) ).
cnf(c_9523,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(C))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(C,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(B))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(B,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(A)) ),
inference(resolve,[status(thm)],[c_152,c_82]) ).
cnf(c_9524,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(B))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(B,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(A))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(A,name_skB))) ),
inference(resolve,[status(thm)],[c_9523,c_297]) ).
cnf(c_9525,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(B))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(B,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(A)) ),
inference(resolve,[status(thm)],[c_9524,c_82]) ).
cnf(c_9526,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(A))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(A,constr_pkey(name_skS)))) ),
inference(resolve,[status(thm)],[c_9525,c_296]) ).
cnf(c_9527,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(A)) ),
inference(resolve,[status(thm)],[c_9526,c_82]) ).
cnf(c_2560,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(resolve,[status(thm)],[c_9527,c_295]) ).
cnf(c_9528,plain,
pred_attacker(name_objective),
inference(resolve,[status(thm)],[c_2560,c_109]) ).
cnf(c_9522,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_278,c_9528]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/7.26 % Computer : n013.cluster.edu
% 0.11/7.26 % Model : x86_64 x86_64
% 0.11/7.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/7.26 % Memory : 8046.5625MB
% 0.11/7.26 % OS : Linux 6.8.0-71-generic
% 0.11/7.26 % CPULimit : 300
% 0.11/7.26 % WCLimit : 300
% 0.11/7.26 % DateTime : Sat Sep 26 16:38:10 UTC 2026
% 0.11/7.26 % CPUTime :
% 0.11/7.26 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/7.26 % Process 3172369 was started by sandbox2 on n013,
% 0.11/7.26 % Sat Sep 26 16:38:10 2026
% 0.11/7.26 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/7.28
% 0.11/7.28 % From the command line: assign(max_seconds, 300).
% 0.11/7.28
% 0.11/7.28 % SInE: 87 to sos, 81 to usable, of 168 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.15/7.94
% 0.15/7.94 % SZS status Theorem for theBenchmark
% 0.15/7.94
% 0.15/7.94 % Proof 1 at 0.42 (+ 0.23) seconds.
% 0.15/7.94 % Length of proof is 20.
% 0.15/7.94 % Level of proof is 4.
% 0.15/7.94 % Maximum clause weight is 107.000.
% 0.15/7.94 % Given clauses 62.
% 0.15/7.94
% 0.15/7.94 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------