%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWW961+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 6.05s 1.25s
% Output : CNFRefutation 6.05s
% 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(ax89,axiom,
! [VAR_X_41,VAR_Y_42] : pred_eq_bitstring_bitstring(VAR_X_41,VAR_Y_42),
file('theBenchmark.p',ax89) ).
fof(ax114,axiom,
! [VAR_V_128] :
( pred_attacker(tuple_client_B_out_6(VAR_V_128))
=> pred_attacker(VAR_V_128) ),
file('theBenchmark.p',ax114) ).
fof(ax120,axiom,
! [VAR_V_153] :
( pred_attacker(VAR_V_153)
=> pred_attacker(tuple_client_B_in_5(VAR_V_153)) ),
file('theBenchmark.p',ax120) ).
fof(ax122,axiom,
! [VAR_V_159] :
( pred_attacker(VAR_V_159)
=> pred_attacker(tuple_client_B_in_3(VAR_V_159)) ),
file('theBenchmark.p',ax122) ).
fof(ax124,axiom,
! [VAR_V_165] :
( pred_attacker(VAR_V_165)
=> pred_attacker(tuple_client_B_in_2(VAR_V_165)) ),
file('theBenchmark.p',ax124) ).
fof(ax173,axiom,
! [VAR_0X40SID_60X305,VAR_AENC_NA_A_60X307,VAR_AENC_NB_60X306,VAR_SIGN_A_PKA_60X308] :
( ( pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_60X308))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_60X308,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_60X307))
& pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(VAR_AENC_NA_A_60X307,name_skB)))
& pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_60X306))
& pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_60X305),constr_adec(VAR_AENC_NB_60X306,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('theBenchmark.p',ax173) ).
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_93,plain,
pred_eq_bitstring_bitstring(A,B),
inference(clausify,[status(thm)],[ax89]) ).
cnf(c_118,plain,
( pred_attacker(A)
| ~ pred_attacker(tuple_client_B_out_6(A)) ),
inference(clausify,[status(thm)],[ax114]) ).
cnf(c_124,plain,
( pred_attacker(tuple_client_B_in_5(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax120]) ).
cnf(c_126,plain,
( pred_attacker(tuple_client_B_in_3(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax122]) ).
cnf(c_128,plain,
( pred_attacker(tuple_client_B_in_2(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax124]) ).
cnf(c_168,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_assoc_pair_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)],[ax173]) ).
fof(ax147,axiom,
pred_attacker(constr_CONST_4),
file('theBenchmark.p',ax147) ).
cnf(c_285,plain,
pred_attacker(constr_CONST_4),
inference(clausify,[status(thm)],[ax147]) ).
cnf(c_294,negated_conjecture,
~ pred_attacker(name_objective),
inference(clausify,[status(thm)],[co0_neg]) ).
cnf(c_317,plain,
pred_attacker(tuple_client_B_in_2(constr_CONST_4)),
inference(resolve,[status(thm)],[c_285,c_128]) ).
cnf(c_318,plain,
pred_attacker(tuple_client_B_in_3(constr_CONST_4)),
inference(resolve,[status(thm)],[c_285,c_126]) ).
cnf(c_319,plain,
pred_attacker(tuple_client_B_in_5(constr_CONST_4)),
inference(resolve,[status(thm)],[c_285,c_124]) ).
cnf(c_10466,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_assoc_pair_2_get_1(constr_adec(B,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(A)) ),
inference(resolve,[status(thm)],[c_168,c_93]) ).
cnf(c_10467,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_assoc_pair_2_get_1(constr_adec(A,name_skB))) ),
inference(resolve,[status(thm)],[c_10466,c_319]) ).
cnf(c_10468,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_10467,c_93]) ).
cnf(c_10469,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_10468,c_318]) ).
cnf(c_10470,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(A)) ),
inference(resolve,[status(thm)],[c_10469,c_93]) ).
cnf(c_4725,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(resolve,[status(thm)],[c_10470,c_317]) ).
cnf(c_10471,plain,
pred_attacker(name_objective),
inference(resolve,[status(thm)],[c_4725,c_118]) ).
cnf(c_10465,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_294,c_10471]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW961+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.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 16:37:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 3171977 was started by sandbox2 on n013,
% 0.10/0.37 % Sat Sep 26 16:37:36 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.39
% 0.10/0.39 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SInE: 87 to sos, 89 to usable, of 176 axioms (tolerance 2.00, depth 0 fixpoint).
% 6.05/1.25
% 6.05/1.25 % SZS status Theorem for theBenchmark
% 6.05/1.25
% 6.05/1.25 % Proof 1 at 0.51 (+ 0.28) seconds.
% 6.05/1.25 % Length of proof is 20.
% 6.05/1.25 % Level of proof is 4.
% 6.05/1.25 % Maximum clause weight is 107.000.
% 6.05/1.25 % Given clauses 64.
% 6.05/1.25
% 6.05/1.25 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------