%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV014-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Thu Sep 24 02:53:30 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 61 ( 20 unt; 0 nHn; 61 RR)
% Number of literals : 137 ( 0 equ; 80 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 98 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(b_creates_freash_nonces_in_time_10,axiom,
( ~ message(sent(X2,b,pair(X2,X1)))
| ~ fresh_to_b(X1)
| message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_creates_freash_nonces_in_time_10) ).
cnf(b_accepts_secure_session_key_12,axiom,
( ~ message(sent(X2,b,pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1))))
| ~ b_stored(pair(X2,X3))
| b_holds(key(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_accepts_secure_session_key_12) ).
cnf(intruder_message_sent_31,axiom,
( ~ party_of_protocol(X1)
| ~ party_of_protocol(X2)
| ~ intruder_message(X3)
| message(sent(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_message_sent_31) ).
cnf(intruder_can_record_17,axiom,
( ~ message(sent(X2,X3,X1))
| intruder_message(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_can_record_17) ).
cnf(a_sent_message_i_to_b_3,axiom,
message(sent(a,b,pair(a,an_a_nonce))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_sent_message_i_to_b_3) ).
cnf(nonce_a_is_fresh_to_b_9,axiom,
fresh_to_b(an_a_nonce),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonce_a_is_fresh_to_b_9) ).
cnf(b_is_party_of_protocol_8,axiom,
party_of_protocol(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_party_of_protocol_8) ).
cnf(intruder_composes_pairs_27,axiom,
( ~ intruder_message(X1)
| ~ intruder_message(X2)
| intruder_message(pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_composes_pairs_27) ).
cnf(intruder_decomposes_triples_22,axiom,
( ~ intruder_message(triple(X2,X3,X1))
| intruder_message(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_decomposes_triples_22) ).
cnf(b_creates_freash_nonces_in_time_11,axiom,
( ~ message(sent(X1,b,pair(X1,X2)))
| ~ fresh_to_b(X2)
| b_stored(pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_creates_freash_nonces_in_time_11) ).
cnf(intruder_key_encrypts_33,axiom,
( ~ party_of_protocol(X3)
| ~ intruder_message(X1)
| ~ intruder_holds(key(X2,X3))
| intruder_message(encrypt(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_key_encrypts_33) ).
cnf(intruder_holds_key_32,axiom,
( ~ party_of_protocol(X2)
| ~ intruder_message(X1)
| intruder_holds(key(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_holds_key_32) ).
cnf(intruder_decomposes_triples_21,axiom,
( ~ intruder_message(triple(X2,X1,X3))
| intruder_message(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_decomposes_triples_21) ).
cnf(intruder_decomposes_pairs_19,axiom,
( ~ intruder_message(pair(X2,X1))
| intruder_message(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_decomposes_pairs_19) ).
cnf(a_is_party_of_protocol_2,axiom,
party_of_protocol(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_party_of_protocol_2) ).
cnf(t_is_party_of_protocol_15,axiom,
party_of_protocol(t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t_is_party_of_protocol_15) ).
cnf(co1_38,negated_conjecture,
( ~ intruder_holds(key(X1,b))
| ~ b_holds(key(X1,a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_38) ).
cnf(c_0_17,plain,
( ~ message(sent(X2,b,pair(X2,X1)))
| ~ fresh_to_b(X1)
| message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt)))) ),
inference(fof_simplification,[status(thm)],[b_creates_freash_nonces_in_time_10]) ).
cnf(c_0_18,plain,
( ~ message(sent(X2,b,pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1))))
| ~ b_stored(pair(X2,X3))
| b_holds(key(X1,X2)) ),
inference(fof_simplification,[status(thm)],[b_accepts_secure_session_key_12]) ).
cnf(c_0_19,plain,
( ~ party_of_protocol(X1)
| ~ party_of_protocol(X2)
| ~ intruder_message(X3)
| message(sent(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[intruder_message_sent_31]) ).
cnf(c_0_20,plain,
( ~ message(sent(X2,X3,X1))
| intruder_message(X1) ),
inference(fof_simplification,[status(thm)],[intruder_can_record_17]) ).
cnf(c_0_21,plain,
( ~ message(sent(X2,b,pair(X2,X1)))
| ~ fresh_to_b(X1)
| message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt)))) ),
c_0_17 ).
cnf(c_0_22,axiom,
message(sent(a,b,pair(a,an_a_nonce))),
a_sent_message_i_to_b_3 ).
cnf(c_0_23,axiom,
fresh_to_b(an_a_nonce),
nonce_a_is_fresh_to_b_9 ).
cnf(c_0_24,plain,
( ~ message(sent(X2,b,pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1))))
| ~ b_stored(pair(X2,X3))
| b_holds(key(X1,X2)) ),
c_0_18 ).
cnf(c_0_25,plain,
( ~ party_of_protocol(X1)
| ~ party_of_protocol(X2)
| ~ intruder_message(X3)
| message(sent(X1,X2,X3)) ),
c_0_19 ).
cnf(c_0_26,axiom,
party_of_protocol(b),
b_is_party_of_protocol_8 ).
cnf(c_0_27,plain,
( ~ intruder_message(X1)
| ~ intruder_message(X2)
| intruder_message(pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[intruder_composes_pairs_27]) ).
cnf(c_0_28,plain,
( ~ intruder_message(triple(X2,X3,X1))
| intruder_message(X1) ),
inference(fof_simplification,[status(thm)],[intruder_decomposes_triples_22]) ).
cnf(c_0_29,plain,
( ~ message(sent(X2,X3,X1))
| intruder_message(X1) ),
c_0_20 ).
cnf(c_0_30,plain,
message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_31,plain,
( ~ message(sent(X1,b,pair(X1,X2)))
| ~ fresh_to_b(X2)
| b_stored(pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[b_creates_freash_nonces_in_time_11]) ).
cnf(c_0_32,plain,
( ~ party_of_protocol(X3)
| ~ intruder_message(X1)
| ~ intruder_holds(key(X2,X3))
| intruder_message(encrypt(X1,X2)) ),
inference(fof_simplification,[status(thm)],[intruder_key_encrypts_33]) ).
cnf(c_0_33,plain,
( ~ party_of_protocol(X2)
| ~ intruder_message(X1)
| intruder_holds(key(X1,X2)) ),
inference(fof_simplification,[status(thm)],[intruder_holds_key_32]) ).
cnf(c_0_34,plain,
( ~ party_of_protocol(X2)
| ~ b_stored(pair(X2,X3))
| ~ intruder_message(pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1)))
| b_holds(key(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_35,plain,
( ~ intruder_message(X1)
| ~ intruder_message(X2)
| intruder_message(pair(X1,X2)) ),
c_0_27 ).
cnf(c_0_36,plain,
( ~ intruder_message(triple(X2,X3,X1))
| intruder_message(X1) ),
c_0_28 ).
cnf(c_0_37,plain,
intruder_message(triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( ~ message(sent(X1,b,pair(X1,X2)))
| ~ fresh_to_b(X2)
| b_stored(pair(X1,X2)) ),
c_0_31 ).
cnf(c_0_39,plain,
( ~ party_of_protocol(X3)
| ~ intruder_message(X1)
| ~ intruder_holds(key(X2,X3))
| intruder_message(encrypt(X1,X2)) ),
c_0_32 ).
cnf(c_0_40,plain,
( ~ party_of_protocol(X2)
| ~ intruder_message(X1)
| intruder_holds(key(X1,X2)) ),
c_0_33 ).
cnf(c_0_41,plain,
( ~ intruder_message(triple(X2,X1,X3))
| intruder_message(X1) ),
inference(fof_simplification,[status(thm)],[intruder_decomposes_triples_21]) ).
cnf(c_0_42,plain,
( ~ intruder_message(pair(X2,X1))
| intruder_message(X1) ),
inference(fof_simplification,[status(thm)],[intruder_decomposes_pairs_19]) ).
cnf(c_0_43,plain,
( ~ party_of_protocol(X2)
| ~ b_stored(pair(X2,X3))
| ~ intruder_message(encrypt(generate_b_nonce(X3),X1))
| ~ intruder_message(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt))
| b_holds(key(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,plain,
intruder_message(encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
b_stored(pair(a,an_a_nonce)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_22]),c_0_23])]) ).
cnf(c_0_46,axiom,
party_of_protocol(a),
a_is_party_of_protocol_2 ).
cnf(c_0_47,plain,
( ~ party_of_protocol(X3)
| ~ intruder_message(X2)
| ~ intruder_message(X1)
| intruder_message(encrypt(X1,X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,axiom,
party_of_protocol(t),
t_is_party_of_protocol_15 ).
cnf(c_0_49,plain,
( ~ intruder_message(triple(X2,X1,X3))
| intruder_message(X1) ),
c_0_41 ).
cnf(c_0_50,plain,
( ~ intruder_message(pair(X2,X1))
| intruder_message(X1) ),
c_0_42 ).
cnf(c_0_51,plain,
intruder_message(pair(a,an_a_nonce)),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_52,negated_conjecture,
( ~ intruder_holds(key(X1,b))
| ~ b_holds(key(X1,a)) ),
inference(fof_simplification,[status(thm)],[co1_38]) ).
cnf(c_0_53,plain,
( ~ intruder_message(encrypt(generate_b_nonce(an_a_nonce),an_a_nonce))
| b_holds(key(an_a_nonce,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_54,plain,
( ~ intruder_message(X2)
| ~ intruder_message(X1)
| intruder_message(encrypt(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,plain,
intruder_message(generate_b_nonce(an_a_nonce)),
inference(spm,[status(thm)],[c_0_49,c_0_37]) ).
cnf(c_0_56,plain,
intruder_message(an_a_nonce),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( ~ intruder_holds(key(X1,b))
| ~ b_holds(key(X1,a)) ),
c_0_52 ).
cnf(c_0_58,plain,
b_holds(key(an_a_nonce,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56])]) ).
cnf(c_0_59,negated_conjecture,
~ intruder_holds(key(an_a_nonce,b)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_40]),c_0_56]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV014-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:27:05 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % new_bool_3 with pid 2137011 completed with status 0
% 0.14/0.43 % Result found by new_bool_3
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FHHNS-FFMM32-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 2137016 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FHHNS-FFMM32-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.002 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 34
% 0.14/0.43 % Removed by relevancy pruning/SinE : 8
% 0.14/0.43 % Initial clauses : 26
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 26
% 0.14/0.43 % Processed clauses : 49
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 0
% 0.14/0.43 % ...remaining for further processing : 49
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 2
% 0.14/0.43 % Backward-rewritten : 1
% 0.14/0.43 % Generated clauses : 39
% 0.14/0.43 % ...of the previous two non-redundant : 29
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 39
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 18
% 0.14/0.43 % ...of those cached : 9
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 46
% 0.14/0.43 % Positive orientable unit clauses : 20
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 1
% 0.14/0.43 % Non-unit-clauses : 25
% 0.14/0.43 % Current number of unprocessed clauses: 2
% 0.14/0.43 % ...number of literals in the above : 12
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 3
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 209
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 124
% 0.14/0.43 % Non-unit clause-clause subsumptions : 2
% 0.14/0.43 % Unit Clause-clause subsumption calls : 2
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 2
% 0.14/0.43 % BW rewrite match successes : 1
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 1604
% 0.14/0.43 % Search garbage collected termcells : 140
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.007 s
% 0.14/0.43 % System time : 0.001 s
% 0.14/0.43 % Total time : 0.008 s
% 0.14/0.43 % Maximum resident set size: 3672 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.011 s
% 0.14/0.43 % System time : 0.004 s
% 0.14/0.43 % Total time : 0.015 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------