0.04/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.11	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.31	Computer   : n016.cluster.edu
0.09/0.31	Model      : x86_64 x86_64
0.09/0.31	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.31	RAMPerCPU  : 8042.1875MB
0.09/0.31	OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.31	% CPULimit   : 960
0.09/0.31	% WCLimit    : 120
0.09/0.31	% DateTime   : Tue Aug  9 03:22:42 EDT 2022
0.09/0.31	% CPUTime    : 
0.14/0.34	# No SInE strategy applied
0.14/0.34	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S0Y
0.14/0.34	# and selection function SelectMaxLComplexAvoidPosPred.
0.14/0.34	#
0.14/0.34	# Presaturation interreduction done
0.14/0.34	# Number of axioms: 25 Number of unprocessed: 25
0.14/0.34	# Tableaux proof search.
0.14/0.34	# APR header successfully linked.
0.14/0.34	# Hello from C++
0.14/0.34	# The folding up rule is enabled...
0.14/0.34	# Local unification is enabled...
0.14/0.34	# Any saturation attempts will use folding labels...
0.14/0.34	# 25 beginning clauses after preprocessing and clausification
0.14/0.34	# Creating start rules for all 1 conjectures.
0.14/0.34	# There are 1 start rule candidates:
0.14/0.34	# Found 12 unit axioms.
0.14/0.34	# 1 start rule tableaux created.
0.14/0.34	# 13 extension rule candidate clauses
0.14/0.34	# 12 unit axiom clauses
0.14/0.34	
0.14/0.34	# Requested 8, 32 cores available to the main process.
0.14/0.34	# There are not enough tableaux to fork, creating more from the initial 1
0.14/0.34	# Creating equality axioms
0.14/0.34	# Ran out of tableaux, making start rules for all clauses
0.14/0.34	# Returning from population with 63 new_tableaux and 0 remaining starting tableaux.
0.14/0.34	# We now have 63 tableaux to operate on
0.14/0.38	# There were 1 total branch saturation attempts.
0.14/0.38	# There were 0 of these attempts blocked.
0.14/0.38	# There were 0 deferred branch saturation attempts.
0.14/0.38	# There were 0 free duplicated saturations.
0.14/0.38	# There were 1 total successful branch saturations.
0.14/0.38	# There were 0 successful branch saturations in interreduction.
0.14/0.38	# There were 0 successful branch saturations on the branch.
0.14/0.38	# There were 1 successful branch saturations after the branch.
0.14/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.14/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.14/0.38	# Begin clausification derivation
0.14/0.38	
0.14/0.38	# End clausification derivation
0.14/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.14/0.38	cnf(i_0_17, plain, (p(a))).
0.14/0.38	cnf(i_0_10, plain, (p(kk))).
0.14/0.38	cnf(i_0_21, plain, (p(enc(tmk,pp)))).
0.14/0.38	cnf(i_0_19, plain, (p(i(kk)))).
0.14/0.38	cnf(i_0_7, plain, (i(i(X1))=X1)).
0.14/0.38	cnf(i_0_4, plain, (p(enc(tc,k)))).
0.14/0.38	cnf(i_0_5, plain, (p(enc(w,t1)))).
0.14/0.38	cnf(i_0_25, plain, (p(enc(wk,w)))).
0.14/0.38	cnf(i_0_13, plain, (p(enc(lp,t2)))).
0.14/0.38	cnf(i_0_1, plain, (enc(i(X1),enc(X1,X2))=X2)).
0.14/0.38	cnf(i_0_12, plain, (enc(X1,enc(i(X1),X2))=X2)).
0.14/0.38	cnf(i_0_2, negated_conjecture, (~p(enc(pp,a)))).
0.14/0.38	cnf(i_0_8, plain, (p(i(X1))|~p(X1))).
0.14/0.38	cnf(i_0_24, plain, (p(enc(X1,X2))|~p(X1)|~p(X3)|~p(X2))).
0.14/0.38	cnf(i_0_16, plain, (p(enc(tc,X1))|~p(X1)|~p(X2)|~p(X3))).
0.14/0.38	cnf(i_0_3, plain, (p(enc(enc(i(tc),X1),X2))|~p(X2)|~p(X3)|~p(X1))).
0.14/0.38	cnf(i_0_9, plain, (p(enc(wk,enc(i(tmk),X1)))|~p(X1)|~p(X2)|~p(X3))).
0.14/0.38	cnf(i_0_11, plain, (p(enc(i(enc(i(tc),X1)),X2))|~p(X3)|~p(X2)|~p(X1))).
0.14/0.38	cnf(i_0_18, plain, (p(enc(enc(i(tmk),X1),enc(i(tmk),X2)))|~p(X1)|~p(X3)|~p(X2))).
0.14/0.38	cnf(i_0_6, plain, (p(enc(enc(i(tmk),X1),enc(i(tc),X2)))|~p(X2)|~p(X3)|~p(X1))).
0.14/0.38	cnf(i_0_14, plain, (p(enc(enc(i(wk),X1),enc(i(lp),X2)))|~p(X2)|~p(X1)|~p(X3))).
0.14/0.38	cnf(i_0_15, plain, (p(enc(tmk,enc(i(enc(i(zcmk),X1)),X2)))|~p(X2)|~p(X1)|~p(X3))).
0.14/0.38	cnf(i_0_23, plain, (p(enc(i(enc(i(zcmk),X1)),enc(i(tmk),X2)))|~p(X2)|~p(X1)|~p(X3))).
0.14/0.38	cnf(i_0_22, plain, (p(enc(enc(i(wk),X1),enc(i(enc(i(wk),X2)),X3)))|~p(X1)|~p(X2)|~p(X3))).
0.14/0.38	cnf(i_0_20, plain, (p(enc(enc(i(wk),X1),enc(i(enc(i(tmk),X2)),X3)))|~p(X3)|~p(X1)|~p(X2))).
0.14/0.38	cnf(i_0_127, plain, (X46=X46)).
0.14/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.14/0.38	# Begin printing tableau
0.14/0.38	# Found 6 steps
0.14/0.38	cnf(i_0_17, plain, (p(a)), inference(start_rule)).
0.14/0.38	cnf(i_0_134, plain, (p(a)), inference(extension_rule, [i_0_133])).
0.14/0.38	cnf(i_0_259, plain, (p(enc(pp,a))), inference(closure_rule, [i_0_2])).
0.14/0.38	cnf(i_0_260, plain, (a!=enc(pp,a)), inference(extension_rule, [i_0_130])).
0.14/0.38	cnf(i_0_317, plain, (a!=i(i(a))), inference(closure_rule, [i_0_7])).
0.14/0.38	cnf(i_0_318, plain, (i(i(a))!=enc(pp,a)), inference(etableau_closure_rule, [i_0_318, ...])).
0.14/0.38	# End printing tableau
0.14/0.38	# SZS output end
0.14/0.38	# Branches closed with saturation will be marked with an "s"
0.14/0.38	# Child (28946) has found a proof.
0.14/0.38	
0.14/0.38	# Proof search is over...
0.14/0.38	# Freeing feature tree
0.14/0.38	EOF