%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV235+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 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 : Fri Sep 25 03:16:44 PM UTC 2026
% Result : Theorem 3.10s 1.30s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 77 ( 43 unt; 1 def)
% Number of atoms : 150 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 135 ( 65 ~; 59 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 86 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutative) ).
fof(f2,axiom,
! [X0,X1,X2] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_associative) ).
fof(f4,axiom,
! [X0] : xor(X0,id) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_rules_1) ).
fof(f5,axiom,
! [X0] : xor(X0,X0) = id,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_rules_2) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( p(crypt(xor(km,exp),X2))
& p(X0)
& p(crypt(xor(km,X0),X1)) )
=> p(crypt(xor(X2,X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_export) ).
fof(f8,axiom,
! [X0,X1] :
( ( p(X1)
& p(X0) )
=> p(crypt(xor(km,xor(kp,X1)),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_part_import___part_1) ).
fof(f14,axiom,
! [X0,X1] :
( ( p(X1)
& p(X0) )
=> p(xor(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',combine_with_XOR) ).
fof(f15,axiom,
! [X0,X1] :
( ( p(X0)
& p(crypt(X0,X1)) )
=> p(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',decrypt_knowledge) ).
fof(f16,axiom,
! [X0,X1] :
( ( p(X0)
& p(X1) )
=> p(crypt(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encrypt_knowledge) ).
fof(f17,axiom,
p(kp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_1) ).
fof(f20,axiom,
p(id),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_4) ).
fof(f21,axiom,
p(pin),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_5) ).
fof(f22,axiom,
p(crypt(xor(km,pin),pp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_6) ).
fof(f27,axiom,
p(exp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_11) ).
fof(f28,axiom,
p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_account_number) ).
fof(f29,conjecture,
p(crypt(pp,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',find_pin) ).
fof(f30,negated_conjecture,
~ p(crypt(pp,a)),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f31,plain,
~ p(crypt(pp,a)),
inference(flattening,[],[f30]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ p(crypt(xor(km,exp),X2))
| ~ p(X0)
| ~ p(crypt(xor(km,X0),X1))
| p(crypt(xor(X2,X0),X1)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ~ p(crypt(xor(km,exp),X2))
| ~ p(X0)
| ~ p(crypt(xor(km,X0),X1))
| p(crypt(xor(X2,X0),X1)) ),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ~ p(X1)
| ~ p(X0)
| p(crypt(xor(km,xor(kp,X1)),X0)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f37,plain,
! [X0,X1] :
( ~ p(X1)
| ~ p(X0)
| p(crypt(xor(km,xor(kp,X1)),X0)) ),
inference(flattening,[],[f36]) ).
fof(f48,plain,
! [X0,X1] :
( ~ p(X1)
| ~ p(X0)
| p(xor(X0,X1)) ),
inference(ennf_transformation,[],[f14]) ).
fof(f49,plain,
! [X0,X1] :
( ~ p(X1)
| ~ p(X0)
| p(xor(X0,X1)) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(crypt(X0,X1))
| p(X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f51,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(crypt(X0,X1))
| p(X1) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(X1)
| p(crypt(X0,X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f53,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(X1)
| p(crypt(X0,X1)) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f55,plain,
! [X2,X0,X1] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f57,plain,
! [X0] : xor(X0,id) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f58,plain,
! [X0] : id = xor(X0,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f60,plain,
! [X2,X0,X1] :
( ~ p(crypt(xor(km,exp),X2))
| ~ p(X0)
| ~ p(crypt(xor(km,X0),X1))
| p(crypt(xor(X2,X0),X1)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f61,plain,
! [X0,X1] :
( ~ p(X1)
| ~ p(X0)
| p(crypt(xor(km,xor(kp,X1)),X0)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f67,plain,
! [X0,X1] :
( ~ p(X1)
| ~ p(X0)
| p(xor(X0,X1)) ),
inference(cnf_transformation,[],[f49]) ).
fof(f68,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(crypt(X0,X1))
| p(X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f69,plain,
! [X0,X1] :
( ~ p(X0)
| ~ p(X1)
| p(crypt(X0,X1)) ),
inference(cnf_transformation,[],[f53]) ).
fof(f70,plain,
p(kp),
inference(cnf_transformation,[],[f17]) ).
fof(f73,plain,
p(id),
inference(cnf_transformation,[],[f20]) ).
fof(f74,plain,
p(pin),
inference(cnf_transformation,[],[f21]) ).
fof(f75,plain,
p(crypt(xor(km,pin),pp)),
inference(cnf_transformation,[],[f22]) ).
fof(f80,plain,
p(exp),
inference(cnf_transformation,[],[f27]) ).
fof(f81,plain,
p(a),
inference(cnf_transformation,[],[f28]) ).
fof(f82,plain,
~ p(crypt(pp,a)),
inference(cnf_transformation,[],[f31]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f54]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : xor(xor(X0,X1),X2) = xor(X0,xor(X1,X2)),
inference(cnf_transformation,[],[f55]) ).
tcf(c_52,plain,
! [X0: $i] : xor(X0,id) = X0,
inference(cnf_transformation,[],[f57]) ).
tcf(c_53,plain,
! [X0: $i] : xor(X0,X0) = id,
inference(cnf_transformation,[],[f58]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( p(crypt(xor(X2,X0),X1))
| ~ p(X0)
| ~ p(crypt(xor(km,exp),X2))
| ~ p(crypt(xor(km,X0),X1)) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( p(xor(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f67]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( p(X1)
| ~ p(X0)
| ~ p(crypt(X0,X1)) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( p(crypt(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_65,plain,
p(kp),
inference(cnf_transformation,[],[f70]) ).
tcf(c_68,plain,
p(id),
inference(cnf_transformation,[],[f73]) ).
tcf(c_69,plain,
p(pin),
inference(cnf_transformation,[],[f74]) ).
tcf(c_70,plain,
p(crypt(xor(km,pin),pp)),
inference(cnf_transformation,[],[f75]) ).
tcf(c_75,plain,
p(exp),
inference(cnf_transformation,[],[f80]) ).
tcf(c_76,plain,
p(a),
inference(cnf_transformation,[],[f81]) ).
tcf(c_77,negated_conjecture,
~ p(crypt(pp,a)),
inference(cnf_transformation,[],[f82]) ).
tcf(c_289,definition,
iPr_def_10 = crypt(pp,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_290,negated_conjecture,
~ p(iPr_def_10),
inference(demodulation,[status(thm)],[c_77,c_289]) ).
tcf(c_603,plain,
! [X0: $i] : xor(id,X0) = X0,
inference(superposition,[status(thm)],[c_52,c_49]) ).
tcf(c_672,plain,
( p(iPr_def_10)
| ~ p(a)
| ~ p(pp) ),
inference(superposition,[status(thm)],[c_289,c_64]) ).
tcf(c_674,plain,
~ p(pp),
inference(forward_subsumption_resolution,[status(thm)],[c_672,c_290,c_76]) ).
tcf(c_680,plain,
! [X0: $i,X1: $i] : xor(X0,xor(X0,X1)) = xor(id,X1),
inference(superposition,[status(thm)],[c_53,c_50]) ).
tcf(c_750,plain,
! [X0: $i,X1: $i] : xor(X0,xor(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_680,c_603]) ).
tcf(c_761,plain,
! [X0: $i,X1: $i] :
( p(crypt(xor(km,X0),X1))
| ~ p(X1)
| ~ p(xor(kp,X0)) ),
inference(superposition,[status(thm)],[c_750,c_56]) ).
tcf(c_800,plain,
! [X0: $i] :
( p(crypt(xor(X0,pin),pp))
| ~ p(pin)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(superposition,[status(thm)],[c_70,c_55]) ).
tcf(c_813,plain,
! [X0: $i] :
( p(crypt(xor(X0,pin),pp))
| ~ p(crypt(xor(km,exp),X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_800,c_69]) ).
tcf(c_1523,plain,
! [X0: $i] :
( p(crypt(xor(X0,pin),pp))
| ~ p(X0)
| ~ p(xor(kp,exp)) ),
inference(superposition,[status(thm)],[c_761,c_813]) ).
tcf(c_6285,plain,
( p(crypt(id,pp))
| ~ p(pin)
| ~ p(xor(kp,exp)) ),
inference(superposition,[status(thm)],[c_53,c_1523]) ).
tcf(c_6292,plain,
( p(crypt(id,pp))
| ~ p(xor(kp,exp)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6285,c_69]) ).
tcf(c_6608,plain,
( p(crypt(id,pp))
| ~ p(kp)
| ~ p(exp) ),
inference(superposition,[status(thm)],[c_62,c_6292]) ).
tcf(c_6609,plain,
p(crypt(id,pp)),
inference(forward_subsumption_resolution,[status(thm)],[c_6608,c_65,c_75]) ).
tcf(c_6610,plain,
( p(pp)
| ~ p(id) ),
inference(superposition,[status(thm)],[c_6609,c_63]) ).
tcf(c_6611,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6610,c_674,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV235+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.38 % Computer : n013.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Thu Sep 24 18:48:07 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.44
% 0.09/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.44
% 0.09/0.44 % Detected problem language: tptp
% 0.09/0.45 % Proving...
% 3.10/1.30 % SZS status Started for theBenchmark.p
% 3.10/1.30 % SZS status Theorem for theBenchmark.p
% 3.10/1.30
% 3.10/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.10/1.30
% 3.10/1.30 % ------ iProver source info
% 3.10/1.30
% 3.10/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.10/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.10/1.30 % git: non_committed_changes: false
% 3.10/1.30
% 3.10/1.30 % ------ Parsing...
% 3.10/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.10/1.30
% 3.10/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.10/1.30
% 3.10/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.10/1.30
% 3.10/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.10/1.30 % ------ Proving...
% 3.10/1.30 % ------ Problem Properties
% 3.10/1.30
% 3.10/1.30 %
% 3.10/1.30 % clauses 30
% 3.10/1.30 % conjectures 1
% 3.10/1.30 % EPR 8
% 3.10/1.30 % Horn 30
% 3.10/1.30 % unary 19
% 3.10/1.30 % binary 0
% 3.10/1.30 % lits 58
% 3.10/1.30 % lits eq 6
% 3.10/1.30 % fd_pure 0
% 3.10/1.30 % fd_pseudo 0
% 3.10/1.30 % fd_cond 0
% 3.10/1.30 % fd_pseudo_cond 0
% 3.10/1.30 % AC symbols 1
% 3.10/1.30
% 3.10/1.30 % ------ Schedule dynamic 5 is on
% 3.10/1.30
% 3.10/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.10/1.30
% 3.10/1.30
% 3.10/1.30 % ------
% 3.10/1.30 % Current options:
% 3.10/1.30 % ------
% 3.10/1.30
% 3.10/1.30
% 3.10/1.30 %
% 3.10/1.30
% 3.10/1.30 % ------ Proving...
% 3.10/1.30 %
% 3.10/1.30
% 3.10/1.30 % SZS status Theorem for theBenchmark.p
% 3.10/1.30
% 3.10/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.12/1.30
% 4.12/1.30
%------------------------------------------------------------------------------