%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV236+1 : TPTP v9.3.1. Released v3.2.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:16:44 PM UTC 2026
% Result : Theorem 3.97s 1.30s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 18 unt; 1 def)
% Number of atoms : 95 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 42 ~; 36 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 51 !; 2 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : decrypt(X0,crypt(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encryption_decryption_cancellation) ).
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/sandbox/benchmark/theBenchmark.p',key_export) ).
fof(f12,axiom,
! [X0,X1] :
( ( p(crypt(xor(km,data),X1))
& p(X0) )
=> p(decrypt(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',decrypt_data) ).
fof(f17,axiom,
! [X0,X1] :
( p(crypt(xor(X0,data),X1))
=> p(crypt(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',data_cv_is_known_to_be_zero) ).
fof(f20,axiom,
p(data),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_3) ).
fof(f24,axiom,
p(crypt(xor(km,exp),eurk)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_7) ).
fof(f25,axiom,
p(crypt(xor(km,data),eurk)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_8) ).
fof(f28,conjecture,
? [X0] :
( p(X0)
& p(crypt(xor(km,exp),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',find_known_exporter) ).
fof(f29,negated_conjecture,
~ ? [X0] :
( p(X0)
& p(crypt(xor(km,exp),X0)) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f32,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(f33,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,[],[f32]) ).
fof(f42,plain,
! [X0,X1] :
( ~ p(crypt(xor(km,data),X1))
| ~ p(X0)
| p(decrypt(X1,X0)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f43,plain,
! [X0,X1] :
( ~ p(crypt(xor(km,data),X1))
| ~ p(X0)
| p(decrypt(X1,X0)) ),
inference(flattening,[],[f42]) ).
fof(f52,plain,
! [X0,X1] :
( ~ p(crypt(xor(X0,data),X1))
| p(crypt(X0,X1)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f53,plain,
! [X0] :
( ~ p(X0)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f56,plain,
! [X0,X1] : decrypt(X0,crypt(X0,X1)) = X1,
inference(cnf_transformation,[],[f3]) ).
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,[],[f33]) ).
fof(f65,plain,
! [X0,X1] :
( ~ p(crypt(xor(km,data),X1))
| ~ p(X0)
| p(decrypt(X1,X0)) ),
inference(cnf_transformation,[],[f43]) ).
fof(f70,plain,
! [X0,X1] :
( ~ p(crypt(xor(X0,data),X1))
| p(crypt(X0,X1)) ),
inference(cnf_transformation,[],[f52]) ).
fof(f73,plain,
p(data),
inference(cnf_transformation,[],[f20]) ).
fof(f77,plain,
p(crypt(xor(km,exp),eurk)),
inference(cnf_transformation,[],[f24]) ).
fof(f78,plain,
p(crypt(xor(km,data),eurk)),
inference(cnf_transformation,[],[f25]) ).
fof(f81,plain,
! [X0] :
( ~ p(X0)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : decrypt(X0,crypt(X0,X1)) = X1,
inference(cnf_transformation,[],[f56]) ).
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_60,plain,
! [X0: $i,X1: $i] :
( p(decrypt(X0,X1))
| ~ p(X1)
| ~ p(crypt(xor(km,data),X0)) ),
inference(cnf_transformation,[],[f65]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( p(crypt(X0,X1))
| ~ p(crypt(xor(X0,data),X1)) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_68,plain,
p(data),
inference(cnf_transformation,[],[f73]) ).
tcf(c_72,plain,
p(crypt(xor(km,exp),eurk)),
inference(cnf_transformation,[],[f77]) ).
tcf(c_73,plain,
p(crypt(xor(km,data),eurk)),
inference(cnf_transformation,[],[f78]) ).
tcf(c_76,negated_conjecture,
! [X0: $i] :
( ~ p(X0)
| ~ p(crypt(xor(km,exp),X0)) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_298,definition,
iPr_def_10 = xor(km,exp),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_299,negated_conjecture,
! [X0: $i] :
( ~ p(X0)
| ~ p(crypt(iPr_def_10,X0)) ),
inference(demodulation,[status(thm)],[c_76,c_298]) ).
tcf(c_624,plain,
p(crypt(iPr_def_10,eurk)),
inference(light_normalisation,[status(thm)],[c_72,c_298]) ).
tcf(c_625,plain,
~ p(eurk),
inference(superposition,[status(thm)],[c_624,c_299]) ).
tcf(c_858,plain,
! [X0: $i] :
( p(decrypt(eurk,X0))
| ~ p(X0) ),
inference(superposition,[status(thm)],[c_73,c_60]) ).
tcf(c_862,plain,
! [X0: $i,X1: $i,X2: $i] :
( p(crypt(xor(X2,X0),X1))
| ~ p(X0)
| ~ p(crypt(iPr_def_10,X2))
| ~ p(crypt(xor(km,X0),X1)) ),
inference(light_normalisation,[status(thm)],[c_55,c_298]) ).
tcf(c_878,plain,
! [X0: $i] :
( p(crypt(xor(X0,data),eurk))
| ~ p(data)
| ~ p(crypt(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_73,c_862]) ).
tcf(c_886,plain,
! [X0: $i] :
( p(crypt(xor(X0,data),eurk))
| ~ p(crypt(iPr_def_10,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_878,c_68]) ).
tcf(c_992,plain,
! [X0: $i] :
( p(X0)
| ~ p(crypt(eurk,X0)) ),
inference(superposition,[status(thm)],[c_51,c_858]) ).
tcf(c_2482,plain,
! [X0: $i] :
( p(crypt(X0,eurk))
| ~ p(crypt(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_886,c_65]) ).
tcf(c_3099,plain,
p(crypt(eurk,eurk)),
inference(superposition,[status(thm)],[c_624,c_2482]) ).
tcf(c_3101,plain,
p(eurk),
inference(superposition,[status(thm)],[c_3099,c_992]) ).
tcf(c_3102,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3101,c_625]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV236+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 18:52:26 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 3.97/1.30 % SZS status Started for theBenchmark.p
% 3.97/1.30 % SZS status Theorem for theBenchmark.p
% 3.97/1.30
% 3.97/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.97/1.30
% 3.97/1.30 % ------ iProver source info
% 3.97/1.30
% 3.97/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.97/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.97/1.30 % git: non_committed_changes: false
% 3.97/1.30
% 3.97/1.30 % ------ Parsing...
% 3.97/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.97/1.30
% 3.97/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.97/1.30
% 3.97/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.97/1.30
% 3.97/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.97/1.30 % ------ Proving...
% 3.97/1.30 % ------ Problem Properties
% 3.97/1.30
% 3.97/1.30 %
% 3.97/1.30 % clauses 29
% 3.97/1.30 % conjectures 1
% 3.97/1.30 % EPR 7
% 3.97/1.30 % Horn 29
% 3.97/1.30 % unary 16
% 3.97/1.30 % binary 2
% 3.97/1.30 % lits 59
% 3.97/1.30 % lits eq 6
% 3.97/1.30 % fd_pure 0
% 3.97/1.30 % fd_pseudo 0
% 3.97/1.30 % fd_cond 0
% 3.97/1.30 % fd_pseudo_cond 0
% 3.97/1.30 % AC symbols 1
% 3.97/1.30
% 3.97/1.30 % ------ Schedule dynamic 5 is on
% 3.97/1.30
% 3.97/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.97/1.30
% 3.97/1.30
% 3.97/1.30 % ------
% 3.97/1.30 % Current options:
% 3.97/1.30 % ------
% 3.97/1.30
% 3.97/1.30
% 3.97/1.30 %
% 3.97/1.30
% 3.97/1.30 % ------ Proving...
% 3.97/1.30 %
% 3.97/1.30
% 3.97/1.30 % SZS status Theorem for theBenchmark.p
% 3.97/1.30
% 3.97/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.97/1.30
% 3.97/1.30
%------------------------------------------------------------------------------