%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV234+2 : 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 17.59s 3.27s
% Output : CNFRefutation 17.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 66 ( 48 unt; 0 def)
% Number of atoms : 107 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 82 ( 41 ~; 36 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 88 ( 6 sgn 88 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( public(X1)
& public(X0) )
=> public(enc(enc(inv(xor(data,km)),X0),X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_data_cmd) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( public(enc(xor(km,imp),X0))
& public(enc(xor(X0,X1),X2))
& public(X1) )
=> public(enc(xor(km,X1),X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',key_import_cmd) ).
fof(f8,axiom,
! [X0,X1,X2] : enc(X0,enc(inv(X0),X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_decrypt_cancel) ).
fof(f9,axiom,
! [X0,X1,X2] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutes) ).
fof(f10,axiom,
! [X0,X1,X2] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_assosciative) ).
fof(f11,axiom,
! [X0,X1,X2] : xor(X0,X0) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_self_cancel) ).
fof(f12,axiom,
! [X0,X1,X2] : xor(X0,z) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_zero) ).
fof(f14,axiom,
public(data),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge2) ).
fof(f17,axiom,
public(enc(xor(kek,pin),pp)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge5) ).
fof(f20,axiom,
public(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge8) ).
fof(f21,axiom,
public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge9) ).
fof(f22,conjecture,
public(enc(pp,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f23,negated_conjecture,
~ public(enc(pp,a)),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f24,plain,
! [X0,X1] : enc(X0,enc(inv(X0),X1)) = X1,
inference(rectify,[],[f8]) ).
fof(f25,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(rectify,[],[f9]) ).
fof(f26,plain,
! [X0] : xor(X0,X0) = z,
inference(rectify,[],[f11]) ).
fof(f27,plain,
! [X0] : xor(X0,z) = X0,
inference(rectify,[],[f12]) ).
fof(f28,plain,
~ public(enc(pp,a)),
inference(flattening,[],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( ~ public(X1)
| ~ public(X0)
| public(enc(enc(inv(xor(data,km)),X0),X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f37,plain,
! [X0,X1] :
( ~ public(X1)
| ~ public(X0)
| public(enc(enc(inv(xor(data,km)),X0),X1)) ),
inference(flattening,[],[f36]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ~ public(enc(xor(km,imp),X0))
| ~ public(enc(xor(X0,X1),X2))
| ~ public(X1)
| public(enc(xor(km,X1),X2)) ),
inference(ennf_transformation,[],[f6]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ~ public(enc(xor(km,imp),X0))
| ~ public(enc(xor(X0,X1),X2))
| ~ public(X1)
| public(enc(xor(km,X1),X2)) ),
inference(flattening,[],[f38]) ).
fof(f46,plain,
! [X0,X1] :
( ~ public(X1)
| ~ public(X0)
| public(enc(enc(inv(xor(data,km)),X0),X1)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ public(enc(xor(km,imp),X0))
| ~ public(enc(xor(X0,X1),X2))
| ~ public(X1)
| public(enc(xor(km,X1),X2)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f49,plain,
! [X0,X1] : enc(X0,enc(inv(X0),X1)) = X1,
inference(cnf_transformation,[],[f24]) ).
fof(f50,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f25]) ).
fof(f51,plain,
! [X2,X0,X1] : xor(X0,xor(X1,X2)) = xor(xor(X0,X1),X2),
inference(cnf_transformation,[],[f10]) ).
fof(f52,plain,
! [X0] : xor(X0,X0) = z,
inference(cnf_transformation,[],[f26]) ).
fof(f53,plain,
! [X0] : xor(X0,z) = X0,
inference(cnf_transformation,[],[f27]) ).
fof(f55,plain,
public(data),
inference(cnf_transformation,[],[f14]) ).
fof(f58,plain,
public(enc(xor(kek,pin),pp)),
inference(cnf_transformation,[],[f17]) ).
fof(f61,plain,
public(a),
inference(cnf_transformation,[],[f20]) ).
fof(f62,plain,
public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
inference(cnf_transformation,[],[f21]) ).
fof(f63,plain,
~ public(enc(pp,a)),
inference(cnf_transformation,[],[f28]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( public(enc(enc(inv(xor(data,km)),X0),X1))
| ~ public(X1)
| ~ public(X0) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( public(enc(xor(km,X1),X2))
| ~ public(X1)
| ~ public(enc(xor(km,imp),X0))
| ~ public(enc(xor(X0,X1),X2)) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : enc(X0,enc(inv(X0),X1)) = X1,
inference(cnf_transformation,[],[f49]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f50]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] : xor(xor(X0,X1),X2) = xor(X0,xor(X1,X2)),
inference(cnf_transformation,[],[f51]) ).
tcf(c_59,plain,
! [X0: $i] : xor(X0,X0) = z,
inference(cnf_transformation,[],[f52]) ).
tcf(c_60,plain,
! [X0: $i] : xor(X0,z) = X0,
inference(cnf_transformation,[],[f53]) ).
tcf(c_62,plain,
public(data),
inference(cnf_transformation,[],[f55]) ).
tcf(c_65,plain,
public(enc(xor(kek,pin),pp)),
inference(cnf_transformation,[],[f58]) ).
tcf(c_68,plain,
public(a),
inference(cnf_transformation,[],[f61]) ).
tcf(c_69,plain,
public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
inference(cnf_transformation,[],[f62]) ).
tcf(c_70,negated_conjecture,
~ public(enc(pp,a)),
inference(cnf_transformation,[],[f63]) ).
tcf(c_82,plain,
public(enc(xor(pin,kek),pp)),
inference(theory_normalisation,[status(thm)],[c_65,c_58,c_57]) ).
tcf(c_84,plain,
public(enc(xor(km,imp),xor(data,xor(pin,kek)))),
inference(theory_normalisation,[status(thm)],[c_69,c_58,c_57]) ).
tcf(c_2256,plain,
public(enc(xor(kek,pin),pp)),
inference(demodulation,[status(thm)],[c_82,c_57]) ).
tcf(c_2258,plain,
public(enc(xor(imp,km),xor(data,xor(kek,pin)))),
inference(demodulation,[status(thm)],[c_84,c_57]) ).
tcf(c_2274,plain,
! [X0: $i,X1: $i,X2: $i] :
( public(enc(xor(km,X1),X2))
| ~ public(X1)
| ~ public(enc(xor(imp,km),X0))
| ~ public(enc(xor(X0,X1),X2)) ),
inference(demodulation,[status(thm)],[c_54,c_57]) ).
tcf(c_2390,plain,
! [X0: $i,X1: $i,X2: $i] :
( public(enc(xor(km,X0),X2))
| ~ public(X0)
| ~ public(enc(xor(imp,km),X1))
| ~ public(enc(xor(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_57,c_2274]) ).
tcf(c_2395,plain,
! [X0: $i] : xor(z,X0) = X0,
inference(superposition,[status(thm)],[c_57,c_60]) ).
tcf(c_2407,plain,
! [X0: $i,X1: $i] : enc(inv(inv(X0)),X1) = enc(X0,X1),
inference(superposition,[status(thm)],[c_56,c_56]) ).
tcf(c_2589,plain,
! [X0: $i,X1: $i] : enc(inv(X0),enc(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_2407,c_56]) ).
tcf(c_2598,plain,
! [X0: $i,X1: $i] :
( public(enc(X0,X1))
| ~ public(X1)
| ~ public(enc(xor(data,km),X0)) ),
inference(superposition,[status(thm)],[c_2589,c_53]) ).
tcf(c_3290,plain,
! [X0: $i,X1: $i] : xor(X0,xor(X0,X1)) = xor(z,X1),
inference(superposition,[status(thm)],[c_59,c_58]) ).
tcf(c_3310,plain,
! [X0: $i,X1: $i] : xor(X0,xor(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_3290,c_2395]) ).
tcf(c_3324,plain,
! [X0: $i,X1: $i,X2: $i] :
( public(enc(xor(km,X0),X2))
| ~ public(X0)
| ~ public(enc(X1,X2))
| ~ public(enc(xor(imp,km),xor(X0,X1))) ),
inference(superposition,[status(thm)],[c_3310,c_2390]) ).
tcf(c_12672,plain,
! [X0: $i] :
( public(enc(xor(km,data),X0))
| ~ public(data)
| ~ public(enc(xor(kek,pin),X0)) ),
inference(superposition,[status(thm)],[c_2258,c_3324]) ).
tcf(c_12693,plain,
! [X0: $i] :
( public(enc(xor(km,data),X0))
| ~ public(enc(xor(kek,pin),X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12672,c_62]) ).
tcf(c_12694,plain,
! [X0: $i] :
( public(enc(xor(data,km),X0))
| ~ public(enc(xor(kek,pin),X0)) ),
inference(demodulation,[status(thm)],[c_12693,c_57]) ).
tcf(c_12791,plain,
public(enc(xor(data,km),pp)),
inference(superposition,[status(thm)],[c_2256,c_12694]) ).
tcf(c_12812,plain,
! [X0: $i] :
( public(enc(pp,X0))
| ~ public(X0) ),
inference(superposition,[status(thm)],[c_12791,c_2598]) ).
tcf(c_12827,plain,
~ public(a),
inference(superposition,[status(thm)],[c_12812,c_70]) ).
tcf(c_12828,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12827,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV234+2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n018.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 18:51:04 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 17.59/3.27 % SZS status Started for theBenchmark.p
% 17.59/3.27 % SZS status Theorem for theBenchmark.p
% 17.59/3.27
% 17.59/3.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 17.59/3.27
% 17.59/3.27 % ------ iProver source info
% 17.59/3.27
% 17.59/3.27 % git: date: 2026-07-19 20:42:38 +0200
% 17.59/3.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 17.59/3.27 % git: non_committed_changes: false
% 17.59/3.27
% 17.59/3.27 % ------ Parsing...
% 17.59/3.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 17.59/3.27
% 17.59/3.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 17.59/3.27
% 17.59/3.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 17.59/3.27
% 17.59/3.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.59/3.27 % ------ Proving...
% 17.59/3.27 % ------ Problem Properties
% 17.59/3.27
% 17.59/3.27 %
% 17.59/3.27 % clauses 22
% 17.59/3.27 % conjectures 1
% 17.59/3.27 % EPR 6
% 17.59/3.27 % Horn 22
% 17.59/3.27 % unary 15
% 17.59/3.27 % binary 1
% 17.59/3.27 % lits 37
% 17.59/3.27 % lits eq 5
% 17.59/3.27 % fd_pure 0
% 17.59/3.27 % fd_pseudo 0
% 17.59/3.27 % fd_cond 0
% 17.59/3.27 % fd_pseudo_cond 0
% 17.59/3.27 % AC symbols 1
% 17.59/3.27
% 17.59/3.27 % ------ Input Options Time Limit: Unbounded
% 17.59/3.27
% 17.59/3.27
% 17.59/3.27 % ------
% 17.59/3.27 % Current options:
% 17.59/3.27 % ------
% 17.59/3.27
% 17.59/3.27
% 17.59/3.27 %
% 17.59/3.27
% 17.59/3.27 % ------ Proving...
% 17.59/3.27 %
% 17.59/3.27
% 17.59/3.27 % SZS status Theorem for theBenchmark.p
% 17.59/3.27
% 17.59/3.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.59/3.27
% 17.59/3.27
%------------------------------------------------------------------------------