0.06/0.11	% 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.33	% Computer   : n026.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 14:50:59 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.36	# No SInE strategy applied
0.12/0.36	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.12/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.12/0.36	#
0.12/0.36	# Presaturation interreduction done
0.12/0.36	# Number of axioms: 2 Number of unprocessed: 2
0.12/0.36	# Tableaux proof search.
0.12/0.36	# APR header successfully linked.
0.12/0.36	# Hello from C++
0.52/0.72	# The folding up rule is enabled...
0.52/0.72	# Local unification is enabled...
0.52/0.72	# Any saturation attempts will use folding labels...
0.52/0.72	# 2 beginning clauses after preprocessing and clausification
0.52/0.72	# Creating start rules for all 1 conjectures.
0.52/0.72	# There are 1 start rule candidates:
0.52/0.72	# Found 2 unit axioms.
0.52/0.72	# 1 start rule tableaux created.
0.52/0.72	# 0 extension rule candidate clauses
0.52/0.72	# 2 unit axiom clauses
0.52/0.72	
0.52/0.72	# Requested 8, 32 cores available to the main process.
0.52/0.72	# There are not enough tableaux to fork, creating more from the initial 1
0.52/0.72	# Creating equality axioms
0.52/0.72	# Ran out of tableaux, making start rules for all clauses
1.00/1.19	# There were 2 total branch saturation attempts.
1.00/1.19	# There were 0 of these attempts blocked.
1.00/1.19	# There were 0 deferred branch saturation attempts.
1.00/1.19	# There were 0 free duplicated saturations.
1.00/1.19	# There were 2 total successful branch saturations.
1.00/1.19	# There were 0 successful branch saturations in interreduction.
1.00/1.19	# There were 0 successful branch saturations on the branch.
1.00/1.19	# There were 2 successful branch saturations after the branch.
1.00/1.19	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
1.00/1.19	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
1.00/1.19	# Begin clausification derivation
1.00/1.19	
1.00/1.19	# End clausification derivation
1.00/1.19	# Begin listing active clauses obtained from FOF to CNF conversion
1.00/1.19	cnf(i_0_4, plain, (multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),X4),inverse(multiply(X2,X4)))))=X3)).
1.00/1.19	cnf(i_0_3, negated_conjecture, (multiply(inverse(b1),b1)!=multiply(inverse(a1),a1))).
1.00/1.19	cnf(i_0_6, plain, (X5=X5)).
1.00/1.19	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
1.00/1.19	# Begin printing tableau
1.00/1.19	# Found 6 steps
1.00/1.19	cnf(i_0_4, plain, (multiply(X22,inverse(multiply(multiply(inverse(multiply(inverse(X23),multiply(inverse(X22),a1))),X24),inverse(multiply(X23,X24)))))=a1), inference(start_rule)).
1.00/1.19	cnf(i_0_12, plain, (multiply(X22,inverse(multiply(multiply(inverse(multiply(inverse(X23),multiply(inverse(X22),a1))),X24),inverse(multiply(X23,X24)))))=a1), inference(extension_rule, [i_0_11])).
1.00/1.19	cnf(i_0_25, plain, (multiply(X29,inverse(multiply(multiply(inverse(multiply(inverse(X28),multiply(inverse(X29),inverse(a1)))),X27),inverse(multiply(X28,X27)))))!=inverse(a1)), inference(closure_rule, [i_0_4])).
1.00/1.19	cnf(i_0_24, plain, (multiply(multiply(X29,inverse(multiply(multiply(inverse(multiply(inverse(X28),multiply(inverse(X29),inverse(a1)))),X27),inverse(multiply(X28,X27))))),multiply(X22,inverse(multiply(multiply(inverse(multiply(inverse(X23),multiply(inverse(X22),a1))),X24),inverse(multiply(X23,X24))))))=multiply(inverse(a1),a1)), inference(extension_rule, [i_0_9])).
1.00/1.19	cnf(i_0_31, plain, (multiply(inverse(b1),b1)=multiply(inverse(a1),a1)), inference(closure_rule, [i_0_3])).
1.00/1.19	cnf(i_0_32, plain, (multiply(inverse(b1),b1)!=multiply(multiply(X29,inverse(multiply(multiply(inverse(multiply(inverse(X28),multiply(inverse(X29),inverse(a1)))),X27),inverse(multiply(X28,X27))))),multiply(X22,inverse(multiply(multiply(inverse(multiply(inverse(X23),multiply(inverse(X22),a1))),X24),inverse(multiply(X23,X24))))))), inference(etableau_closure_rule, [i_0_32, ...])).
1.00/1.19	# End printing tableau
1.00/1.19	# SZS output end
1.00/1.19	# Branches closed with saturation will be marked with an "s"
1.00/1.19	# Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
1.00/1.19	# We now have 7 tableaux to operate on
1.00/1.19	# Found closed tableau during pool population.
1.00/1.19	# Proof search is over...
1.00/1.19	# Freeing feature tree
1.00/1.20	EOF