%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW948+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 : n008.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:34 PM UTC 2026
% Result : Theorem 1.40s 1.92s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 83 ( 39 unt; 0 def)
% Number of atoms : 141 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 111 ( 53 ~; 48 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 89 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
fof(f67,axiom,
! [X0] : constr_xor(X0,X0) = constr_ZERO,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f68,axiom,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
fof(f69,axiom,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f70,axiom,
! [X0,X1,X2] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f71,axiom,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(constr_xor(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).
fof(f76,axiom,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).
fof(f77,axiom,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(f79,axiom,
! [X0] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f84,axiom,
! [X0] :
( pred_attacker(tuple_R_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f88,axiom,
! [X0] :
( pred_attacker(tuple_R_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax87) ).
fof(f89,axiom,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(tuple_R_in_2(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax88) ).
fof(f102,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax101) ).
fof(f103,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax102) ).
fof(f105,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax104) ).
fof(f107,axiom,
! [X0] :
( pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k))))
=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax106) ).
fof(f108,conjecture,
pred_attacker(name_objective_R),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f109,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(negated_conjecture,[status(cth)],[f108]) ).
fof(f110,plain,
~ pred_attacker(name_objective_R),
inference(flattening,[],[f109]) ).
fof(f112,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_xor(X0,X1)) ),
inference(ennf_transformation,[],[f71]) ).
fof(f113,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_xor(X0,X1)) ),
inference(flattening,[],[f112]) ).
fof(f118,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f119,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X1) ),
inference(ennf_transformation,[],[f77]) ).
fof(f121,plain,
! [X0] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f124,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_4(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f128,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_1(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f88]) ).
fof(f129,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(tuple_R_in_2(X0,X1)) ),
inference(ennf_transformation,[],[f89]) ).
fof(f130,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(tuple_R_in_2(X0,X1)) ),
inference(flattening,[],[f129]) ).
fof(f138,plain,
! [X0] :
( ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(ennf_transformation,[],[f107]) ).
fof(f205,plain,
! [X0] : constr_ZERO = constr_xor(X0,X0),
inference(cnf_transformation,[],[f67]) ).
fof(f206,plain,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f68]) ).
fof(f207,plain,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f69]) ).
fof(f208,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
inference(cnf_transformation,[],[f70]) ).
fof(f209,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_xor(X0,X1)) ),
inference(cnf_transformation,[],[f113]) ).
fof(f214,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f215,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f217,plain,
! [X0] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f222,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f226,plain,
! [X0] :
( ~ pred_attacker(tuple_R_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f227,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(tuple_R_in_2(X0,X1)) ),
inference(cnf_transformation,[],[f130]) ).
fof(f239,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(cnf_transformation,[],[f102]) ).
fof(f240,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
inference(cnf_transformation,[],[f103]) ).
fof(f242,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(cnf_transformation,[],[f105]) ).
fof(f244,plain,
! [X0] :
( ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(cnf_transformation,[],[f138]) ).
fof(f245,plain,
~ pred_attacker(name_objective_R),
inference(cnf_transformation,[],[f110]) ).
tcf(c_115,plain,
! [X0: $i] : constr_xor(X0,X0) = constr_ZERO,
inference(cnf_transformation,[],[f205]) ).
tcf(c_116,plain,
! [X0: $i] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f206]) ).
tcf(c_117,plain,
! [X0: $i,X1: $i] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f207]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i,X2: $i] : constr_xor(constr_xor(X0,X1),X2) = constr_xor(X0,constr_xor(X1,X2)),
inference(cnf_transformation,[],[f208]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_127,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0)) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_132,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_4(X0)) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_136,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_1(X0)) ),
inference(cnf_transformation,[],[f226]) ).
tcf(c_137,plain,
! [X0: $i,X1: $i] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_149,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(cnf_transformation,[],[f239]) ).
tcf(c_150,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
inference(cnf_transformation,[],[f240]) ).
tcf(c_152,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(cnf_transformation,[],[f242]) ).
tcf(c_154,plain,
! [X0: $i] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k)))) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_155,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(cnf_transformation,[],[f245]) ).
tcf(c_180,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st))))),
inference(theory_normalisation,[status(thm)],[c_150,c_118,c_117]) ).
tcf(c_183,plain,
! [X0: $i] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X0))))) ),
inference(theory_normalisation,[status(thm)],[c_154,c_118,c_117]) ).
tcf(c_773,plain,
! [X0: $i] :
( ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X0)))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(prop_impl_just,[status(thm)],[c_183]) ).
tcf(c_774,plain,
! [X0: $i] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X0))))) ),
inference(renaming,[status(thm)],[c_773]) ).
tcf(c_1252,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(demodulation,[status(thm)],[c_155]) ).
tcf(c_2315,plain,
! [X0: $i,X1: $i,X2: $i] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(X1,constr_xor(X0,X2)),
inference(superposition,[status(thm)],[c_118,c_117]) ).
tcf(c_2355,plain,
pred_attacker(name_r0x30_from_1st),
inference(superposition,[status(thm)],[c_149,c_127]) ).
tcf(c_2397,plain,
pred_attacker(name_r0x30),
inference(superposition,[status(thm)],[c_152,c_136]) ).
tcf(c_2402,plain,
pred_attacker(name_r1_from_1st),
inference(superposition,[status(thm)],[c_180,c_124]) ).
tcf(c_2407,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(superposition,[status(thm)],[c_180,c_125]) ).
tcf(c_2421,plain,
! [X0: $i] : constr_xor(constr_ZERO,X0) = X0,
inference(superposition,[status(thm)],[c_117,c_116]) ).
tcf(c_2488,plain,
! [X0: $i,X1: $i] : constr_xor(X0,constr_xor(X0,X1)) = constr_xor(constr_ZERO,X1),
inference(superposition,[status(thm)],[c_115,c_118]) ).
tcf(c_2515,plain,
! [X0: $i,X1: $i] : constr_xor(X0,constr_xor(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_2488,c_2421]) ).
tcf(c_2527,plain,
! [X0: $i] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(constr_xor(name_r0x30,X0),constr_h(constr_xor(name_k,X0)))) ),
inference(superposition,[status(thm)],[c_2515,c_774]) ).
tcf(c_2626,plain,
! [X0: $i,X1: $i,X2: $i] :
( pred_attacker(constr_xor(X0,constr_xor(X2,X1)))
| ~ pred_attacker(X2)
| ~ pred_attacker(constr_xor(X0,X1)) ),
inference(superposition,[status(thm)],[c_2315,c_119]) ).
tcf(c_2695,plain,
! [X0: $i] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_xor(name_r0x30,X0))
| ~ pred_attacker(constr_h(constr_xor(name_k,X0))) ),
inference(superposition,[status(thm)],[c_137,c_2527]) ).
tcf(c_5684,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st))) ),
inference(superposition,[status(thm)],[c_2407,c_2695]) ).
tcf(c_5727,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(name_r0x30_from_1st)
| ~ pred_attacker(constr_xor(name_r0x30,name_r1_from_1st)) ),
inference(superposition,[status(thm)],[c_2626,c_5684]) ).
tcf(c_5728,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_xor(name_r0x30,name_r1_from_1st)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5727,c_2355]) ).
tcf(c_5741,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(name_r1_from_1st)
| ~ pred_attacker(name_r0x30) ),
inference(superposition,[status(thm)],[c_119,c_5728]) ).
tcf(c_5742,plain,
pred_attacker(tuple_R_out_4(name_objective_R)),
inference(forward_subsumption_resolution,[status(thm)],[c_5741,c_2402,c_2397]) ).
tcf(c_5743,plain,
pred_attacker(name_objective_R),
inference(superposition,[status(thm)],[c_5742,c_132]) ).
tcf(c_5744,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5743,c_1252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWW948+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.43 % Computer : n008.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Thu Sep 24 23:15:09 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.48 Running first-order theorem proving
% 0.16/0.48 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.24/0.50
% 0.24/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.50
% 0.24/0.50 % Detected problem language: tptp
% 0.24/0.51 % Proving...
% 1.40/1.92 % SZS status Started for theBenchmark.p
% 1.40/1.92 % SZS status Theorem for theBenchmark.p
% 1.40/1.92
% 1.40/1.92 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.40/1.92
% 1.40/1.92 % ------ iProver source info
% 1.40/1.92
% 1.40/1.92 % git: date: 2026-07-19 20:42:38 +0200
% 1.40/1.92 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.40/1.92 % git: non_committed_changes: false
% 1.40/1.92
% 1.40/1.92 % ------ Parsing...
% 1.40/1.92 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.40/1.92
% 1.40/1.92 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.40/1.92
% 1.40/1.92 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.40/1.92
% 1.40/1.92 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.40/1.92 % ------ Proving...
% 1.40/1.92 % ------ Problem Properties
% 1.40/1.92
% 1.40/1.92 %
% 1.40/1.92 % clauses 105
% 1.40/1.92 % conjectures 1
% 1.40/1.92 % EPR 76
% 1.40/1.92 % Horn 105
% 1.40/1.92 % unary 85
% 1.40/1.92 % binary 17
% 1.40/1.92 % lits 128
% 1.40/1.92 % lits eq 70
% 1.40/1.92 % fd_pure 0
% 1.40/1.92 % fd_pseudo 0
% 1.40/1.92 % fd_cond 0
% 1.40/1.92 % fd_pseudo_cond 0
% 1.40/1.92 % AC symbols 1
% 1.40/1.92
% 1.40/1.92 % ------ Schedule dynamic 5 is on
% 1.40/1.92
% 1.40/1.92 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.40/1.92
% 1.40/1.92
% 1.40/1.92 % ------
% 1.40/1.92 % Current options:
% 1.40/1.92 % ------
% 1.40/1.92
% 1.40/1.92
% 1.40/1.92 %
% 1.40/1.92
% 1.40/1.92 % ------ Proving...
% 1.40/1.92 %
% 1.40/1.92
% 1.40/1.92 % SZS status Theorem for theBenchmark.p
% 1.40/1.92
% 1.40/1.92 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.40/1.93
% 1.40/1.93
%------------------------------------------------------------------------------