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