%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV237+1 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:21:08 PM UTC 2026
% Result : Theorem 1.35s 1.74s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 14 unt; 0 def)
% Number of atoms : 57 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 26 ~; 24 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 4 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(encrypt_a_stored_comms_key,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(enc(i(tmk),X2),enc(i(tc),X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encrypt_a_stored_comms_key) ).
fof(intruder_knows_8,axiom,
p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intruder_knows_8) ).
fof(dec_enc_cancel,axiom,
! [X1,X2] : enc(X1,enc(i(X1),X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dec_enc_cancel) ).
fof(double_inverse_cancel,axiom,
! [X1] : i(i(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',double_inverse_cancel) ).
fof(encrypt_clear_key_as_Tcomms_key,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(tc,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encrypt_clear_key_as_Tcomms_key) ).
fof(co1,conjecture,
p(enc(pp,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(intruder_knows_1,axiom,
p(enc(tmk,pp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intruder_knows_1) ).
fof(c_0_7,plain,
! [X64,X65,X66] :
( ~ p(X64)
| ~ p(X65)
| ~ p(X66)
| p(enc(enc(i(tmk),X65),enc(i(tc),X64))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_a_stored_comms_key])]) ).
cnf(c_0_8,plain,
( p(enc(enc(i(tmk),X2),enc(i(tc),X1)))
| ~ p(X1)
| ~ p(X2)
| ~ p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,plain,
p(a),
inference(split_conjunct,[status(thm)],[intruder_knows_8]) ).
fof(c_0_10,plain,
! [X48,X49] : enc(X48,enc(i(X48),X49)) = X49,
inference(variable_rename,[status(thm)],[dec_enc_cancel]) ).
fof(c_0_11,plain,
! [X50] : i(i(X50)) = X50,
inference(variable_rename,[status(thm)],[double_inverse_cancel]) ).
fof(c_0_12,plain,
! [X67,X68,X69] :
( ~ p(X67)
| ~ p(X68)
| ~ p(X69)
| p(enc(tc,X67)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_clear_key_as_Tcomms_key])]) ).
cnf(c_0_13,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
| ~ p(X1)
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
enc(X1,enc(i(X1),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
i(i(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( p(enc(tc,X1))
| ~ p(X1)
| ~ p(X2)
| ~ p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( p(enc(enc(i(tmk),X1),X2))
| ~ p(enc(tc,X2))
| ~ p(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
( p(enc(tc,X1))
| ~ p(X2)
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_19,plain,
( p(enc(X1,X2))
| ~ p(enc(tc,X2))
| ~ p(enc(tmk,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_15]) ).
cnf(c_0_20,plain,
( p(enc(tc,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
fof(c_0_21,negated_conjecture,
~ p(enc(pp,a)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_22,plain,
( p(enc(X1,X2))
| ~ p(enc(tmk,X1))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
p(enc(tmk,pp)),
inference(split_conjunct,[status(thm)],[intruder_knows_1]) ).
cnf(c_0_24,negated_conjecture,
~ p(enc(pp,a)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( p(enc(pp,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV237+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.33 % Computer : n019.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Tue May 5 04:58:29 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.34 % start to proof: theBenchmark
% 1.35/1.74 % Version : CSE_E---1.7
% 1.35/1.74 % Problem : theBenchmark.p
% 1.35/1.74 % SZS status Theorem for theBenchmark.p
% 1.35/1.74 % SZS output start CNFRefutation
% See solution above
% 1.35/1.74 % Total time : 1.369s
%------------------------------------------------------------------------------