%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV237+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 : n018.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.66s 1.28s
% Output : CNFRefutation 3.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 25 unt; 1 def)
% Number of atoms : 125 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 128 ( 62 ~; 57 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 73 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : enc(i(X0),enc(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',enc_dec_cancel) ).
fof(f2,axiom,
! [X0,X1] : enc(X0,enc(i(X0),X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dec_enc_cancel) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( p(X2)
& p(X1)
& p(X0) )
=> p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_a_stored_comms_key) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( p(X2)
& p(X1)
& p(X0) )
=> p(enc(tc,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_clear_key_as_Tcomms_key) ).
fof(f16,axiom,
! [X0,X1,X2] :
( ( p(X2)
& p(X1)
& p(X0) )
=> p(enc(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',attacker_can_encrypt) ).
fof(f17,axiom,
p(enc(tmk,pp)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_1) ).
fof(f24,axiom,
p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_8) ).
fof(f25,conjecture,
p(enc(pp,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f26,negated_conjecture,
~ p(enc(pp,a)),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f27,plain,
~ p(enc(pp,a)),
inference(flattening,[],[f26]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
inference(ennf_transformation,[],[f9]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(tc,X0)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(tc,X0)) ),
inference(flattening,[],[f39]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(X0,X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(X0,X1)) ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
! [X0,X1] : enc(i(X0),enc(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
fof(f54,plain,
! [X0,X1] : enc(X0,enc(i(X0),X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
inference(cnf_transformation,[],[f38]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(tc,X0)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(X0,X1)) ),
inference(cnf_transformation,[],[f52]) ).
fof(f69,plain,
p(enc(tmk,pp)),
inference(cnf_transformation,[],[f17]) ).
fof(f76,plain,
p(a),
inference(cnf_transformation,[],[f24]) ).
fof(f77,plain,
~ p(enc(pp,a)),
inference(cnf_transformation,[],[f27]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : enc(i(X0),enc(X0,X1)) = X1,
inference(cnf_transformation,[],[f53]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : enc(X0,enc(i(X0),X1)) = X1,
inference(cnf_transformation,[],[f54]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( p(enc(tc,X0))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( p(enc(X0,X1))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_65,plain,
p(enc(tmk,pp)),
inference(cnf_transformation,[],[f69]) ).
tcf(c_72,plain,
p(a),
inference(cnf_transformation,[],[f76]) ).
tcf(c_73,negated_conjecture,
~ p(enc(pp,a)),
inference(cnf_transformation,[],[f77]) ).
tcf(c_318,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ p(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_64]) ).
tcf(c_327,plain,
! [X0: $i] :
( ~ iPr_def_15
| p(enc(tc,X0))
| ~ p(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_15])],[c_58]) ).
tcf(c_328,plain,
( iPr_def_15
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_58]) ).
tcf(c_329,plain,
! [X0: $i,X1: $i] :
( ~ iPr_def_16
| p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X1)
| ~ p(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_16])],[c_57]) ).
tcf(c_330,plain,
( iPr_def_16
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_57]) ).
tcf(c_339,definition,
iPr_def_21 = enc(pp,a),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_340,negated_conjecture,
~ p(iPr_def_21),
inference(demodulation,[status(thm)],[c_73,c_339]) ).
tcf(c_715,plain,
~ iPr_def_10,
inference(superposition,[status(thm)],[c_65,c_318]) ).
tcf(c_727,plain,
iPr_def_16,
inference(backward_subsumption_resolution,[status(thm)],[c_330,c_715]) ).
tcf(c_728,plain,
iPr_def_15,
inference(backward_subsumption_resolution,[status(thm)],[c_328,c_715]) ).
tcf(c_743,plain,
enc(i(pp),iPr_def_21) = a,
inference(superposition,[status(thm)],[c_339,c_49]) ).
tcf(c_796,plain,
enc(pp,a) = iPr_def_21,
inference(superposition,[status(thm)],[c_743,c_50]) ).
tcf(c_798,plain,
! [X0: $i] :
( ~ p(X0)
| p(enc(tc,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_327,c_327,c_728]) ).
tcf(c_799,plain,
! [X0: $i] :
( p(enc(tc,X0))
| ~ p(X0) ),
inference(renaming,[status(thm)],[c_798]) ).
tcf(c_3260,plain,
! [X0: $i,X1: $i] :
( ~ p(X0)
| ~ p(X1)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
inference(global_subsumption_just,[status(thm)],[c_329,c_329,c_727]) ).
tcf(c_3261,plain,
! [X0: $i,X1: $i] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X1)
| ~ p(X0) ),
inference(renaming,[status(thm)],[c_3260]) ).
tcf(c_3268,plain,
! [X0: $i,X1: $i] :
( p(enc(X0,enc(i(tc),X1)))
| ~ p(X1)
| ~ p(enc(tmk,X0)) ),
inference(superposition,[status(thm)],[c_49,c_3261]) ).
tcf(c_3357,plain,
! [X0: $i,X1: $i] :
( p(enc(X0,X1))
| ~ p(enc(tc,X1))
| ~ p(enc(tmk,X0)) ),
inference(superposition,[status(thm)],[c_49,c_3268]) ).
tcf(c_3606,plain,
! [X0: $i] :
( p(enc(pp,X0))
| ~ p(enc(tc,X0)) ),
inference(superposition,[status(thm)],[c_65,c_3357]) ).
tcf(c_3636,plain,
! [X0: $i] :
( p(enc(pp,X0))
| ~ p(X0) ),
inference(superposition,[status(thm)],[c_799,c_3606]) ).
tcf(c_3680,plain,
( p(iPr_def_21)
| ~ p(a) ),
inference(superposition,[status(thm)],[c_796,c_3636]) ).
tcf(c_3685,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3680,c_340,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV237+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.08/0.35 % Computer : n018.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 18:51:18 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.66/1.28 % SZS status Started for theBenchmark.p
% 3.66/1.28 % SZS status Theorem for theBenchmark.p
% 3.66/1.28
% 3.66/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.66/1.28
% 3.66/1.28 % ------ iProver source info
% 3.66/1.28
% 3.66/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.66/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.66/1.28 % git: non_committed_changes: false
% 3.66/1.28
% 3.66/1.28 % ------ Parsing...
% 3.66/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.66/1.28
% 3.66/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.66/1.28
% 3.66/1.28 % ------ Preprocessing... gs_s sp: 22 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.66/1.28
% 3.66/1.28 % ------ Preprocessing... sf_s rm: 12 0s sf_e sf_s rm: 0 0s sf_e
% 3.66/1.28 % ------ Proving...
% 3.66/1.28 % ------ Problem Properties
% 3.66/1.28
% 3.66/1.28 %
% 3.66/1.28 % clauses 37
% 3.66/1.28 % conjectures 1
% 3.66/1.28 % EPR 14
% 3.66/1.28 % Horn 27
% 3.66/1.28 % unary 13
% 3.66/1.28 % binary 12
% 3.66/1.28 % lits 83
% 3.66/1.28 % lits eq 4
% 3.66/1.28 % fd_pure 0
% 3.66/1.28 % fd_pseudo 0
% 3.66/1.28 % fd_cond 0
% 3.66/1.28 % fd_pseudo_cond 0
% 3.66/1.28 % AC symbols 0
% 3.66/1.28
% 3.66/1.28 % ------ Schedule dynamic 5 is on
% 3.66/1.28
% 3.66/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.66/1.28
% 3.66/1.28
% 3.66/1.28 % ------
% 3.66/1.28 % Current options:
% 3.66/1.28 % ------
% 3.66/1.28
% 3.66/1.28
% 3.66/1.28 %
% 3.66/1.28
% 3.66/1.28 % ------ Proving...
% 3.66/1.28 %
% 3.66/1.28
% 3.66/1.28 % SZS status Theorem for theBenchmark.p
% 3.66/1.28
% 3.66/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.66/1.28
% 3.66/1.28
%------------------------------------------------------------------------------