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.33	% Computer   : n021.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 11:19:40 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_C18C___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: 12 Number of unprocessed: 12
0.12/0.36	# Tableaux proof search.
0.12/0.36	# APR header successfully linked.
0.12/0.36	# Hello from C++
0.12/0.36	# The folding up rule is enabled...
0.12/0.36	# Local unification is enabled...
0.12/0.36	# Any saturation attempts will use folding labels...
0.12/0.36	# 12 beginning clauses after preprocessing and clausification
0.12/0.36	# Creating start rules for all 1 conjectures.
0.12/0.36	# There are 1 start rule candidates:
0.12/0.36	# Found 12 unit axioms.
0.12/0.36	# 1 start rule tableaux created.
0.12/0.36	# 0 extension rule candidate clauses
0.12/0.36	# 12 unit axiom clauses
0.12/0.36	
0.12/0.36	# Requested 8, 32 cores available to the main process.
0.12/0.36	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.36	# Creating equality axioms
0.12/0.36	# Ran out of tableaux, making start rules for all clauses
0.12/0.36	# Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
0.12/0.36	# We now have 21 tableaux to operate on
148.12/18.95	# There were 1 total branch saturation attempts.
148.12/18.95	# There were 0 of these attempts blocked.
148.12/18.95	# There were 0 deferred branch saturation attempts.
148.12/18.95	# There were 0 free duplicated saturations.
148.12/18.95	# There were 1 total successful branch saturations.
148.12/18.95	# There were 0 successful branch saturations in interreduction.
148.12/18.95	# There were 0 successful branch saturations on the branch.
148.12/18.95	# There were 1 successful branch saturations after the branch.
148.12/18.95	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
148.12/18.95	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
148.12/18.95	# Begin clausification derivation
148.12/18.95	
148.12/18.95	# End clausification derivation
148.12/18.95	# Begin listing active clauses obtained from FOF to CNF conversion
148.12/18.95	cnf(i_0_20, plain, (mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,op_c)))))))=unit)).
148.12/18.95	cnf(i_0_23, plain, (mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,op_d))))))))=unit)).
148.12/18.95	cnf(i_0_17, plain, (mult(X1,unit)=X1)).
148.12/18.95	cnf(i_0_16, plain, (mult(unit,X1)=X1)).
148.12/18.95	cnf(i_0_21, plain, (mult(X1,ld(X1,X2))=X2)).
148.12/18.95	cnf(i_0_14, plain, (ld(X1,mult(X1,X2))=X2)).
148.12/18.95	cnf(i_0_24, plain, (mult(rd(X1,X2),X2)=X1)).
148.12/18.95	cnf(i_0_22, plain, (rd(mult(X1,X2),X2)=X1)).
148.12/18.95	cnf(i_0_15, plain, (mult(i(X1),mult(X1,X2))=X2)).
148.12/18.95	cnf(i_0_13, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))).
148.12/18.95	cnf(i_0_19, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))).
148.12/18.95	cnf(i_0_18, negated_conjecture, (mult(op_c,op_d)!=mult(op_d,op_c))).
148.12/18.95	cnf(i_0_26, plain, (X4=X4)).
148.12/18.95	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
148.12/18.95	# Begin printing tableau
148.12/18.95	# Found 5 steps
148.12/18.95	cnf(i_0_20, plain, (mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,op_c)))))))=unit), inference(start_rule)).
148.12/18.95	cnf(i_0_34, plain, (mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,op_c)))))))=unit), inference(extension_rule, [i_0_31])).
148.12/18.95	cnf(i_0_57, plain, (i(mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,op_c))))))))=i(unit)), inference(extension_rule, [i_0_29])).
148.12/18.95	cnf(i_0_71, plain, (i(unit)!=mult(i(unit),unit)), inference(closure_rule, [i_0_17])).
148.12/18.95	cnf(i_0_69, plain, (i(mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,mult(op_c,op_c))))))))=mult(i(unit),unit)), inference(etableau_closure_rule, [i_0_69, ...])).
148.12/18.95	# End printing tableau
148.12/18.95	# SZS output end
148.12/18.95	# Branches closed with saturation will be marked with an "s"
148.12/19.02	# Child (22812) has found a proof.
148.12/19.02	
148.12/19.02	# Proof search is over...
148.12/19.02	# Freeing feature tree
148.12/19.18	EOF