%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV237+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n010.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:12:33 PM UTC 2026
% Result : Theorem 29.28s 4.17s
% Output : Proof 29.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 29 unt; 0 def)
% Number of atoms : 61 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 24 ~; 18 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 42 ( 6 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [U,V,W] :
( ( p(W)
& p(V)
& p(U) )
=> p(enc(tc,U)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_clear_key_as_Tcomms_key) ).
fof(f9_nnf,plain,
! [U,V,W] :
( p(enc(tc,U))
| ~ p(W)
| ~ p(V)
| ~ p(U) ),
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
! [U,V,W] :
( p(enc(tc,U))
| ~ p(W)
| ~ p(V)
| ~ p(U) ),
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c9,plain,
( p(enc(tc,X0))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(hi9,axiom,
ifeq(p(X0),true,ifeq(p(X1),true,ifeq(p(X2),true,p(enc(tc,X0)),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c9]) ).
fof(f23,axiom,
p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_8) ).
fof(f23_nnf,plain,
p(a),
inference(nnf_transformation,[status(thm)],[f23]) ).
cnf(c23,plain,
p(a),
inference(cnf_transformation,[status(esa)],[f23_nnf]) ).
cnf(hi23,axiom,
p(a) = true,
inference(equality_encoding,[status(esa)],[c23]) ).
cnf(h38,plain,
p(enc(tc,a)) = true,
inference(hyper_resolution,[status(thm)],[hi9,hi23,hi23,hi23]) ).
fof(f8,axiom,
! [U,V,W] :
( ( p(W)
& p(V)
& p(U) )
=> p(enc(enc(i(tmk),V),enc(i(tc),U))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_a_stored_comms_key) ).
fof(f8_nnf,plain,
! [U,V,W] :
( p(enc(enc(i(tmk),V),enc(i(tc),U)))
| ~ p(W)
| ~ p(V)
| ~ p(U) ),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [U,V,W] :
( p(enc(enc(i(tmk),V),enc(i(tc),U)))
| ~ p(W)
| ~ p(V)
| ~ p(U) ),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X2)
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(hi8,axiom,
ifeq(p(X0),true,ifeq(p(X1),true,ifeq(p(X2),true,p(enc(enc(i(tmk),X1),enc(i(tc),X0))),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c8]) ).
fof(f16,axiom,
p(enc(tmk,pp)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_1) ).
fof(f16_nnf,plain,
p(enc(tmk,pp)),
inference(nnf_transformation,[status(thm)],[f16]) ).
cnf(c16,plain,
p(enc(tmk,pp)),
inference(cnf_transformation,[status(esa)],[f16_nnf]) ).
cnf(hi16,axiom,
p(enc(tmk,pp)) = true,
inference(equality_encoding,[status(esa)],[c16]) ).
cnf(t81,plain,
p(enc(enc(i(tmk),enc(tmk,pp)),enc(i(tc),enc(tc,a)))) = true,
inference(hyper_resolution,[status(thm)],[hi8,h38,hi16,h38]) ).
fof(f0,axiom,
! [U,V] : enc(i(U),enc(U,V)) = V,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',enc_dec_cancel) ).
fof(f0_nnf,plain,
! [U,V] : enc(i(U),enc(U,V)) = V,
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [U,V] : enc(i(U),enc(U,V)) = V,
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
enc(i(X0),enc(X0,X1)) = X1,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t11,plain,
enc(i(X1),enc(X1,X2)) = X2,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t258,plain,
enc(i(X1),enc(X1,X2)) = X2,
inference(orient,[status(thm)],[t11]) ).
cnf(t284,plain,
p(enc(pp,enc(i(tc),enc(tc,a)))) = true,
inference(step,[status(thm)],[t81,t258]) ).
cnf(t285,plain,
p(enc(pp,a)) = true,
inference(step,[status(thm)],[t284,t258]) ).
cnf(t274,plain,
p(enc(pp,a)) = true,
inference(orient,[status(thm)],[t285]) ).
fof(f24,conjecture,
p(enc(pp,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f24_neg,negated_conjecture,
~ p(enc(pp,a)),
inference(negated_conjecture,[status(cth)],[f24]) ).
fof(f24_nnf,plain,
~ p(enc(pp,a)),
inference(nnf_transformation,[status(thm)],[f24_neg]) ).
fof(f24_sk,plain,
~ p(enc(pp,a)),
inference(skolemisation,[status(esa)],[f24_nnf]) ).
cnf(c24,plain,
~ p(enc(pp,a)),
inference(cnf_transformation,[status(esa)],[f24_sk]) ).
cnf(goal_0,negated_conjecture,
p(enc(pp,a)) != true,
inference(equality_encoding,[status(esa)],[c24]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t274]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV237+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 18:49:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 29.28/4.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 29.28/4.17 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------