0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/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   : n029.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 15:28:55 EDT 2021
0.13/0.34	% CPUTime    : 
0.19/0.37	# No SInE strategy applied
0.19/0.37	# Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
0.19/0.37	# and selection function SelectNewComplexAHP.
0.19/0.37	#
0.19/0.37	# Presaturation interreduction done
0.19/0.37	# Number of axioms: 12 Number of unprocessed: 11
0.19/0.37	# Tableaux proof search.
0.19/0.37	# APR header successfully linked.
0.19/0.37	# Hello from C++
0.19/0.37	# The folding up rule is enabled...
0.19/0.37	# Local unification is enabled...
0.19/0.37	# Any saturation attempts will use folding labels...
0.19/0.37	# 11 beginning clauses after preprocessing and clausification
0.19/0.37	# Creating start rules for all 2 conjectures.
0.19/0.37	# There are 2 start rule candidates:
0.19/0.37	# Found 11 unit axioms.
0.19/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.37	# 2 start rule tableaux created.
0.19/0.37	# 0 extension rule candidate clauses
0.19/0.37	# 11 unit axiom clauses
0.19/0.37	
0.19/0.37	# Requested 8, 32 cores available to the main process.
0.19/0.37	# There are not enough tableaux to fork, creating more from the initial 2
0.19/0.37	# Creating equality axioms
0.19/0.37	# Ran out of tableaux, making start rules for all clauses
0.19/0.37	# Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
0.19/0.37	# We now have 18 tableaux to operate on
42.26/5.70	# There were 1 total branch saturation attempts.
42.26/5.70	# There were 0 of these attempts blocked.
42.26/5.70	# There were 0 deferred branch saturation attempts.
42.26/5.70	# There were 0 free duplicated saturations.
42.26/5.70	# There were 1 total successful branch saturations.
42.26/5.70	# There were 0 successful branch saturations in interreduction.
42.26/5.70	# There were 0 successful branch saturations on the branch.
42.26/5.70	# There were 1 successful branch saturations after the branch.
42.26/5.70	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
42.26/5.70	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
42.26/5.70	# Begin clausification derivation
42.26/5.70	
42.26/5.70	# End clausification derivation
42.26/5.70	# Begin listing active clauses obtained from FOF to CNF conversion
42.26/5.70	cnf(i_0_22, negated_conjecture, (multiply(a,b)=c)).
42.26/5.70	cnf(i_0_20, plain, (add(additive_identity,X1)=X1)).
42.26/5.70	cnf(i_0_19, plain, (add(X1,additive_identity)=X1)).
42.26/5.70	cnf(i_0_18, plain, (add(X1,additive_inverse(X1))=additive_identity)).
42.26/5.70	cnf(i_0_13, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))).
42.26/5.70	cnf(i_0_17, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
42.26/5.70	cnf(i_0_24, hypothesis, (multiply(X1,multiply(X1,multiply(X1,X1)))=X1)).
42.26/5.70	cnf(i_0_14, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
42.26/5.70	cnf(i_0_16, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
42.26/5.70	cnf(i_0_21, plain, (add(X1,X2)=add(X2,X1))).
42.26/5.70	cnf(i_0_23, negated_conjecture, (multiply(b,a)!=c)).
42.26/5.70	cnf(i_0_27, plain, (X4=X4)).
42.26/5.70	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
42.26/5.70	# Begin printing tableau
42.26/5.70	# Found 5 steps
42.26/5.70	cnf(i_0_22, negated_conjecture, (multiply(a,b)=c), inference(start_rule)).
42.26/5.70	cnf(i_0_34, plain, (multiply(a,b)=c), inference(extension_rule, [i_0_33])).
42.26/5.70	cnf(i_0_59, plain, (additive_inverse(multiply(a,b))=additive_inverse(c)), inference(extension_rule, [i_0_30])).
42.26/5.70	cnf(i_0_67, plain, (additive_inverse(c)!=add(additive_identity,additive_inverse(c))), inference(closure_rule, [i_0_20])).
42.26/5.70	cnf(i_0_65, plain, (additive_inverse(multiply(a,b))=add(additive_identity,additive_inverse(c))), inference(etableau_closure_rule, [i_0_65, ...])).
42.26/5.70	# End printing tableau
42.26/5.70	# SZS output end
42.26/5.70	# Branches closed with saturation will be marked with an "s"
42.26/5.73	# Child (10004) has found a proof.
42.26/5.73	
42.26/5.73	# Proof search is over...
42.26/5.73	# Freeing feature tree
42.26/5.81	EOF