0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.14/0.34	% Computer   : n014.cluster.edu
0.14/0.34	% Model      : x86_64 x86_64
0.14/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory     : 8042.1875MB
0.14/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 1200
0.14/0.34	% WCLimit    : 120
0.14/0.34	% DateTime   : Tue Jul 13 14:52:04 EDT 2021
0.14/0.34	% CPUTime    : 
0.14/0.37	# No SInE strategy applied
0.14/0.37	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.14/0.37	# and selection function SelectNewComplexAHP.
0.14/0.37	#
0.14/0.37	# Presaturation interreduction done
0.14/0.37	# Number of axioms: 12 Number of unprocessed: 10
0.14/0.37	# Tableaux proof search.
0.14/0.37	# APR header successfully linked.
0.14/0.37	# Hello from C++
0.14/0.37	# The folding up rule is enabled...
0.14/0.37	# Local unification is enabled...
0.14/0.37	# Any saturation attempts will use folding labels...
0.14/0.37	# 10 beginning clauses after preprocessing and clausification
0.14/0.37	# Creating start rules for all 1 conjectures.
0.14/0.37	# There are 1 start rule candidates:
0.14/0.37	# Found 8 unit axioms.
0.14/0.37	# 1 start rule tableaux created.
0.14/0.37	# 2 extension rule candidate clauses
0.14/0.37	# 8 unit axiom clauses
0.14/0.37	
0.14/0.37	# Requested 8, 32 cores available to the main process.
0.14/0.37	# There are not enough tableaux to fork, creating more from the initial 1
0.14/0.37	# Creating equality axioms
0.14/0.37	# Ran out of tableaux, making start rules for all clauses
0.14/0.37	# Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
0.14/0.37	# We now have 17 tableaux to operate on
80.05/10.49	# There were 1 total branch saturation attempts.
80.05/10.49	# There were 0 of these attempts blocked.
80.05/10.49	# There were 0 deferred branch saturation attempts.
80.05/10.49	# There were 0 free duplicated saturations.
80.05/10.49	# There were 1 total successful branch saturations.
80.05/10.49	# There were 0 successful branch saturations in interreduction.
80.05/10.49	# There were 0 successful branch saturations on the branch.
80.05/10.49	# There were 1 successful branch saturations after the branch.
80.05/10.49	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
80.05/10.49	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
80.05/10.49	# Begin clausification derivation
80.05/10.49	
80.05/10.49	# End clausification derivation
80.05/10.49	# Begin listing active clauses obtained from FOF to CNF conversion
80.05/10.49	cnf(i_0_4, plain, (mult(X1,unit)=X1)).
80.05/10.49	cnf(i_0_8, plain, (mult(unit,X1)=X1)).
80.05/10.49	cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)).
80.05/10.49	cnf(i_0_6, plain, (ld(X1,mult(X1,X2))=X2)).
80.05/10.49	cnf(i_0_1, plain, (mult(X1,ld(X1,X2))=X2)).
80.05/10.49	cnf(i_0_2, plain, (rd(mult(X1,X2),X2)=X1)).
80.05/10.49	cnf(i_0_5, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))).
80.05/10.49	cnf(i_0_7, negated_conjecture, (mult(mult(a,b),c)!=mult(a,mult(b,c)))).
80.05/10.49	cnf(i_0_12, plain, (mult(mult(X1,X2),X3)=mult(X1,mult(X2,X3))|mult(X1,mult(X2,X3))=mult(X1,mult(X3,X2)))).
80.05/10.49	cnf(i_0_11, plain, (mult(mult(X1,X2),X3)=mult(mult(X1,X3),X2)|mult(mult(X1,X2),X3)=mult(X1,mult(X2,X3)))).
80.05/10.49	cnf(i_0_26, plain, (X23=X23)).
80.05/10.49	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
80.05/10.49	# Begin printing tableau
80.05/10.49	# Found 6 steps
80.05/10.49	cnf(i_0_4, plain, (mult(X3,unit)=X3), inference(start_rule)).
80.05/10.49	cnf(i_0_33, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_30])).
80.05/10.49	cnf(i_0_59, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_4])).
80.05/10.49	cnf(i_0_57, plain, (ld(mult(X3,unit),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_29])).
80.05/10.49	cnf(i_0_76, plain, (ld(X3,X5)!=mult(ld(X3,X5),unit)), inference(closure_rule, [i_0_4])).
80.05/10.49	cnf(i_0_74, plain, (ld(mult(X3,unit),mult(X5,unit))=mult(ld(X3,X5),unit)), inference(etableau_closure_rule, [i_0_74, ...])).
80.05/10.49	# End printing tableau
80.05/10.49	# SZS output end
80.05/10.49	# Branches closed with saturation will be marked with an "s"
80.05/10.52	# Child (27125) has found a proof.
80.05/10.52	
80.05/10.52	# Proof search is over...
80.05/10.52	# Freeing feature tree
80.05/10.61	EOF