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