0.06/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.07/0.29	% Computer   : n026.cluster.edu
0.07/0.29	% Model      : x86_64 x86_64
0.07/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.07/0.29	% Memory     : 8042.1875MB
0.07/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.07/0.29	% CPULimit   : 1200
0.07/0.29	% WCLimit    : 120
0.07/0.29	% DateTime   : Tue Jul 13 13:05:29 EDT 2021
0.07/0.30	% CPUTime    : 
0.11/0.33	# No SInE strategy applied
0.11/0.33	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
0.11/0.33	# and selection function SelectCQIPrecWNTNp.
0.11/0.33	#
0.11/0.33	# Presaturation interreduction done
0.11/0.33	# Number of axioms: 38 Number of unprocessed: 38
0.11/0.33	# Tableaux proof search.
0.11/0.33	# APR header successfully linked.
0.11/0.33	# Hello from C++
0.11/0.33	# The folding up rule is enabled...
0.11/0.33	# Local unification is enabled...
0.11/0.33	# Any saturation attempts will use folding labels...
0.11/0.33	# 38 beginning clauses after preprocessing and clausification
0.11/0.33	# Creating start rules for all 1 conjectures.
0.11/0.33	# There are 1 start rule candidates:
0.11/0.33	# Found 14 unit axioms.
0.11/0.33	# 1 start rule tableaux created.
0.11/0.33	# 24 extension rule candidate clauses
0.11/0.33	# 14 unit axiom clauses
0.11/0.33	
0.11/0.33	# Requested 8, 32 cores available to the main process.
0.11/0.33	# There are not enough tableaux to fork, creating more from the initial 1
0.11/0.33	# Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
0.11/0.33	# We now have 16 tableaux to operate on
0.11/0.34	# There were 1 total branch saturation attempts.
0.11/0.34	# There were 0 of these attempts blocked.
0.11/0.34	# There were 0 deferred branch saturation attempts.
0.11/0.34	# There were 0 free duplicated saturations.
0.11/0.34	# There were 1 total successful branch saturations.
0.11/0.34	# There were 0 successful branch saturations in interreduction.
0.11/0.34	# There were 0 successful branch saturations on the branch.
0.11/0.34	# There were 1 successful branch saturations after the branch.
0.11/0.34	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.11/0.34	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.11/0.34	# Begin clausification derivation
0.11/0.34	
0.11/0.34	# End clausification derivation
0.11/0.34	# Begin listing active clauses obtained from FOF to CNF conversion
0.11/0.34	cnf(i_0_38, plain, (party_of_protocol(b))).
0.11/0.34	cnf(i_0_28, plain, (party_of_protocol(a))).
0.11/0.34	cnf(i_0_22, plain, (fresh_to_b(an_a_nonce))).
0.11/0.34	cnf(i_0_15, plain, (party_of_protocol(t))).
0.11/0.34	cnf(i_0_36, plain, (a_nonce(an_a_nonce))).
0.11/0.34	cnf(i_0_18, plain, (a_nonce(generate_b_nonce(X1)))).
0.11/0.34	cnf(i_0_17, plain, (a_nonce(generate_expiration_time(X1)))).
0.11/0.34	cnf(i_0_24, plain, (t_holds(key(at,a)))).
0.11/0.34	cnf(i_0_13, plain, (t_holds(key(bt,b)))).
0.11/0.34	cnf(i_0_35, plain, (b_holds(key(bt,t)))).
0.11/0.34	cnf(i_0_9, plain, (a_holds(key(at,t)))).
0.11/0.34	cnf(i_0_37, plain, (a_stored(pair(b,an_a_nonce)))).
0.11/0.34	cnf(i_0_23, plain, (message(sent(a,b,pair(a,an_a_nonce))))).
0.11/0.34	cnf(i_0_34, plain, (~a_nonce(generate_key(X1)))).
0.11/0.34	cnf(i_0_32, negated_conjecture, (~b_holds(key(X1,a))|~intruder_holds(key(X1,b)))).
0.11/0.34	cnf(i_0_25, plain, (intruder_message(X1)|~intruder_message(pair(X2,X1)))).
0.11/0.34	cnf(i_0_26, plain, (intruder_message(X1)|~intruder_message(pair(X1,X2)))).
0.11/0.34	cnf(i_0_1, plain, (intruder_message(pair(X1,X2))|~intruder_message(X1)|~intruder_message(X2))).
0.11/0.34	cnf(i_0_21, plain, (intruder_message(X1)|~message(sent(X2,X3,X1)))).
0.11/0.34	cnf(i_0_3, plain, (intruder_message(X1)|~intruder_message(triple(X2,X3,X1)))).
0.11/0.34	cnf(i_0_2, plain, (intruder_message(X1)|~intruder_message(triple(X2,X1,X3)))).
0.11/0.34	cnf(i_0_4, plain, (intruder_message(X1)|~intruder_message(triple(X1,X2,X3)))).
0.11/0.34	cnf(i_0_19, plain, (intruder_holds(key(X1,X2))|~party_of_protocol(X2)|~intruder_message(X1))).
0.11/0.34	cnf(i_0_6, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X4,X1)))).
0.11/0.34	cnf(i_0_5, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X3,X1,X4)))).
0.11/0.34	cnf(i_0_7, plain, (intruder_message(X1)|~intruder_message(quadruple(X2,X1,X3,X4)))).
0.11/0.34	cnf(i_0_8, plain, (intruder_message(X1)|~intruder_message(quadruple(X1,X2,X3,X4)))).
0.11/0.34	cnf(i_0_12, plain, (intruder_message(encrypt(X1,X2))|~intruder_holds(key(X2,X3))|~party_of_protocol(X3)|~intruder_message(X1))).
0.11/0.34	cnf(i_0_33, plain, (intruder_message(triple(X1,X2,X3))|~intruder_message(X1)|~intruder_message(X3)|~intruder_message(X2))).
0.11/0.34	cnf(i_0_29, plain, (intruder_message(X1)|~intruder_holds(key(X1,X2))|~party_of_protocol(X2)|~intruder_message(encrypt(X3,X1)))).
0.11/0.34	cnf(i_0_14, plain, (message(sent(X1,X2,X3))|~party_of_protocol(X1)|~party_of_protocol(X2)|~intruder_message(X3))).
0.11/0.34	cnf(i_0_11, plain, (b_stored(pair(X1,X2))|~message(sent(X1,b,pair(X1,X2)))|~fresh_to_b(X2))).
0.11/0.34	cnf(i_0_16, plain, (intruder_message(quadruple(X1,X2,X3,X4))|~intruder_message(X1)|~intruder_message(X4)|~intruder_message(X3)|~intruder_message(X2))).
0.11/0.34	cnf(i_0_31, plain, (a_holds(key(X1,X2))|~a_stored(pair(X2,X3))|~message(sent(t,a,triple(encrypt(quadruple(X2,X3,X1,X4),at),X5,X6))))).
0.11/0.34	cnf(i_0_20, plain, (b_holds(key(X1,X2))|~b_stored(pair(X2,X3))|~message(sent(X2,b,pair(encrypt(triple(X2,X1,generate_expiration_time(X3)),bt),encrypt(generate_b_nonce(X3),X1)))))).
0.11/0.34	cnf(i_0_30, plain, (message(sent(a,X1,pair(X2,encrypt(X3,X4))))|~a_stored(pair(X1,X5))|~message(sent(t,a,triple(encrypt(quadruple(X1,X5,X4,X6),at),X2,X3))))).
0.11/0.34	cnf(i_0_10, plain, (message(sent(b,t,triple(b,generate_b_nonce(X1),encrypt(triple(X2,X1,generate_expiration_time(X1)),bt))))|~message(sent(X2,b,pair(X2,X1)))|~fresh_to_b(X1))).
0.11/0.34	cnf(i_0_27, plain, (message(sent(t,X1,triple(encrypt(quadruple(X2,X3,generate_key(X3),X4),X5),encrypt(triple(X1,generate_key(X3),X4),X6),X7)))|~a_nonce(X3)|~t_holds(key(X6,X2))|~t_holds(key(X5,X1))|~message(sent(X2,t,triple(X2,X7,encrypt(triple(X1,X3,X4),X6)))))).
0.11/0.34	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.11/0.34	# Begin printing tableau
0.11/0.34	# Found 21 steps
0.11/0.34	cnf(i_0_32, negated_conjecture, (~b_holds(key(quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a),a))|~intruder_holds(key(quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a),b))), inference(start_rule)).
0.11/0.34	cnf(i_0_40, plain, (~intruder_holds(key(quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a),b))), inference(extension_rule, [i_0_19])).
0.11/0.34	cnf(i_0_126, plain, (~party_of_protocol(b)), inference(closure_rule, [i_0_38])).
0.11/0.34	cnf(i_0_127, plain, (~intruder_message(quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a))), inference(extension_rule, [i_0_16])).
0.11/0.34	cnf(i_0_225, plain, (~intruder_message(an_a_nonce)), inference(extension_rule, [i_0_25])).
0.11/0.34	cnf(i_0_226, plain, (~intruder_message(a)), inference(extension_rule, [i_0_26])).
0.11/0.34	cnf(i_0_227, plain, (~intruder_message(pair(pair(a,an_a_nonce),pair(a,an_a_nonce)))), inference(extension_rule, [i_0_1])).
0.11/0.34	cnf(i_0_228, plain, (~intruder_message(pair(a,an_a_nonce))), inference(extension_rule, [i_0_21])).
0.11/0.34	cnf(i_0_256, plain, (~message(sent(a,b,pair(a,an_a_nonce)))), inference(closure_rule, [i_0_23])).
0.11/0.34	cnf(i_0_249, plain, (~intruder_message(pair(a,an_a_nonce))), inference(closure_rule, [i_0_228])).
0.11/0.34	cnf(i_0_251, plain, (~intruder_message(pair(a,an_a_nonce))), inference(closure_rule, [i_0_228])).
0.11/0.34	cnf(i_0_253, plain, (~intruder_message(pair(a,an_a_nonce))), inference(closure_rule, [i_0_228])).
0.11/0.34	cnf(i_0_254, plain, (~intruder_message(pair(a,an_a_nonce))), inference(closure_rule, [i_0_228])).
0.11/0.34	cnf(i_0_39, plain, (~b_holds(key(quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a),a))), inference(extension_rule, [i_0_20])).
0.11/0.34	cnf(i_0_302, plain, (~b_stored(pair(a,an_a_nonce))), inference(extension_rule, [i_0_11])).
0.11/0.34	cnf(i_0_338, plain, (~message(sent(a,b,pair(a,an_a_nonce)))), inference(closure_rule, [i_0_23])).
0.11/0.34	cnf(i_0_339, plain, (~fresh_to_b(an_a_nonce)), inference(closure_rule, [i_0_22])).
0.11/0.34	cnf(i_0_303, plain, (~message(sent(a,b,pair(encrypt(triple(a,quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a)))))), inference(extension_rule, [i_0_14])).
0.11/0.34	cnf(i_0_370, plain, (~party_of_protocol(a)), inference(closure_rule, [i_0_28])).
0.11/0.34	cnf(i_0_371, plain, (~party_of_protocol(b)), inference(closure_rule, [i_0_38])).
0.11/0.34	cnf(i_0_372, plain, (~intruder_message(pair(encrypt(triple(a,quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),quadruple(an_a_nonce,pair(a,an_a_nonce),pair(pair(a,an_a_nonce),pair(a,an_a_nonce)),a))))), inference(etableau_closure_rule, [i_0_372, ...])).
0.11/0.34	# End printing tableau
0.11/0.34	# SZS output end
0.11/0.34	# Branches closed with saturation will be marked with an "s"
0.11/0.34	# Child (2208) has found a proof.
0.11/0.34	
0.11/0.34	# Proof search is over...
0.11/0.34	# Freeing feature tree
0.11/0.34	EOF