%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n009.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 : Fri Sep 25 03:30:35 PM UTC 2026
% Result : Theorem 3.28s 1.50s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 15 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 127 ( 61 ~; 56 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 54 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f87,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax86) ).
fof(f114,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax113) ).
fof(f120,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax119) ).
fof(f122,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax121) ).
fof(f124,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax123) ).
fof(f153,axiom,
pred_attacker(name_A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax152) ).
fof(f166,axiom,
! [X0,X1,X2,X3] :
( ( pred_attacker(tuple_client_B_in_2(X3))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(X1))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
& pred_attacker(tuple_client_B_in_5(X2))
& pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax165) ).
fof(f169,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f170,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f169]) ).
fof(f171,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f170]) ).
fof(f202,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f114]) ).
fof(f209,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_5(X0)) ),
inference(ennf_transformation,[],[f120]) ).
fof(f211,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_3(X0)) ),
inference(ennf_transformation,[],[f122]) ).
fof(f213,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_2(X0)) ),
inference(ennf_transformation,[],[f124]) ).
fof(f247,plain,
! [X0,X1,X2,X3] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(ennf_transformation,[],[f166]) ).
fof(f248,plain,
! [X0,X1,X2,X3] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(flattening,[],[f247]) ).
fof(f339,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f87]) ).
fof(f366,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f372,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_5(X0)) ),
inference(cnf_transformation,[],[f209]) ).
fof(f374,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_3(X0)) ),
inference(cnf_transformation,[],[f211]) ).
fof(f376,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_2(X0)) ),
inference(cnf_transformation,[],[f213]) ).
fof(f405,plain,
pred_attacker(name_A),
inference(cnf_transformation,[],[f153]) ).
fof(f417,plain,
! [X2,X3,X0,X1] :
( ~ pred_attacker(tuple_client_B_in_2(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X3,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X1,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X2,name_skB))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(cnf_transformation,[],[f248]) ).
fof(f420,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f171]) ).
tcf(c_135,plain,
! [X0: $i,X1: $i] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f339]) ).
tcf(c_162,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(cnf_transformation,[],[f366]) ).
tcf(c_168,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f372]) ).
tcf(c_170,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f374]) ).
tcf(c_172,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f376]) ).
tcf(c_201,plain,
pred_attacker(name_A),
inference(cnf_transformation,[],[f405]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X0,constr_pkey(name_skS)))) ),
inference(cnf_transformation,[],[f417]) ).
tcf(c_216,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f420]) ).
tcf(c_224,plain,
( pred_attacker(tuple_client_B_in_3(name_A))
| ~ pred_attacker(name_A) ),
inference(instantiation,[status(thm)],[c_170]) ).
tcf(c_225,plain,
( pred_attacker(tuple_client_B_in_5(name_A))
| ~ pred_attacker(name_A) ),
inference(instantiation,[status(thm)],[c_168]) ).
tcf(c_298,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_172]) ).
tcf(c_590,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X0,constr_pkey(name_skS)))) ),
inference(bin_hyper_res,[status(thm)],[c_213,c_298]) ).
tcf(c_621,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X3)
| ~ pred_attacker(tuple_client_B_in_3(X2))
| ~ pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X2,name_skB)))
| ~ pred_eq_bitstring_bitstring(name_Nb(X0),constr_adec(X1,name_skB)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_590,c_135]) ).
tcf(c_1116,plain,
! [X0: $i,X1: $i,X2: $i] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X2)
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(tuple_client_B_in_5(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_621,c_135,c_135]) ).
tcf(c_1117,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(name_A)
| ~ pred_attacker(tuple_client_B_in_3(name_A))
| ~ pred_attacker(tuple_client_B_in_5(name_A)) ),
inference(instantiation,[status(thm)],[c_1116]) ).
tcf(c_1118,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(global_subsumption_just,[status(thm)],[c_1116,c_201,c_224,c_225,c_1117]) ).
tcf(c_2619,negated_conjecture,
~ pred_attacker(name_objective),
inference(demodulation,[status(thm)],[c_216]) ).
tcf(c_4792,plain,
pred_attacker(name_objective),
inference(superposition,[status(thm)],[c_1118,c_162]) ).
tcf(c_4793,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4792,c_2619]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW959+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.59 % Computer : n009.cluster.edu
% 0.09/0.59 % Model : x86_64 x86_64
% 0.09/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.59 % Memory : 8046.5625MB
% 0.09/0.59 % OS : Linux 6.8.0-71-generic
% 0.09/0.59 % CPULimit : 300
% 0.09/0.59 % WCLimit : 300
% 0.09/0.59 % DateTime : Thu Sep 24 23:16:14 UTC 2026
% 0.09/0.59 % CPUTime :
% 0.09/0.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.63 Running first-order theorem proving
% 0.14/0.63 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.64
% 0.14/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.64
% 0.14/0.64 % Detected problem language: tptp
% 0.14/0.65 % Proving...
% 3.28/1.50 % SZS status Started for theBenchmark.p
% 3.28/1.50 % SZS status Theorem for theBenchmark.p
% 3.28/1.50
% 3.28/1.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.28/1.50
% 3.28/1.50 % ------ iProver source info
% 3.28/1.50
% 3.28/1.50 % git: date: 2026-07-19 20:42:38 +0200
% 3.28/1.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.28/1.50 % git: non_committed_changes: false
% 3.28/1.50
% 3.28/1.50 % ------ Parsing...
% 3.28/1.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.28/1.50
% 3.28/1.50 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.28/1.50
% 3.28/1.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.28/1.50
% 3.28/1.50 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.28/1.50 % ------ Proving...
% 3.28/1.50 % ------ Problem Properties
% 3.28/1.50
% 3.28/1.50 %
% 3.28/1.50 % clauses 165
% 3.28/1.50 % conjectures 1
% 3.28/1.50 % EPR 90
% 3.28/1.50 % Horn 164
% 3.28/1.50 % unary 107
% 3.28/1.50 % binary 43
% 3.28/1.50 % lits 239
% 3.28/1.50 % lits eq 88
% 3.28/1.50 % fd_pure 0
% 3.28/1.50 % fd_pseudo 0
% 3.28/1.50 % fd_cond 1
% 3.28/1.50 % fd_pseudo_cond 0
% 3.28/1.50 % AC symbols 0
% 3.28/1.50
% 3.28/1.50 % ------ Schedule dynamic 5 is on
% 3.28/1.50
% 3.28/1.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.28/1.50
% 3.28/1.50
% 3.28/1.50 % ------
% 3.28/1.50 % Current options:
% 3.28/1.50 % ------
% 3.28/1.50
% 3.28/1.50
% 3.28/1.50 %
% 3.28/1.50
% 3.28/1.50 % ------ Proving...
% 3.28/1.50 %
% 3.28/1.50
% 3.28/1.50 % SZS status Theorem for theBenchmark.p
% 3.28/1.50
% 3.28/1.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.28/1.50
% 3.28/1.50
%------------------------------------------------------------------------------