0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/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   : n002.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 14:43:33 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.13/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.13/0.37	#
0.13/0.37	# Presaturation interreduction done
0.13/0.37	# Number of axioms: 6 Number of unprocessed: 6
0.13/0.37	# Tableaux proof search.
0.13/0.37	# APR header successfully linked.
0.13/0.37	# Hello from C++
0.13/0.37	# The folding up rule is enabled...
0.13/0.37	# Local unification is enabled...
0.13/0.37	# Any saturation attempts will use folding labels...
0.13/0.37	# 6 beginning clauses after preprocessing and clausification
0.13/0.37	# Creating start rules for all 1 conjectures.
0.13/0.37	# There are 1 start rule candidates:
0.13/0.37	# Found 5 unit axioms.
0.13/0.37	# 1 start rule tableaux created.
0.13/0.37	# 1 extension rule candidate clauses
0.13/0.37	# 5 unit axiom clauses
0.13/0.37	
0.13/0.37	# Requested 8, 32 cores available to the main process.
0.13/0.37	# There are not enough tableaux to fork, creating more from the initial 1
0.13/0.37	# Creating equality axioms
0.13/0.37	# Ran out of tableaux, making start rules for all clauses
0.13/0.37	# Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
0.13/0.37	# We now have 13 tableaux to operate on
41.90/5.68	# There were 1 total branch saturation attempts.
41.90/5.68	# There were 0 of these attempts blocked.
41.90/5.68	# There were 0 deferred branch saturation attempts.
41.90/5.68	# There were 0 free duplicated saturations.
41.90/5.68	# There were 1 total successful branch saturations.
41.90/5.68	# There were 0 successful branch saturations in interreduction.
41.90/5.68	# There were 0 successful branch saturations on the branch.
41.90/5.68	# There were 1 successful branch saturations after the branch.
41.90/5.68	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
41.90/5.68	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
41.90/5.68	# Begin clausification derivation
41.90/5.68	
41.90/5.68	# End clausification derivation
41.90/5.68	# Begin listing active clauses obtained from FOF to CNF conversion
41.90/5.68	cnf(i_0_4, plain, (ld(X1,mult(X1,X2))=X2)).
41.90/5.68	cnf(i_0_5, plain, (mult(X1,ld(X1,X2))=X2)).
41.90/5.68	cnf(i_0_2, plain, (mult(rd(X1,X2),X2)=X1)).
41.90/5.68	cnf(i_0_6, plain, (rd(mult(X1,X2),X2)=X1)).
41.90/5.68	cnf(i_0_1, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,mult(X3,X2))))).
41.90/5.68	cnf(i_0_3, negated_conjecture, (mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0|mult(ld(esk2_0,esk2_0),esk1_0)!=esk1_0)).
41.90/5.68	cnf(i_0_13, plain, (X19=X19)).
41.90/5.68	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
41.90/5.68	# Begin printing tableau
41.90/5.68	# Found 6 steps
41.90/5.68	cnf(i_0_4, plain, (ld(X7,mult(X7,X4))=X4), inference(start_rule)).
41.90/5.68	cnf(i_0_20, plain, (ld(X7,mult(X7,X4))=X4), inference(extension_rule, [i_0_17])).
41.90/5.68	cnf(i_0_39, plain, (ld(X1,mult(X1,X6))!=X6), inference(closure_rule, [i_0_4])).
41.90/5.68	cnf(i_0_37, plain, (mult(ld(X7,mult(X7,X4)),ld(X1,mult(X1,X6)))=mult(X4,X6)), inference(extension_rule, [i_0_16])).
41.90/5.68	cnf(i_0_54, plain, (mult(X4,X6)!=ld(X1,mult(X1,mult(X4,X6)))), inference(closure_rule, [i_0_4])).
41.90/5.68	cnf(i_0_52, plain, (mult(ld(X7,mult(X7,X4)),ld(X1,mult(X1,X6)))=ld(X1,mult(X1,mult(X4,X6)))), inference(etableau_closure_rule, [i_0_52, ...])).
41.90/5.68	# End printing tableau
41.90/5.68	# SZS output end
41.90/5.68	# Branches closed with saturation will be marked with an "s"
41.90/5.69	# There were 1 total branch saturation attempts.
41.90/5.69	# There were 0 of these attempts blocked.
41.90/5.69	# There were 0 deferred branch saturation attempts.
41.90/5.69	# There were 0 free duplicated saturations.
41.90/5.69	# There were 1 total successful branch saturations.
41.90/5.69	# There were 0 successful branch saturations in interreduction.
41.90/5.69	# There were 0 successful branch saturations on the branch.
41.90/5.69	# There were 1 successful branch saturations after the branch.
41.90/5.69	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
41.90/5.69	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
41.90/5.69	# Begin clausification derivation
41.90/5.69	
41.90/5.69	# End clausification derivation
41.90/5.69	# Begin listing active clauses obtained from FOF to CNF conversion
41.90/5.69	cnf(i_0_4, plain, (ld(X1,mult(X1,X2))=X2)).
41.90/5.69	cnf(i_0_5, plain, (mult(X1,ld(X1,X2))=X2)).
41.90/5.69	cnf(i_0_2, plain, (mult(rd(X1,X2),X2)=X1)).
41.90/5.69	cnf(i_0_6, plain, (rd(mult(X1,X2),X2)=X1)).
41.90/5.69	cnf(i_0_1, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(X2,mult(X3,X2))))).
41.90/5.69	cnf(i_0_3, negated_conjecture, (mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0|mult(ld(esk2_0,esk2_0),esk1_0)!=esk1_0)).
41.90/5.69	cnf(i_0_13, plain, (X19=X19)).
41.90/5.69	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
41.90/5.69	# Begin printing tableau
41.90/5.69	# Found 6 steps
41.90/5.69	cnf(i_0_4, plain, (ld(X9,mult(X9,X6))=X6), inference(start_rule)).
41.90/5.69	cnf(i_0_20, plain, (ld(X9,mult(X9,X6))=X6), inference(extension_rule, [i_0_17])).
41.90/5.69	cnf(i_0_38, plain, (ld(X1,mult(X1,X4))!=X4), inference(closure_rule, [i_0_4])).
41.90/5.69	cnf(i_0_37, plain, (mult(ld(X1,mult(X1,X4)),ld(X9,mult(X9,X6)))=mult(X4,X6)), inference(extension_rule, [i_0_16])).
41.90/5.69	cnf(i_0_54, plain, (mult(X4,X6)!=ld(X1,mult(X1,mult(X4,X6)))), inference(closure_rule, [i_0_4])).
41.90/5.69	cnf(i_0_52, plain, (mult(ld(X1,mult(X1,X4)),ld(X9,mult(X9,X6)))=ld(X1,mult(X1,mult(X4,X6)))), inference(etableau_closure_rule, [i_0_52, ...])).
41.90/5.69	# End printing tableau
41.90/5.69	# SZS output end
41.90/5.69	# Branches closed with saturation will be marked with an "s"
41.90/5.70	# Child (15698) has found a proof.
41.90/5.70	
41.90/5.70	# Proof search is over...
41.90/5.70	# Freeing feature tree
41.90/5.74	EOF