0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/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   : n011.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.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 13:30:55 EDT 2021
0.12/0.34	% CPUTime    : 
0.19/0.36	# No SInE strategy applied
0.19/0.36	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.19/0.36	# and selection function SelectNewComplexAHP.
0.19/0.36	#
0.19/0.36	# Presaturation interreduction done
0.19/0.36	# Number of axioms: 6 Number of unprocessed: 6
0.19/0.36	# Tableaux proof search.
0.19/0.36	# APR header successfully linked.
0.19/0.36	# Hello from C++
0.19/0.36	# The folding up rule is enabled...
0.19/0.36	# Local unification is enabled...
0.19/0.36	# Any saturation attempts will use folding labels...
0.19/0.36	# 6 beginning clauses after preprocessing and clausification
0.19/0.36	# Creating start rules for all 1 conjectures.
0.19/0.36	# There are 1 start rule candidates:
0.19/0.36	# Found 6 unit axioms.
0.19/0.36	# 1 start rule tableaux created.
0.19/0.36	# 0 extension rule candidate clauses
0.19/0.36	# 6 unit axiom clauses
0.19/0.36	
0.19/0.36	# Requested 8, 32 cores available to the main process.
0.19/0.36	# There are not enough tableaux to fork, creating more from the initial 1
0.19/0.36	# Creating equality axioms
0.19/0.36	# Ran out of tableaux, making start rules for all clauses
0.19/0.36	# Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
0.19/0.36	# We now have 12 tableaux to operate on
32.04/4.51	# There were 1 total branch saturation attempts.
32.04/4.51	# There were 0 of these attempts blocked.
32.04/4.51	# There were 0 deferred branch saturation attempts.
32.04/4.51	# There were 0 free duplicated saturations.
32.04/4.51	# There were 1 total successful branch saturations.
32.04/4.51	# There were 0 successful branch saturations in interreduction.
32.04/4.51	# There were 0 successful branch saturations on the branch.
32.04/4.51	# There were 1 successful branch saturations after the branch.
32.04/4.51	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
32.04/4.51	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
32.04/4.51	# Begin clausification derivation
32.04/4.51	
32.04/4.51	# End clausification derivation
32.04/4.51	# Begin listing active clauses obtained from FOF to CNF conversion
32.04/4.51	cnf(i_0_8, plain, (multiply(identity,X1)=X1)).
32.04/4.51	cnf(i_0_9, plain, (multiply(inverse(X1),X1)=identity)).
32.04/4.51	cnf(i_0_10, hypothesis, (commutator(commutator(X1,X2),X3)=commutator(X1,commutator(X2,X3)))).
32.04/4.51	cnf(i_0_7, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
32.04/4.51	cnf(i_0_12, plain, (multiply(inverse(X1),multiply(inverse(X2),multiply(X1,X2)))=commutator(X1,X2))).
32.04/4.51	cnf(i_0_11, negated_conjecture, (multiply(commutator(b,c),a)!=multiply(a,commutator(b,c)))).
32.04/4.51	cnf(i_0_14, plain, (X4=X4)).
32.04/4.51	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
32.04/4.51	# Begin printing tableau
32.04/4.51	# Found 6 steps
32.04/4.51	cnf(i_0_10, hypothesis, (commutator(commutator(X11,X2),X3)=commutator(X11,commutator(X2,X3))), inference(start_rule)).
32.04/4.51	cnf(i_0_23, plain, (commutator(commutator(X11,X2),X3)=commutator(X11,commutator(X2,X3))), inference(extension_rule, [i_0_17])).
32.04/4.51	cnf(i_0_49, plain, (commutator(commutator(X11,X2),X3)!=commutator(X11,commutator(X2,X3))), inference(closure_rule, [i_0_10])).
32.04/4.51	cnf(i_0_47, plain, (commutator(commutator(X11,X2),X3)=commutator(commutator(X11,X2),X3)), inference(extension_rule, [i_0_18])).
32.04/4.51	cnf(i_0_56, plain, (multiply(identity,X11)!=X11), inference(closure_rule, [i_0_8])).
32.04/4.51	cnf(i_0_54, plain, (multiply(commutator(commutator(X11,X2),X3),multiply(identity,X11))=multiply(commutator(commutator(X11,X2),X3),X11)), inference(etableau_closure_rule, [i_0_54, ...])).
32.04/4.51	# End printing tableau
32.04/4.51	# SZS output end
32.04/4.51	# Branches closed with saturation will be marked with an "s"
32.04/4.53	# Child (8478) has found a proof.
32.04/4.53	
32.04/4.53	# Proof search is over...
32.04/4.53	# Freeing feature tree
32.04/4.57	EOF