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   : n020.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   : Tue Jul 13 15:02:21 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.36	# No SInE strategy applied
0.12/0.36	# Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
0.12/0.36	# and selection function SelectMaxLComplexAvoidPosPred.
0.12/0.36	#
0.12/0.36	# Presaturation interreduction done
0.12/0.36	# Number of axioms: 14 Number of unprocessed: 14
0.12/0.36	# Tableaux proof search.
0.12/0.36	# APR header successfully linked.
0.12/0.36	# Hello from C++
0.12/0.36	# The folding up rule is enabled...
0.12/0.36	# Local unification is enabled...
0.12/0.36	# Any saturation attempts will use folding labels...
0.12/0.36	# 14 beginning clauses after preprocessing and clausification
0.12/0.36	# Creating start rules for all 3 conjectures.
0.12/0.36	# There are 3 start rule candidates:
0.12/0.36	# Found 2 unit axioms.
0.12/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.12/0.36	# 3 start rule tableaux created.
0.12/0.36	# 12 extension rule candidate clauses
0.12/0.36	# 2 unit axiom clauses
0.12/0.36	
0.12/0.36	# Requested 8, 32 cores available to the main process.
0.12/0.36	# There are not enough tableaux to fork, creating more from the initial 3
0.12/0.36	# Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
0.12/0.36	# We now have 10 tableaux to operate on
0.19/0.47	# There were 3 total branch saturation attempts.
0.19/0.47	# There were 0 of these attempts blocked.
0.19/0.47	# There were 0 deferred branch saturation attempts.
0.19/0.47	# There were 0 free duplicated saturations.
0.19/0.47	# There were 3 total successful branch saturations.
0.19/0.47	# There were 1 successful branch saturations in interreduction.
0.19/0.47	# There were 0 successful branch saturations on the branch.
0.19/0.47	# There were 2 successful branch saturations after the branch.
0.19/0.47	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.47	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.47	# Begin clausification derivation
0.19/0.47	
0.19/0.47	# End clausification derivation
0.19/0.47	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.47	cnf(i_0_1, plain, (product(X1,X1)=X1)).
0.19/0.47	cnf(i_0_8, plain, (product(product(X1,X2),X3)=product(X1,product(X2,X3)))).
0.19/0.47	cnf(i_0_13, plain, (product(X1,X2)=X2|~r(X1,X2))).
0.19/0.47	cnf(i_0_9, negated_conjecture, (product(esk2_0,product(esk3_0,esk2_0))=esk2_0|d(esk2_0,esk3_0))).
0.19/0.47	cnf(i_0_10, negated_conjecture, (product(esk3_0,product(esk2_0,esk3_0))=esk3_0|d(esk2_0,esk3_0))).
0.19/0.47	cnf(i_0_12, plain, (product(X1,X2)=X2|~r(X2,X1))).
0.19/0.47	cnf(i_0_7, plain, (product(X1,X2)=X1|~l(X2,X1))).
0.19/0.47	cnf(i_0_6, plain, (product(X1,X2)=X1|~l(X1,X2))).
0.19/0.47	cnf(i_0_3, plain, (r(X1,esk1_2(X1,X2))|~d(X1,X2))).
0.19/0.47	cnf(i_0_2, plain, (l(esk1_2(X1,X2),X2)|~d(X1,X2))).
0.19/0.47	cnf(i_0_11, negated_conjecture, (product(esk2_0,product(esk3_0,esk2_0))!=esk2_0|product(esk3_0,product(esk2_0,esk3_0))!=esk3_0|~d(esk2_0,esk3_0))).
0.19/0.47	cnf(i_0_14, plain, (r(X1,X2)|product(X2,X1)!=X1|product(X1,X2)!=X2)).
0.19/0.47	cnf(i_0_5, plain, (l(X1,X2)|product(X1,X2)!=X1|product(X2,X1)!=X2)).
0.19/0.47	cnf(i_0_4, plain, (d(X1,X2)|~l(X3,X2)|~r(X1,X3))).
0.19/0.47	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.47	# Begin printing tableau
0.19/0.47	# Found 10 steps
0.19/0.47	cnf(i_0_9, negated_conjecture, (product(esk2_0,product(esk3_0,esk2_0))=esk2_0|d(esk2_0,esk3_0)), inference(start_rule)).
0.19/0.47	cnf(i_0_20, plain, (product(esk2_0,product(esk3_0,esk2_0))=esk2_0), inference(extension_rule, [i_0_5])).
0.19/0.47	cnf(i_0_177, plain, (l(esk2_0,product(esk3_0,esk2_0))), inference(extension_rule, [i_0_4])).
0.19/0.47	cnf(i_0_21, plain, (d(esk2_0,esk3_0)), inference(etableau_closure_rule, [i_0_21, ...])).
0.19/0.47	cnf(i_0_179, plain, (product(product(esk3_0,esk2_0),esk2_0)!=product(esk3_0,esk2_0)), inference(etableau_closure_rule, [i_0_179, ...])).
0.19/0.47	cnf(i_0_195, plain, (d(esk2_0,product(esk3_0,esk2_0))), inference(extension_rule, [i_0_3])).
0.19/0.47	cnf(i_0_197, plain, (~r(esk2_0,esk2_0)), inference(extension_rule, [i_0_14])).
0.19/0.47	cnf(i_0_5775, plain, (product(esk2_0,esk2_0)!=esk2_0), inference(closure_rule, [i_0_1])).
0.19/0.47	cnf(i_0_5776, plain, (product(esk2_0,esk2_0)!=esk2_0), inference(closure_rule, [i_0_1])).
0.19/0.47	cnf(i_0_5762, plain, (r(esk2_0,esk1_2(esk2_0,product(esk3_0,esk2_0)))), inference(etableau_closure_rule, [i_0_5762, ...])).
0.19/0.47	# End printing tableau
0.19/0.47	# SZS output end
0.19/0.47	# Branches closed with saturation will be marked with an "s"
0.19/0.48	# Child (4705) has found a proof.
0.19/0.48	
0.19/0.48	# Proof search is over...
0.19/0.48	# Freeing feature tree
0.19/0.48	EOF