%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWW965+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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.58s 1.51s
% Output : CNFRefutation 6.58s
% 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(ax103,axiom,
! [VAR_X_41,VAR_Y_42] : pred_eq_bitstring_bitstring(VAR_X_41,VAR_Y_42),
file('theBenchmark.p',ax103) ).
fof(ax131,axiom,
! [VAR_V_136] :
( pred_attacker(tuple_client_B_out_6(VAR_V_136))
=> pred_attacker(VAR_V_136) ),
file('theBenchmark.p',ax131) ).
fof(ax137,axiom,
! [VAR_V_161] :
( pred_attacker(VAR_V_161)
=> pred_attacker(tuple_client_B_in_5(VAR_V_161)) ),
file('theBenchmark.p',ax137) ).
fof(ax139,axiom,
! [VAR_V_167] :
( pred_attacker(VAR_V_167)
=> pred_attacker(tuple_client_B_in_3(VAR_V_167)) ),
file('theBenchmark.p',ax139) ).
fof(ax141,axiom,
! [VAR_V_173] :
( pred_attacker(VAR_V_173)
=> pred_attacker(tuple_client_B_in_2(VAR_V_173)) ),
file('theBenchmark.p',ax141) ).
fof(ax184,axiom,
! [VAR_0X40SID_577,VAR_AENC_NA_A_579,VAR_AENC_NB_578,VAR_SIGN_A_PKA_580X30] :
( ( pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_580X30))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_580X30,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_579))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_579,name_skB)))
& pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_578))
& pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_577),constr_adec(VAR_AENC_NB_578,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('theBenchmark.p',ax184) ).
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_91,plain,
pred_eq_bitstring_bitstring(A,B),
inference(clausify,[status(thm)],[ax103]) ).
cnf(c_119,plain,
( pred_attacker(A)
| ~ pred_attacker(tuple_client_B_out_6(A)) ),
inference(clausify,[status(thm)],[ax131]) ).
cnf(c_125,plain,
( pred_attacker(tuple_client_B_in_5(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax137]) ).
cnf(c_127,plain,
( pred_attacker(tuple_client_B_in_3(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax139]) ).
cnf(c_129,plain,
( pred_attacker(tuple_client_B_in_2(A))
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax141]) ).
cnf(c_162,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)],[ax184]) ).
fof(ax157,axiom,
pred_attacker(constr_ZERO),
file('theBenchmark.p',ax157) ).
cnf(c_294,plain,
pred_attacker(constr_ZERO),
inference(clausify,[status(thm)],[ax157]) ).
cnf(c_304,negated_conjecture,
~ pred_attacker(name_objective),
inference(clausify,[status(thm)],[co0_neg]) ).
cnf(c_321,plain,
pred_attacker(tuple_client_B_in_2(constr_ZERO)),
inference(resolve,[status(thm)],[c_294,c_129]) ).
cnf(c_322,plain,
pred_attacker(tuple_client_B_in_3(constr_ZERO)),
inference(resolve,[status(thm)],[c_294,c_127]) ).
cnf(c_323,plain,
pred_attacker(tuple_client_B_in_5(constr_ZERO)),
inference(resolve,[status(thm)],[c_294,c_125]) ).
cnf(c_10140,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_162,c_91]) ).
cnf(c_10141,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_10140,c_323]) ).
cnf(c_10142,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_10141,c_91]) ).
cnf(c_10143,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_10142,c_322]) ).
cnf(c_10144,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(A)) ),
inference(resolve,[status(thm)],[c_10143,c_91]) ).
cnf(c_2763,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(resolve,[status(thm)],[c_10144,c_321]) ).
cnf(c_10145,plain,
pred_attacker(name_objective),
inference(resolve,[status(thm)],[c_2763,c_119]) ).
cnf(c_10139,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_304,c_10145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW965+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n011.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 : Sat Sep 26 16:38:59 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 1055044 was started by sandbox on n011,
% 0.10/0.36 % Sat Sep 26 16:38:59 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.38
% 0.13/0.38 % From the command line: assign(max_seconds, 300).
% 0.13/0.38
% 0.13/0.38 % SInE: 101 to sos, 86 to usable, of 187 axioms (tolerance 2.00, depth 0 fixpoint).
% 6.58/1.51
% 6.58/1.51 % SZS status Theorem for theBenchmark
% 6.58/1.51
% 6.58/1.51 % Proof 1 at 0.59 (+ 0.36) seconds.
% 6.58/1.51 % Length of proof is 20.
% 6.58/1.51 % Level of proof is 4.
% 6.58/1.51 % Maximum clause weight is 107.000.
% 6.58/1.51 % Given clauses 62.
% 6.58/1.51
% 6.58/1.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------