0.01/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.01/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.35	% Computer   : n007.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 13:01:49 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.39	# No SInE strategy applied
0.13/0.39	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.13/0.39	# and selection function PSelectComplexExceptUniqMaxHorn.
0.13/0.39	#
0.13/0.39	# Number of axioms: 6 Number of unprocessed: 6
0.13/0.39	# Tableaux proof search.
0.13/0.39	# APR header successfully linked.
0.13/0.39	# Hello from C++
0.13/0.39	# The folding up rule is enabled...
0.13/0.39	# Local unification is enabled...
0.13/0.39	# Any saturation attempts will use folding labels...
0.13/0.39	# 6 beginning clauses after preprocessing and clausification
0.13/0.39	# Creating start rules for all 1 conjectures.
0.13/0.39	# There are 1 start rule candidates:
0.13/0.39	# Found 6 unit axioms.
0.13/0.39	# 1 start rule tableaux created.
0.13/0.39	# 0 extension rule candidate clauses
0.13/0.39	# 6 unit axiom clauses
0.13/0.39	
0.13/0.39	# Requested 8, 32 cores available to the main process.
0.13/0.39	# There are not enough tableaux to fork, creating more from the initial 1
0.13/0.39	# Creating equality axioms
0.13/0.39	# Ran out of tableaux, making start rules for all clauses
0.13/0.39	# Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
0.13/0.39	# We now have 9 tableaux to operate on
3.68/0.85	# There were 1 total branch saturation attempts.
3.68/0.85	# There were 0 of these attempts blocked.
3.68/0.85	# There were 0 deferred branch saturation attempts.
3.68/0.85	# There were 0 free duplicated saturations.
3.68/0.85	# There were 1 total successful branch saturations.
3.68/0.85	# There were 0 successful branch saturations in interreduction.
3.68/0.85	# There were 0 successful branch saturations on the branch.
3.68/0.85	# There were 1 successful branch saturations after the branch.
3.68/0.85	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
3.68/0.85	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
3.68/0.85	# Begin clausification derivation
3.68/0.85	
3.68/0.85	# End clausification derivation
3.68/0.85	# Begin listing active clauses obtained from FOF to CNF conversion
3.68/0.85	cnf(i_0_9, plain, (mult(X1,X1)=X1)).
3.68/0.85	cnf(i_0_8, plain, (mult(mult(X1,X2),mult(X1,X3))=mult(X1,mult(X2,X3)))).
3.68/0.85	cnf(i_0_11, plain, (mult(mult(X1,X2),mult(X3,X2))=mult(mult(X1,X3),X2))).
3.68/0.85	cnf(i_0_12, negated_conjecture, (mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d)))!=mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))))).
3.68/0.85	cnf(i_0_10, plain, (mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4)))=mult(mult(X1,X2),mult(X3,X4)))).
3.68/0.85	cnf(i_0_7, plain, (mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))))=mult(mult(X1,X3),mult(X2,X4)))).
3.68/0.85	cnf(i_0_14, plain, (X5=X5)).
3.68/0.85	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
3.68/0.85	# Begin printing tableau
3.68/0.85	# Found 6 steps
3.68/0.85	cnf(i_0_11, plain, (mult(mult(X7,X2),mult(X3,X2))=mult(mult(X7,X3),X2)), inference(start_rule)).
3.68/0.85	cnf(i_0_21, plain, (mult(mult(X7,X2),mult(X3,X2))=mult(mult(X7,X3),X2)), inference(extension_rule, [i_0_17])).
3.68/0.85	cnf(i_0_42, plain, (mult(mult(X7,X2),mult(X3,X2))!=mult(mult(X7,X3),X2)), inference(closure_rule, [i_0_11])).
3.68/0.85	cnf(i_0_40, plain, (mult(mult(X7,X2),mult(X3,X2))=mult(mult(X7,X2),mult(X3,X2))), inference(extension_rule, [i_0_18])).
3.68/0.85	cnf(i_0_49, plain, (mult(X7,X7)!=X7), inference(closure_rule, [i_0_9])).
3.68/0.85	cnf(i_0_47, plain, (mult(mult(mult(X7,X2),mult(X3,X2)),mult(X7,X7))=mult(mult(mult(X7,X2),mult(X3,X2)),X7)), inference(etableau_closure_rule, [i_0_47, ...])).
3.68/0.85	# End printing tableau
3.68/0.85	# SZS output end
3.68/0.85	# Branches closed with saturation will be marked with an "s"
3.68/0.86	# Child (27885) has found a proof.
3.68/0.86	
3.68/0.86	# Proof search is over...
3.68/0.86	# Freeing feature tree
3.68/0.86	EOF