%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV010+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:28 PM UTC 2026
% Result : Satisfiable 0.11s 0.44s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_23ERROR: Could not build tree for root c_0_33ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_16,plain,
( ~ fresh_to_b(X1)
| ~ message(sent(X2,b,pair(X2,X1)))
| message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt)))) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_17,plain,
message(sent(a,b,pair(a,an_a_nonce))),
inference(split_conjunct,[status(thm)],[a_sent_message_i_to_b]),
[final] ).
cnf(c_0_18,plain,
fresh_to_b(an_a_nonce),
inference(split_conjunct,[status(thm)],[nonce_a_is_fresh_to_b]),
[final] ).
cnf(c_0_20,plain,
( ~ t_holds(key(X7,X3))
| ~ t_holds(key(X6,X1))
| ~ message(sent(X1,t,triple(X1,X2,encrypt(triple(X3,X4,X5),X6))))
| message(sent(t,X3,triple(encrypt(quadruple(X1,X4,generate_key(X4),X5),X7),encrypt(triple(X3,generate_key(X4),X5),X6),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_21,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_16,c_0_17]),c_0_18])]),
[final] ).
cnf(c_0_22,plain,
t_holds(key(bt,b)),
inference(split_conjunct,[status(thm)],[t_holds_key_bt_for_b]),
[final] ).
cnf(c_0_24,plain,
( ~ a_stored(pair(X1,X5))
| ~ message(sent(t,a,triple(encrypt(quadruple(X1,X5,X4,X6),at),X2,X3)))
| message(sent(a,X1,pair(X2,encrypt(X3,X4)))) ),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_25,plain,
( ~ t_holds(key(X1,a))
| message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),X1),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[final] ).
cnf(c_0_26,plain,
a_stored(pair(b,an_a_nonce)),
inference(split_conjunct,[status(thm)],[a_stored_message_i]),
[final] ).
cnf(c_0_27,plain,
t_holds(key(at,a)),
inference(split_conjunct,[status(thm)],[t_holds_key_at_for_a]),
[final] ).
cnf(c_0_28,plain,
( ~ fresh_to_b(X2)
| ~ message(sent(X1,b,pair(X1,X2)))
| b_stored(pair(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_29,plain,
( ~ b_stored(pair(X1,X3))
| ~ message(sent(X1,b,pair(encrypt(triple(X1,X2,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X2))))
| b_holds(key(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]),
[final] ).
cnf(c_0_30,plain,
message(sent(a,b,pair(encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),generate_key(an_a_nonce))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),
[final] ).
cnf(c_0_31,plain,
b_stored(pair(a,an_a_nonce)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_18])]),
[final] ).
cnf(c_0_32,plain,
( ~ a_stored(pair(X2,X3))
| ~ message(sent(t,a,triple(encrypt(quadruple(X2,X3,X1,X4),at),X5,X6)))
| a_holds(key(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_33,plain,
b_holds(key(generate_key(an_a_nonce),a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[final] ).
cnf(c_0_34,plain,
a_holds(key(generate_key(an_a_nonce),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_26]),c_0_27])]),
[final] ).
cnf(c_0_35,plain,
b_holds(key(bt,t)),
inference(split_conjunct,[status(thm)],[b_hold_key_bt_for_t]),
[final] ).
cnf(c_0_36,plain,
a_holds(key(at,t)),
inference(split_conjunct,[status(thm)],[a_holds_key_at_for_t]),
[final] ).
cnf(c_0_37,plain,
party_of_protocol(b),
inference(split_conjunct,[status(thm)],[b_is_party_of_protocol]),
[final] ).
cnf(c_0_38,plain,
party_of_protocol(a),
inference(split_conjunct,[status(thm)],[a_is_party_of_protocol]),
[final] ).
cnf(c_0_39,plain,
party_of_protocol(t),
inference(split_conjunct,[status(thm)],[t_is_party_of_protocol]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV010+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:26:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2421697 completed with status 1
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUNF-FFSM32-MFFFFFNN
% 0.11/0.44 % partial match(1): FHUNF-FFSF32-MFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 2421706 completed with status 1
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUNF-FFSM32-MFFFFFNN
% 0.11/0.44 % partial match(1): FHUNF-FFSF32-MFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % No proof found!
% 0.11/0.44 % SZS status Satisfiable
% 0.11/0.44 % SZS output start Saturation
% See solution above
% 0.11/0.44 % Parsed axioms : 14
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 16
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 16
% 0.11/0.44 % Processed clauses : 22
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 0
% 0.11/0.44 % ...remaining for further processing : 22
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 6
% 0.11/0.44 % ...of the previous two non-redundant : 6
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 6
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 8
% 0.11/0.44 % ...of those cached : 3
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 22
% 0.11/0.44 % Positive orientable unit clauses : 15
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 0
% 0.11/0.44 % Non-unit-clauses : 7
% 0.11/0.44 % Current number of unprocessed clauses: 0
% 0.11/0.44 % ...number of literals in the above : 0
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 0
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 4
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 4
% 0.11/0.44 % Non-unit clause-clause subsumptions : 0
% 0.11/0.44 % Unit Clause-clause subsumption calls : 3
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 2
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 1337
% 0.11/0.44 % Search garbage collected termcells : 116
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.003 s
% 0.11/0.44 % System time : 0.004 s
% 0.11/0.44 % Total time : 0.007 s
% 0.11/0.44 % Maximum resident set size: 3656 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.012 s
% 0.11/0.44 % System time : 0.010 s
% 0.11/0.44 % Total time : 0.022 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------