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   : n016.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:46:08 EDT 2021
0.13/0.34	% CPUTime    : 
0.20/0.37	# No SInE strategy applied
0.20/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.20/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.20/0.37	#
0.20/0.37	# Presaturation interreduction done
0.20/0.37	# Number of axioms: 2 Number of unprocessed: 2
0.20/0.37	# Tableaux proof search.
0.20/0.37	# APR header successfully linked.
0.20/0.37	# Hello from C++
0.20/0.47	# The folding up rule is enabled...
0.20/0.47	# Local unification is enabled...
0.20/0.47	# Any saturation attempts will use folding labels...
0.20/0.47	# 2 beginning clauses after preprocessing and clausification
0.20/0.47	# Creating start rules for all 1 conjectures.
0.20/0.47	# There are 1 start rule candidates:
0.20/0.47	# Found 2 unit axioms.
0.20/0.47	# 1 start rule tableaux created.
0.20/0.47	# 0 extension rule candidate clauses
0.20/0.47	# 2 unit axiom clauses
0.20/0.47	
0.20/0.47	# Requested 8, 32 cores available to the main process.
0.20/0.47	# There are not enough tableaux to fork, creating more from the initial 1
0.20/0.47	# Creating equality axioms
0.20/0.47	# Ran out of tableaux, making start rules for all clauses
0.42/0.59	# There were 2 total branch saturation attempts.
0.42/0.59	# There were 0 of these attempts blocked.
0.42/0.59	# There were 0 deferred branch saturation attempts.
0.42/0.59	# There were 0 free duplicated saturations.
0.42/0.59	# There were 2 total successful branch saturations.
0.42/0.59	# There were 0 successful branch saturations in interreduction.
0.42/0.59	# There were 0 successful branch saturations on the branch.
0.42/0.59	# There were 2 successful branch saturations after the branch.
0.42/0.59	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.42/0.59	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.42/0.59	# Begin clausification derivation
0.42/0.59	
0.42/0.59	# End clausification derivation
0.42/0.59	# Begin listing active clauses obtained from FOF to CNF conversion
0.42/0.59	cnf(i_0_3, plain, (inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)))=X2)).
0.42/0.59	cnf(i_0_4, negated_conjecture, (multiply(inverse(b1),b1)!=multiply(inverse(a1),a1))).
0.42/0.59	cnf(i_0_6, plain, (X4=X4)).
0.42/0.59	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.42/0.59	# Begin printing tableau
0.42/0.59	# Found 6 steps
0.42/0.59	cnf(i_0_3, plain, (inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(a1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19)))=a1), inference(start_rule)).
0.42/0.59	cnf(i_0_12, plain, (inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(a1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19)))=a1), inference(extension_rule, [i_0_11])).
0.42/0.59	cnf(i_0_25, plain, (inverse(multiply(inverse(multiply(X23,inverse(multiply(inverse(inverse(a1)),inverse(multiply(X22,inverse(multiply(inverse(X22),X22)))))))),multiply(X23,X22)))!=inverse(a1)), inference(closure_rule, [i_0_3])).
0.42/0.59	cnf(i_0_24, plain, (multiply(inverse(multiply(inverse(multiply(X23,inverse(multiply(inverse(inverse(a1)),inverse(multiply(X22,inverse(multiply(inverse(X22),X22)))))))),multiply(X23,X22))),inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(a1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19))))=multiply(inverse(a1),a1)), inference(extension_rule, [i_0_9])).
0.42/0.59	cnf(i_0_31, plain, (multiply(inverse(b1),b1)=multiply(inverse(a1),a1)), inference(closure_rule, [i_0_4])).
0.42/0.59	cnf(i_0_32, plain, (multiply(inverse(b1),b1)!=multiply(inverse(multiply(inverse(multiply(X23,inverse(multiply(inverse(inverse(a1)),inverse(multiply(X22,inverse(multiply(inverse(X22),X22)))))))),multiply(X23,X22))),inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(a1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19))))), inference(etableau_closure_rule, [i_0_32, ...])).
0.42/0.59	# End printing tableau
0.42/0.59	# SZS output end
0.42/0.59	# Branches closed with saturation will be marked with an "s"
0.42/0.59	# Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
0.42/0.59	# We now have 7 tableaux to operate on
0.42/0.59	# Found closed tableau during pool population.
0.42/0.59	# Proof search is over...
0.42/0.59	# Freeing feature tree
0.42/0.59	EOF