0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.34	% Computer   : n013.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 12:34:48 EDT 2021
0.13/0.34	% CPUTime    : 
0.19/0.37	# No SInE strategy applied
0.19/0.37	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.19/0.37	# and selection function SelectNewComplexAHP.
0.19/0.37	#
0.19/0.37	# Presaturation interreduction done
0.19/0.37	# Number of axioms: 10 Number of unprocessed: 10
0.19/0.37	# Tableaux proof search.
0.19/0.37	# APR header successfully linked.
0.19/0.37	# Hello from C++
0.19/0.37	# The folding up rule is enabled...
0.19/0.37	# Local unification is enabled...
0.19/0.37	# Any saturation attempts will use folding labels...
0.19/0.37	# 10 beginning clauses after preprocessing and clausification
0.19/0.37	# Creating start rules for all 1 conjectures.
0.19/0.37	# There are 1 start rule candidates:
0.19/0.37	# Found 10 unit axioms.
0.19/0.37	# 1 start rule tableaux created.
0.19/0.37	# 0 extension rule candidate clauses
0.19/0.37	# 10 unit axiom clauses
0.19/0.37	
0.19/0.37	# Requested 8, 32 cores available to the main process.
0.19/0.37	# There are not enough tableaux to fork, creating more from the initial 1
0.19/0.37	# Creating equality axioms
0.19/0.37	# Ran out of tableaux, making start rules for all clauses
0.19/0.37	# Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
0.19/0.37	# We now have 18 tableaux to operate on
104.63/13.56	# There were 1 total branch saturation attempts.
104.63/13.56	# There were 0 of these attempts blocked.
104.63/13.56	# There were 0 deferred branch saturation attempts.
104.63/13.56	# There were 0 free duplicated saturations.
104.63/13.56	# There were 1 total successful branch saturations.
104.63/13.56	# There were 0 successful branch saturations in interreduction.
104.63/13.56	# There were 0 successful branch saturations on the branch.
104.63/13.56	# There were 1 successful branch saturations after the branch.
104.63/13.56	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
104.63/13.56	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
104.63/13.56	# Begin clausification derivation
104.63/13.56	
104.63/13.56	# End clausification derivation
104.63/13.56	# Begin listing active clauses obtained from FOF to CNF conversion
104.63/13.56	cnf(i_0_12, plain, (mult(X1,unit)=X1)).
104.63/13.56	cnf(i_0_11, plain, (mult(unit,X1)=X1)).
104.63/13.56	cnf(i_0_17, plain, (mult(X1,ld(X1,X2))=X2)).
104.63/13.56	cnf(i_0_14, plain, (rd(mult(X1,X2),X2)=X1)).
104.63/13.56	cnf(i_0_18, plain, (ld(X1,mult(X1,X2))=X2)).
104.63/13.56	cnf(i_0_13, plain, (mult(rd(X1,X2),X2)=X1)).
104.63/13.56	cnf(i_0_20, plain, (mult(i(X1),mult(X1,X2))=X2)).
104.63/13.56	cnf(i_0_15, plain, (mult(mult(X1,X2),i(X2))=X1)).
104.63/13.56	cnf(i_0_16, plain, (mult(mult(mult(X1,mult(X2,X3)),X1),X2)=mult(mult(X1,X2),mult(X3,mult(X1,X2))))).
104.63/13.56	cnf(i_0_19, negated_conjecture, (mult(mult(a,mult(mult(b,c),b)),c)!=mult(mult(a,b),mult(mult(c,b),c)))).
104.63/13.56	cnf(i_0_22, plain, (X4=X4)).
104.63/13.56	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
104.63/13.56	# Begin printing tableau
104.63/13.56	# Found 6 steps
104.63/13.56	cnf(i_0_12, plain, (mult(mult(mult(a,b),mult(mult(c,b),c)),unit)=mult(mult(a,b),mult(mult(c,b),c))), inference(start_rule)).
104.63/13.56	cnf(i_0_30, plain, (mult(mult(mult(a,b),mult(mult(c,b),c)),unit)=mult(mult(a,b),mult(mult(c,b),c))), inference(extension_rule, [i_0_25])).
104.63/13.56	cnf(i_0_45, plain, (mult(mult(a,mult(mult(b,c),b)),c)=mult(mult(a,b),mult(mult(c,b),c))), inference(closure_rule, [i_0_19])).
104.63/13.56	cnf(i_0_46, plain, (mult(mult(a,mult(mult(b,c),b)),c)!=mult(mult(mult(a,b),mult(mult(c,b),c)),unit)), inference(extension_rule, [i_0_25])).
104.63/13.56	cnf(i_0_64, plain, (mult(mult(a,mult(mult(b,c),b)),c)!=mult(mult(mult(a,mult(mult(b,c),b)),c),unit)), inference(closure_rule, [i_0_12])).
104.63/13.56	cnf(i_0_65, plain, (mult(mult(mult(a,mult(mult(b,c),b)),c),unit)!=mult(mult(mult(a,b),mult(mult(c,b),c)),unit)), inference(etableau_closure_rule, [i_0_65, ...])).
104.63/13.56	# End printing tableau
104.63/13.56	# SZS output end
104.63/13.56	# Branches closed with saturation will be marked with an "s"
104.63/13.60	# Child (1712) has found a proof.
104.63/13.60	
104.63/13.60	# Proof search is over...
104.63/13.60	# Freeing feature tree
104.63/13.70	EOF