0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/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   : n009.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 13:42:57 EDT 2021
0.13/0.34	% CPUTime    : 
0.19/0.37	# No SInE strategy applied
0.19/0.37	# Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
0.19/0.37	# and selection function SelectMaxLComplexAvoidPosPred.
0.19/0.37	#
0.19/0.37	# Presaturation interreduction done
0.19/0.37	# Number of axioms: 14 Number of unprocessed: 13
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	# 13 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 13 unit axioms.
0.19/0.37	# 1 start rule tableaux created.
0.19/0.37	# 0 extension rule candidate clauses
0.19/0.37	# 13 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 25 new_tableaux and 0 remaining starting tableaux.
0.19/0.37	# We now have 25 tableaux to operate on
86.57/11.33	# There were 1 total branch saturation attempts.
86.57/11.33	# There were 0 of these attempts blocked.
86.57/11.33	# There were 0 deferred branch saturation attempts.
86.57/11.33	# There were 0 free duplicated saturations.
86.57/11.33	# There were 1 total successful branch saturations.
86.57/11.33	# There were 0 successful branch saturations in interreduction.
86.57/11.33	# There were 0 successful branch saturations on the branch.
86.57/11.33	# There were 1 successful branch saturations after the branch.
86.57/11.33	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
86.57/11.33	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
86.57/11.33	# Begin clausification derivation
86.57/11.33	
86.57/11.33	# End clausification derivation
86.57/11.33	# Begin listing active clauses obtained from FOF to CNF conversion
86.57/11.33	cnf(i_0_20, plain, (mult(X1,unit)=X1)).
86.57/11.33	cnf(i_0_19, plain, (mult(unit,X1)=X1)).
86.57/11.33	cnf(i_0_15, plain, (mult(f(X1),f(X1))=X1)).
86.57/11.33	cnf(i_0_18, plain, (rd(mult(X1,X2),X2)=X1)).
86.57/11.33	cnf(i_0_25, plain, (mult(X1,ld(X1,X2))=X2)).
86.57/11.33	cnf(i_0_16, plain, (ld(X1,mult(X1,X2))=X2)).
86.57/11.33	cnf(i_0_24, plain, (mult(rd(X1,X2),X2)=X1)).
86.57/11.33	cnf(i_0_23, plain, (ifeq(X1,X1,X2,X3)=X2)).
86.57/11.33	cnf(i_0_28, plain, (mult(mult(X1,X2),X1)=mult(X1,mult(X2,X1)))).
86.57/11.33	cnf(i_0_21, plain, (mult(mult(X1,mult(X2,mult(X3,X2))),X3)=mult(mult(X1,X2),mult(X3,mult(X2,X3))))).
86.57/11.33	cnf(i_0_26, plain, (ifeq(mult(mult(X1,X2),mult(X3,X1)),mult(X1,mult(mult(X2,X3),X1)),mult(X1,mult(X2,mult(X1,X3))),mult(mult(X1,mult(X2,X1)),X3))=mult(mult(X1,mult(X2,X1)),X3))).
86.57/11.33	cnf(i_0_17, plain, (ifeq(mult(X1,mult(X2,mult(X3,X2))),mult(mult(mult(X1,X2),X3),X2),mult(X2,mult(X1,mult(X2,X3))),mult(mult(X2,mult(X1,X2)),X3))=mult(mult(X2,mult(X1,X2)),X3))).
86.57/11.33	cnf(i_0_22, negated_conjecture, (mult(mult(a,mult(b,a)),c)!=mult(a,mult(b,mult(a,c))))).
86.57/11.33	cnf(i_0_30, plain, (X4=X4)).
86.57/11.33	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
86.57/11.33	# Begin printing tableau
86.57/11.33	# Found 8 steps
86.57/11.33	cnf(i_0_20, plain, (mult(X9,unit)=X9), inference(start_rule)).
86.57/11.33	cnf(i_0_39, plain, (mult(X9,unit)=X9), inference(extension_rule, [i_0_37])).
86.57/11.33	cnf(i_0_69, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_20])).
86.57/11.33	cnf(i_0_70, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_20])).
86.57/11.33	cnf(i_0_71, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_20])).
86.57/11.33	cnf(i_0_68, plain, (ifeq(mult(X3,unit),mult(X5,unit),mult(X7,unit),mult(X9,unit))=ifeq(X3,X5,X7,X9)), inference(extension_rule, [i_0_33])).
86.57/11.33	cnf(i_0_82, plain, (ifeq(X3,X5,X7,X9)!=mult(ifeq(X3,X5,X7,X9),unit)), inference(closure_rule, [i_0_20])).
86.57/11.33	cnf(i_0_80, plain, (ifeq(mult(X3,unit),mult(X5,unit),mult(X7,unit),mult(X9,unit))=mult(ifeq(X3,X5,X7,X9),unit)), inference(etableau_closure_rule, [i_0_80, ...])).
86.57/11.33	# End printing tableau
86.57/11.33	# SZS output end
86.57/11.33	# Branches closed with saturation will be marked with an "s"
87.21/11.36	# Child (19751) has found a proof.
87.21/11.36	
87.21/11.36	# Proof search is over...
87.21/11.36	# Freeing feature tree
87.21/11.44	EOF