0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.12/0.33	% Computer   : n004.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Wed Jul 14 14:08:39 EDT 2021
0.12/0.34	% CPUTime    : 
0.18/0.37	# No SInE strategy applied
0.18/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S0Y
0.18/0.37	# and selection function SelectMaxLComplexAvoidPosPred.
0.18/0.37	#
0.18/0.37	# Presaturation interreduction done
0.18/0.37	# Number of axioms: 29 Number of unprocessed: 29
0.18/0.37	# Tableaux proof search.
0.18/0.37	# APR header successfully linked.
0.18/0.37	# Hello from C++
0.18/0.43	# The folding up rule is enabled...
0.18/0.43	# Local unification is enabled...
0.18/0.43	# Any saturation attempts will use folding labels...
0.18/0.43	# 29 beginning clauses after preprocessing and clausification
0.18/0.43	# Creating start rules for all 1 conjectures.
0.18/0.43	# There are 1 start rule candidates:
0.18/0.43	# Found 18 unit axioms.
0.18/0.43	# 1 start rule tableaux created.
0.18/0.43	# 11 extension rule candidate clauses
0.18/0.43	# 18 unit axiom clauses
0.18/0.43	
0.18/0.43	# Requested 8, 32 cores available to the main process.
0.18/0.43	# There are not enough tableaux to fork, creating more from the initial 1
0.18/0.44	# There were 1 total branch saturation attempts.
0.18/0.44	# There were 0 of these attempts blocked.
0.18/0.44	# There were 0 deferred branch saturation attempts.
0.18/0.44	# There were 0 free duplicated saturations.
0.18/0.44	# There were 1 total successful branch saturations.
0.18/0.44	# There were 0 successful branch saturations in interreduction.
0.18/0.44	# There were 0 successful branch saturations on the branch.
0.18/0.44	# There were 1 successful branch saturations after the branch.
0.18/0.44	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.44	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.44	# Begin clausification derivation
0.18/0.44	
0.18/0.44	# End clausification derivation
0.18/0.44	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.44	cnf(i_0_17, plain, (p(a))).
0.18/0.44	cnf(i_0_12, plain, (p(imp))).
0.18/0.44	cnf(i_0_11, plain, (p(exp))).
0.18/0.44	cnf(i_0_15, plain, (p(kp))).
0.18/0.44	cnf(i_0_29, plain, (p(id))).
0.18/0.44	cnf(i_0_16, plain, (p(data))).
0.18/0.44	cnf(i_0_24, plain, (p(pin))).
0.18/0.44	cnf(i_0_6, plain, (xor(X1,X1)=id)).
0.18/0.44	cnf(i_0_25, plain, (xor(X1,id)=X1)).
0.18/0.44	cnf(i_0_22, plain, (p(crypt(xor(km,pin),pp)))).
0.18/0.44	cnf(i_0_4, plain, (p(crypt(xor(km,imp),rand)))).
0.18/0.44	cnf(i_0_5, plain, (decrypt(X1,crypt(X1,X2))=X2)).
0.18/0.44	cnf(i_0_23, plain, (xor(xor(X1,X2),X3)=xor(X1,xor(X2,X3)))).
0.18/0.44	cnf(i_0_3, plain, (p(crypt(xor(km,xor(imp,kp)),kek)))).
0.18/0.44	cnf(i_0_1, plain, (p(crypt(xor(km,imp),xor(rand,xor(imp,exp)))))).
0.18/0.44	cnf(i_0_7, plain, (p(crypt(xor(imp,rand),kek)))).
0.18/0.44	cnf(i_0_9, plain, (xor(X1,X2)=xor(X2,X1))).
0.18/0.44	cnf(i_0_18, negated_conjecture, (~p(crypt(pp,a)))).
0.18/0.44	cnf(i_0_26, plain, (p(X1)|~p(crypt(X2,X1))|~p(X2))).
0.18/0.44	cnf(i_0_10, plain, (p(crypt(X1,X2))|~p(X2)|~p(X1))).
0.18/0.44	cnf(i_0_14, plain, (p(xor(X1,X2))|~p(X2)|~p(X1))).
0.18/0.44	cnf(i_0_19, plain, (p(decrypt(X1,X2))|~p(crypt(xor(km,data),X1))|~p(X2))).
0.18/0.44	cnf(i_0_28, plain, (p(crypt(X1,X2))|~p(crypt(xor(km,data),X1))|~p(X2))).
0.18/0.44	cnf(i_0_20, plain, (p(crypt(xor(km,xor(kp,X1)),X2))|~p(X1)|~p(X2))).
0.18/0.44	cnf(i_0_27, plain, (p(crypt(xor(X1,X2),X3))|~p(crypt(xor(km,exp),X1))|~p(crypt(xor(km,X2),X3))|~p(X2))).
0.18/0.44	cnf(i_0_2, plain, (p(crypt(xor(km,X1),xor(X2,X3)))|~p(crypt(xor(km,xor(X1,kp)),X2))|~p(X3)|~p(X1))).
0.18/0.44	cnf(i_0_8, plain, (p(crypt(xor(km,xor(X1,kp)),xor(X2,X3)))|~p(crypt(xor(km,xor(kp,X1)),X3))|~p(X2)|~p(X1))).
0.18/0.44	cnf(i_0_13, plain, (p(crypt(xor(km,X1),decrypt(xor(X2,X1),crypt(xor(X3,X4),X5))))|~p(crypt(xor(km,imp),X2))|~p(crypt(xor(X3,X4),X5))|~p(X1))).
0.18/0.44	cnf(i_0_21, plain, (p(crypt(xor(X1,X2),decrypt(xor(X3,X4),crypt(X5,X6))))|~p(crypt(xor(km,imp),X4))|~p(crypt(xor(km,exp),X1))|~p(crypt(X5,X6))|~p(X3))).
0.18/0.44	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.44	# Begin printing tableau
0.18/0.44	# Found 6 steps
0.18/0.44	cnf(i_0_18, negated_conjecture, (~p(crypt(pp,a))), inference(start_rule)).
0.18/0.44	cnf(i_0_30, plain, (~p(crypt(pp,a))), inference(extension_rule, [i_0_28])).
0.18/0.44	cnf(i_0_45, plain, (~p(a)), inference(closure_rule, [i_0_17])).
0.18/0.44	cnf(i_0_44, plain, (~p(crypt(xor(km,data),pp))), inference(extension_rule, [i_0_26])).
0.18/0.44	cnf(i_0_72, plain, (~p(a)), inference(closure_rule, [i_0_17])).
0.18/0.44	cnf(i_0_71, plain, (~p(crypt(a,crypt(xor(km,data),pp)))), inference(etableau_closure_rule, [i_0_71, ...])).
0.18/0.44	# End printing tableau
0.18/0.44	# SZS output end
0.18/0.44	# Branches closed with saturation will be marked with an "s"
0.18/0.44	# Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
0.18/0.44	# We now have 3 tableaux to operate on
0.18/0.44	# Found closed tableau during pool population.
0.18/0.44	# Proof search is over...
0.18/0.44	# Freeing feature tree
0.18/0.44	EOF