0.00/0.02 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.08/0.36 % Computer : n022.cluster.edu 0.08/0.36 % Model : x86_64 x86_64 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.36 % Memory : 8046.5625MB 0.08/0.36 % OS : Linux 6.8.0-71-generic 0.08/0.36 % CPULimit : 1440 0.08/0.36 % WCLimit : 180 0.08/0.36 % DateTime : Mon Jul 27 09:25:43 UTC 2026 0.08/0.36 % CPUTime : 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.08/0.41 Running first-order theorem proving 0.08/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=180 /export/starexec/sandbox/benchmark/theBenchmark.p 0.08/0.44 % Version: 3.5.1 0.08/0.44 % Preprocessing class: FSMSSMSSSSSNFFN. 0.08/0.44 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.08/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.08/0.44 % Starting new_bool_3 with 180s (1) cores 0.08/0.44 % Starting new_bool_1 with 180s (1) cores 0.08/0.44 % Starting sh5l with 180s (1) cores 0.08/0.44 % new_bool_3 with pid 697970 completed with status 0 0.08/0.44 % Result found by new_bool_3 0.08/0.44 % Preprocessing class: FSMSSMSSSSSNFFN. 0.08/0.44 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.08/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.08/0.44 % Starting new_bool_3 with 180s (1) cores 0.08/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)) 0.08/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.08/0.44 % Search class: FHHNS-FFMM32-MFFFFFNN 0.08/0.44 % Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.08/0.44 % Starting SubtermCWHack with 19s (1) cores 0.08/0.44 % SubtermCWHack with pid 697973 completed with status 0 0.08/0.44 % Result found by SubtermCWHack 0.08/0.44 % Preprocessing class: FSMSSMSSSSSNFFN. 0.08/0.44 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.08/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores 0.08/0.44 % Starting new_bool_3 with 180s (1) cores 0.08/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)) 0.08/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.08/0.44 % Search class: FHHNS-FFMM32-MFFFFFNN 0.08/0.44 % Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.08/0.44 % Starting SubtermCWHack with 19s (1) cores 0.08/0.44 % Preprocessing time : 0.002 s 0.08/0.44 0.08/0.44 % Proof found! 0.08/0.44 % SZS status Theorem 0.08/0.44 % SZS output start CNFRefutation 0.08/0.44 fof(intruder_message_sent, axiom, ![X1, X2, X3]:((message(sent(X2,X3,X1))<=((intruder_message(X1)&party_of_protocol(X3))&party_of_protocol(X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', intruder_message_sent)). 0.08/0.44 fof(b_creates_freash_nonces_in_time, axiom, ![X1, X2]:(((fresh_to_b(X2)&message(sent(X1,b,pair(X1,X2))))=>(b_stored(pair(X1,X2))&message(sent(b,t,triple(b,generate_b_nonce(X2),encrypt(triple(X1,X2,generate_expiration_time(X2)),bt))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', b_creates_freash_nonces_in_time)). 0.08/0.44 fof(b_accepts_secure_session_key, axiom, ![X2, X4, X5]:(((message(sent(X4,b,pair(encrypt(triple(X4,X2,generate_expiration_time(X5)),bt),encrypt(generate_b_nonce(X5),X2))))&b_stored(pair(X4,X5)))=>b_holds(key(X2,X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', b_accepts_secure_session_key)). 0.08/0.44 fof(intruder_composes_pairs, axiom, ![X1, X2]:((intruder_message(pair(X1,X2))<=(intruder_message(X1)&intruder_message(X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', intruder_composes_pairs)). 0.08/0.44 fof(intruder_can_record, axiom, ![X1, X2, X3]:((message(sent(X1,X2,X3))=>intruder_message(X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', intruder_can_record)). 0.08/0.44 fof(a_sent_message_i_to_b, axiom, message(sent(a,b,pair(a,an_a_nonce))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', a_sent_message_i_to_b)). 0.08/0.44 fof(nonce_a_is_fresh_to_b, axiom, fresh_to_b(an_a_nonce), file('/export/starexec/sandbox/benchmark/theBenchmark.p', nonce_a_is_fresh_to_b)). 0.08/0.44 fof(b_is_party_of_protocol, axiom, party_of_protocol(b), file('/export/starexec/sandbox/benchmark/theBenchmark.p', b_is_party_of_protocol)). 0.08/0.44 fof(intruder_decomposes_triples, axiom, ![X1, X2, X3]:((intruder_message(triple(X1,X2,X3))=>((intruder_message(X1)&intruder_message(X3))&intruder_message(X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', intruder_decomposes_triples)). 0.08/0.44 fof(intruder_key_encrypts, axiom, ![X1, X2, X3]:((((party_of_protocol(X3)&intruder_holds(key(X2,X3)))&intruder_message(X1))=>intruder_message(encrypt(X1,X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', intruder_key_encrypts)). 0.08/0.44 fof(intruder_holds_key, axiom, ![X2, X3]:(((intruder_message(X2)&party_of_protocol(X3))=>intruder_holds(key(X2,X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', intruder_holds_key)). 0.08/0.44 fof(intruder_decomposes_pairs, axiom, ![X1, X2]:((intruder_message(pair(X1,X2))=>(intruder_message(X1)&intruder_message(X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', intruder_decomposes_pairs)). 0.08/0.44 fof(co1, conjecture, ?[X1]:((intruder_holds(key(X1,b))&b_holds(key(X1,a)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', co1)). 0.08/0.44 fof(a_is_party_of_protocol, axiom, party_of_protocol(a), file('/export/starexec/sandbox/benchmark/theBenchmark.p', a_is_party_of_protocol)). 0.08/0.44 fof(c_0_14, plain, ![X1, X2, X3]:((((intruder_message(X1)&party_of_protocol(X3))&party_of_protocol(X2))=>message(sent(X2,X3,X1)))), inference(fof_simplification,[status(thm)],[intruder_message_sent])). 0.08/0.44 fof(c_0_15, plain, ![X20, X21]:(((b_stored(pair(X20,X21))|(~fresh_to_b(X21)|~message(sent(X20,b,pair(X20,X21)))))&(message(sent(b,t,triple(b,generate_b_nonce(X21),encrypt(triple(X20,X21,generate_expiration_time(X21)),bt))))|(~fresh_to_b(X21)|~message(sent(X20,b,pair(X20,X21))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[b_creates_freash_nonces_in_time])])])])). 0.08/0.44 fof(c_0_16, plain, ![X9, X10, X11]:((~message(sent(X10,b,pair(encrypt(triple(X10,X9,generate_expiration_time(X11)),bt),encrypt(generate_b_nonce(X11),X9))))|~b_stored(pair(X10,X11))|b_holds(key(X9,X10)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[b_accepts_secure_session_key])])])). 0.08/0.44 fof(c_0_17, plain, ![X29, X30, X31]:((~intruder_message(X29)|~party_of_protocol(X31)|~party_of_protocol(X30)|message(sent(X30,X31,X29)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])). 0.08/0.44 fof(c_0_18, plain, ![X1, X2]:(((intruder_message(X1)&intruder_message(X2))=>intruder_message(pair(X1,X2)))), inference(fof_simplification,[status(thm)],[intruder_composes_pairs])). 0.08/0.44 fof(c_0_19, plain, ![X26, X27, X28]:((~message(sent(X26,X27,X28))|intruder_message(X28))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intruder_can_record])])])). 0.08/0.44 cnf(c_0_20, plain, (message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt))))|~fresh_to_b(X1)|~message(sent(X2,b,pair(X2,X1)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.08/0.44 cnf(c_0_21, plain, (message(sent(a,b,pair(a,an_a_nonce)))), inference(split_conjunct,[status(thm)],[a_sent_message_i_to_b])). 0.08/0.44 cnf(c_0_22, plain, (fresh_to_b(an_a_nonce)), inference(split_conjunct,[status(thm)],[nonce_a_is_fresh_to_b])). 0.08/0.44 cnf(c_0_23, plain, (b_holds(key(X2,X1))|~message(sent(X1,b,pair(encrypt(triple(X1,X2,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X2))))|~b_stored(pair(X1,X3))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.08/0.44 cnf(c_0_24, plain, (message(sent(X3,X2,X1))|~intruder_message(X1)|~party_of_protocol(X2)|~party_of_protocol(X3)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.08/0.44 cnf(c_0_25, plain, (party_of_protocol(b)), inference(split_conjunct,[status(thm)],[b_is_party_of_protocol])). 0.08/0.44 fof(c_0_26, plain, ![X24, X25]:((~intruder_message(X24)|~intruder_message(X25)|intruder_message(pair(X24,X25)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])). 0.08/0.44 fof(c_0_27, plain, ![X36, X37, X38]:((((intruder_message(X36)|~intruder_message(triple(X36,X37,X38)))&(intruder_message(X38)|~intruder_message(triple(X36,X37,X38))))&(intruder_message(X37)|~intruder_message(triple(X36,X37,X38))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intruder_decomposes_triples])])])])). 0.08/0.44 cnf(c_0_28, plain, (intruder_message(X3)|~message(sent(X1,X2,X3))), inference(split_conjunct,[status(thm)],[c_0_19])). 0.08/0.44 cnf(c_0_29, 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_20, c_0_21]), c_0_22])])). 0.08/0.44 fof(c_0_30, plain, ![X14, X15, X16]:((~party_of_protocol(X16)|~intruder_holds(key(X15,X16))|~intruder_message(X14)|intruder_message(encrypt(X14,X15)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intruder_key_encrypts])])])). 0.08/0.44 fof(c_0_31, plain, ![X12, X13]:((~intruder_message(X12)|~party_of_protocol(X13)|intruder_holds(key(X12,X13)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intruder_holds_key])])])). 0.08/0.44 cnf(c_0_32, plain, (b_holds(key(X1,X2))|~b_stored(pair(X2,X3))|~party_of_protocol(X2)|~intruder_message(pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])])). 0.08/0.44 cnf(c_0_33, plain, (intruder_message(pair(X1,X2))|~intruder_message(X1)|~intruder_message(X2)), inference(split_conjunct,[status(thm)],[c_0_26])). 0.08/0.44 cnf(c_0_34, plain, (intruder_message(X1)|~intruder_message(triple(X2,X3,X1))), inference(split_conjunct,[status(thm)],[c_0_27])). 0.08/0.44 cnf(c_0_35, 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_28, c_0_29])). 0.08/0.44 cnf(c_0_36, plain, (b_stored(pair(X1,X2))|~fresh_to_b(X2)|~message(sent(X1,b,pair(X1,X2)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.08/0.44 cnf(c_0_37, plain, (intruder_message(encrypt(X3,X2))|~party_of_protocol(X1)|~intruder_holds(key(X2,X1))|~intruder_message(X3)), inference(split_conjunct,[status(thm)],[c_0_30])). 0.08/0.44 cnf(c_0_38, plain, (intruder_holds(key(X1,X2))|~intruder_message(X1)|~party_of_protocol(X2)), inference(split_conjunct,[status(thm)],[c_0_31])). 0.08/0.44 fof(c_0_39, plain, ![X22, X23]:(((intruder_message(X22)|~intruder_message(pair(X22,X23)))&(intruder_message(X23)|~intruder_message(pair(X22,X23))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intruder_decomposes_pairs])])])])). 0.08/0.44 fof(c_0_40, negated_conjecture, ~(?[X1]:((intruder_holds(key(X1,b))&b_holds(key(X1,a))))), inference(assume_negation,[status(cth)],[co1])). 0.08/0.44 cnf(c_0_41, plain, (b_holds(key(X1,X2))|~b_stored(pair(X2,X3))|~party_of_protocol(X2)|~intruder_message(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt))|~intruder_message(encrypt(generate_b_nonce(X3),X1))), inference(spm,[status(thm)],[c_0_32, c_0_33])). 0.08/0.44 cnf(c_0_42, plain, (intruder_message(encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))), inference(spm,[status(thm)],[c_0_34, c_0_35])). 0.08/0.44 cnf(c_0_43, plain, (b_stored(pair(a,an_a_nonce))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_21]), c_0_22])])). 0.08/0.44 cnf(c_0_44, plain, (party_of_protocol(a)), inference(split_conjunct,[status(thm)],[a_is_party_of_protocol])). 0.08/0.44 cnf(c_0_45, plain, (intruder_message(encrypt(X1,X2))|~party_of_protocol(X3)|~intruder_message(X1)|~intruder_message(X2)), inference(spm,[status(thm)],[c_0_37, c_0_38])). 0.08/0.44 cnf(c_0_46, plain, (intruder_message(X1)|~intruder_message(triple(X2,X1,X3))), inference(split_conjunct,[status(thm)],[c_0_27])). 0.08/0.44 cnf(c_0_47, plain, (intruder_message(X1)|~intruder_message(pair(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_39])). 0.08/0.44 cnf(c_0_48, plain, (intruder_message(pair(a,an_a_nonce))), inference(spm,[status(thm)],[c_0_28, c_0_21])). 0.08/0.44 fof(c_0_49, negated_conjecture, ![X8]:((~intruder_holds(key(X8,b))|~b_holds(key(X8,a)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])). 0.08/0.44 cnf(c_0_50, plain, (b_holds(key(an_a_nonce,a))|~intruder_message(encrypt(generate_b_nonce(an_a_nonce),an_a_nonce))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_43]), c_0_44])])). 0.08/0.44 cnf(c_0_51, plain, (intruder_message(encrypt(X1,X2))|~intruder_message(X1)|~intruder_message(X2)), inference(spm,[status(thm)],[c_0_45, c_0_25])). 0.08/0.44 cnf(c_0_52, plain, (intruder_message(generate_b_nonce(an_a_nonce))), inference(spm,[status(thm)],[c_0_46, c_0_35])). 0.08/0.44 cnf(c_0_53, plain, (intruder_message(an_a_nonce)), inference(spm,[status(thm)],[c_0_47, c_0_48])). 0.08/0.44 cnf(c_0_54, negated_conjecture, (~intruder_holds(key(X1,b))|~b_holds(key(X1,a))), inference(split_conjunct,[status(thm)],[c_0_49])). 0.08/0.44 cnf(c_0_55, 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_50, c_0_51]), c_0_52]), c_0_53])])). 0.08/0.44 cnf(c_0_56, negated_conjecture, (~intruder_holds(key(an_a_nonce,b))), inference(spm,[status(thm)],[c_0_54, c_0_55])). 0.08/0.44 cnf(c_0_57, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_38]), c_0_25]), c_0_53])]), ['proof']). 0.08/0.44 % SZS output end CNFRefutation 0.08/0.44 % Parsed axioms : 29 0.08/0.44 % Removed by relevancy pruning/SinE : 6 0.08/0.44 % Initial clauses : 28 0.08/0.44 % Removed in clause preprocessing : 0 0.08/0.44 % Initial clauses in saturation : 28 0.08/0.44 % Processed clauses : 50 0.08/0.44 % ...of these trivial : 0 0.08/0.44 % ...subsumed : 0 0.08/0.44 % ...remaining for further processing : 50 0.08/0.44 % Other redundant clauses eliminated : 0 0.08/0.44 % Clauses deleted for lack of memory : 0 0.08/0.44 % Backward-subsumed : 2 0.08/0.44 % Backward-rewritten : 1 0.08/0.44 % Generated clauses : 39 0.08/0.44 % ...of the previous two non-redundant : 29 0.08/0.44 % ...aggressively subsumed : 0 0.08/0.44 % Contextual simplify-reflections : 0 0.08/0.44 % Paramodulations : 39 0.08/0.44 % Factorizations : 0 0.08/0.44 % NegExts : 0 0.08/0.44 % Equation resolutions : 0 0.08/0.44 % Disequality decompositions : 0 0.08/0.44 % Total rewrite steps : 18 0.08/0.44 % ...of those cached : 9 0.08/0.44 % Propositional unsat checks : 0 0.08/0.44 % Propositional check models : 0 0.08/0.44 % Propositional check unsatisfiable : 0 0.08/0.44 % Propositional clauses : 0 0.08/0.44 % Propositional clauses after purity: 0 0.08/0.44 % Propositional unsat core size : 0 0.08/0.44 % Propositional preprocessing time : 0.000 0.08/0.44 % Propositional encoding time : 0.000 0.08/0.44 % Propositional solver time : 0.000 0.08/0.44 % Success case prop preproc time : 0.000 0.08/0.44 % Success case prop encoding time : 0.000 0.08/0.44 % Success case prop solver time : 0.000 0.08/0.44 % Current number of processed clauses : 47 0.08/0.44 % Positive orientable unit clauses : 21 0.08/0.44 % Positive unorientable unit clauses: 0 0.08/0.44 % Negative unit clauses : 1 0.08/0.44 % Non-unit-clauses : 25 0.08/0.44 % Current number of unprocessed clauses: 3 0.08/0.44 % ...number of literals in the above : 17 0.08/0.44 % Current number of archived formulas : 0 0.08/0.44 % Current number of archived clauses : 3 0.08/0.44 % Clause-clause subsumption calls (NU) : 145 0.08/0.44 % Rec. Clause-clause subsumption calls : 81 0.08/0.44 % Non-unit clause-clause subsumptions : 2 0.08/0.44 % Unit Clause-clause subsumption calls : 10 0.08/0.44 % Rewrite failures with RHS unbound : 0 0.08/0.44 % BW rewrite match attempts : 2 0.08/0.44 % BW rewrite match successes : 1 0.08/0.44 % Condensation attempts : 0 0.08/0.44 % Condensation successes : 0 0.08/0.44 % Termbank termtop insertions : 2843 0.08/0.44 % Search garbage collected termcells : 353 0.08/0.44 0.08/0.44 % ------------------------------------------------- 0.08/0.44 % User time : 0.007 s 0.08/0.44 % System time : 0.002 s 0.08/0.44 % Total time : 0.009 s 0.08/0.44 % Maximum resident set size: 3672 pages 0.08/0.44 0.08/0.44 % ------------------------------------------------- 0.08/0.44 % User time : 0.008 s 0.08/0.44 % System time : 0.008 s 0.08/0.44 % Total time : 0.016 s 0.08/0.44 % Maximum resident set size: 4608 pages 0.08/0.44 % E exiting 0.08/0.44 EOF