%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW965+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 : n015.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:36 PM UTC 2026
% Result : Theorem 3.39s 1.28s
% Output : CNFRefutation 3.39s
% 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(f104,axiom,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax103) ).
fof(f132,axiom,
! [X0] :
( pred_attacker(tuple_client_B_out_6(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax131) ).
fof(f138,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_5(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax137) ).
fof(f140,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax139) ).
fof(f142,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_B_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax141) ).
fof(f172,axiom,
pred_attacker(name_A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax171) ).
fof(f185,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',ax184) ).
fof(f188,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f189,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f188]) ).
fof(f190,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f189]) ).
fof(f223,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f132]) ).
fof(f230,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_5(X0)) ),
inference(ennf_transformation,[],[f138]) ).
fof(f232,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_3(X0)) ),
inference(ennf_transformation,[],[f140]) ).
fof(f234,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_2(X0)) ),
inference(ennf_transformation,[],[f142]) ).
fof(f268,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,[],[f185]) ).
fof(f269,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,[],[f268]) ).
fof(f377,plain,
! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f104]) ).
fof(f405,plain,
! [X0] :
( ~ pred_attacker(tuple_client_B_out_6(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f223]) ).
fof(f411,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_5(X0)) ),
inference(cnf_transformation,[],[f230]) ).
fof(f413,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_3(X0)) ),
inference(cnf_transformation,[],[f232]) ).
fof(f415,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_client_B_in_2(X0)) ),
inference(cnf_transformation,[],[f234]) ).
fof(f445,plain,
pred_attacker(name_A),
inference(cnf_transformation,[],[f172]) ).
fof(f457,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,[],[f269]) ).
fof(f460,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f190]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i] : pred_eq_bitstring_bitstring(X0,X1),
inference(cnf_transformation,[],[f377]) ).
tcf(c_180,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_B_out_6(X0)) ),
inference(cnf_transformation,[],[f405]) ).
tcf(c_186,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_5(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f411]) ).
tcf(c_188,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f413]) ).
tcf(c_190,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f415]) ).
tcf(c_220,plain,
pred_attacker(name_A),
inference(cnf_transformation,[],[f445]) ).
tcf(c_232,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,[],[f457]) ).
tcf(c_235,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f460]) ).
tcf(c_243,plain,
( pred_attacker(tuple_client_B_in_3(name_A))
| ~ pred_attacker(name_A) ),
inference(instantiation,[status(thm)],[c_188]) ).
tcf(c_244,plain,
( pred_attacker(tuple_client_B_in_5(name_A))
| ~ pred_attacker(name_A) ),
inference(instantiation,[status(thm)],[c_186]) ).
tcf(c_323,plain,
! [X0: $i] :
( pred_attacker(tuple_client_B_in_2(X0))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_190]) ).
tcf(c_634,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_232,c_323]) ).
tcf(c_668,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_634,c_152]) ).
tcf(c_1203,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_668,c_152,c_152]) ).
tcf(c_1204,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_1203]) ).
tcf(c_1205,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(global_subsumption_just,[status(thm)],[c_1203,c_220,c_243,c_244,c_1204]) ).
tcf(c_2780,negated_conjecture,
~ pred_attacker(name_objective),
inference(demodulation,[status(thm)],[c_235]) ).
tcf(c_5091,plain,
pred_attacker(name_objective),
inference(superposition,[status(thm)],[c_1205,c_180]) ).
tcf(c_5092,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5091,c_2780]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW965+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 23:20:41 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 3.39/1.28 % SZS status Started for theBenchmark.p
% 3.39/1.28 % SZS status Theorem for theBenchmark.p
% 3.39/1.28
% 3.39/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.39/1.28
% 3.39/1.28 % ------ iProver source info
% 3.39/1.28
% 3.39/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.39/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.39/1.28 % git: non_committed_changes: false
% 3.39/1.28
% 3.39/1.28 % ------ Parsing...
% 3.39/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.39/1.28
% 3.39/1.28 % ------ 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.39/1.28
% 3.39/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.39/1.28
% 3.39/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.39/1.28 % ------ Proving...
% 3.39/1.28 % ------ Problem Properties
% 3.39/1.28
% 3.39/1.28 %
% 3.39/1.28 % clauses 184
% 3.39/1.28 % conjectures 1
% 3.39/1.28 % EPR 104
% 3.39/1.28 % Horn 183
% 3.39/1.28 % unary 125
% 3.39/1.28 % binary 43
% 3.39/1.28 % lits 260
% 3.39/1.28 % lits eq 105
% 3.39/1.28 % fd_pure 0
% 3.39/1.28 % fd_pseudo 0
% 3.39/1.28 % fd_cond 1
% 3.39/1.28 % fd_pseudo_cond 0
% 3.39/1.28 % AC symbols 1
% 3.39/1.28
% 3.39/1.28 % ------ Schedule dynamic 5 is on
% 3.39/1.28
% 3.39/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.39/1.28
% 3.39/1.28
% 3.39/1.28 % ------
% 3.39/1.28 % Current options:
% 3.39/1.28 % ------
% 3.39/1.28
% 3.39/1.28
% 3.39/1.28 %
% 3.39/1.28
% 3.39/1.28 % ------ Proving...
% 3.39/1.28 %
% 3.39/1.28
% 3.39/1.28 % SZS status Theorem for theBenchmark.p
% 3.39/1.28
% 3.39/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.39/1.28
% 3.39/1.28
%------------------------------------------------------------------------------