0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/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   : n007.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 12:21:49 EDT 2021
0.12/0.34	% CPUTime    : 
0.18/0.36	# No SInE strategy applied
0.18/0.36	# Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.18/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.18/0.36	#
0.18/0.36	# Presaturation interreduction done
0.18/0.36	# Number of axioms: 15 Number of unprocessed: 13
0.18/0.36	# Tableaux proof search.
0.18/0.36	# APR header successfully linked.
0.18/0.36	# Hello from C++
0.18/0.36	# The folding up rule is enabled...
0.18/0.36	# Local unification is enabled...
0.18/0.36	# Any saturation attempts will use folding labels...
0.18/0.36	# 13 beginning clauses after preprocessing and clausification
0.18/0.36	# Creating start rules for all 1 conjectures.
0.18/0.36	# There are 1 start rule candidates:
0.18/0.36	# Found 13 unit axioms.
0.18/0.36	# 1 start rule tableaux created.
0.18/0.36	# 0 extension rule candidate clauses
0.18/0.36	# 13 unit axiom clauses
0.18/0.36	
0.18/0.36	# Requested 8, 32 cores available to the main process.
0.18/0.36	# There are not enough tableaux to fork, creating more from the initial 1
0.18/0.36	# Creating equality axioms
0.18/0.36	# Ran out of tableaux, making start rules for all clauses
0.18/0.36	# Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
0.18/0.36	# We now have 19 tableaux to operate on
0.18/0.56	# There were 1 total branch saturation attempts.
0.18/0.56	# There were 0 of these attempts blocked.
0.18/0.56	# There were 0 deferred branch saturation attempts.
0.18/0.56	# There were 0 free duplicated saturations.
0.18/0.56	# There were 1 total successful branch saturations.
0.18/0.56	# There were 0 successful branch saturations in interreduction.
0.18/0.56	# There were 0 successful branch saturations on the branch.
0.18/0.56	# There were 1 successful branch saturations after the branch.
0.18/0.56	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.56	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.56	# Begin clausification derivation
0.18/0.56	
0.18/0.56	# End clausification derivation
0.18/0.56	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.56	cnf(i_0_18, plain, (add(X1,additive_identity)=X1)).
0.18/0.56	cnf(i_0_16, plain, (add(additive_identity,X1)=X1)).
0.18/0.56	cnf(i_0_27, plain, (multiply(X1,multiplicative_identity)=X1)).
0.18/0.56	cnf(i_0_20, plain, (multiply(multiplicative_identity,X1)=X1)).
0.18/0.56	cnf(i_0_21, plain, (add(X1,inverse(X1))=multiplicative_identity)).
0.18/0.56	cnf(i_0_22, plain, (multiply(X1,inverse(X1))=additive_identity)).
0.18/0.56	cnf(i_0_17, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))).
0.18/0.56	cnf(i_0_24, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
0.18/0.56	cnf(i_0_26, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
0.18/0.56	cnf(i_0_28, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))).
0.18/0.56	cnf(i_0_25, plain, (add(X1,X2)=add(X2,X1))).
0.18/0.56	cnf(i_0_19, plain, (multiply(X1,X2)=multiply(X2,X1))).
0.18/0.56	cnf(i_0_30, negated_conjecture, (add(c,add(a,b))!=add(a,add(b,c)))).
0.18/0.56	cnf(i_0_32, plain, (X4=X4)).
0.18/0.56	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.56	# Begin printing tableau
0.18/0.56	# Found 5 steps
0.18/0.56	cnf(i_0_18, plain, (add(X3,additive_identity)=X3), inference(start_rule)).
0.18/0.56	cnf(i_0_39, plain, (add(X3,additive_identity)=X3), inference(extension_rule, [i_0_38])).
0.18/0.56	cnf(i_0_66, plain, (inverse(add(X3,additive_identity))=inverse(X3)), inference(extension_rule, [i_0_35])).
0.18/0.56	cnf(i_0_74, plain, (inverse(X3)!=add(inverse(X3),additive_identity)), inference(closure_rule, [i_0_18])).
0.18/0.56	cnf(i_0_72, plain, (inverse(add(X3,additive_identity))=add(inverse(X3),additive_identity)), inference(etableau_closure_rule, [i_0_72, ...])).
0.18/0.56	# End printing tableau
0.18/0.56	# SZS output end
0.18/0.56	# Branches closed with saturation will be marked with an "s"
0.18/0.57	# Child (1320) has found a proof.
0.18/0.57	
0.18/0.57	# Proof search is over...
0.18/0.57	# Freeing feature tree
0.18/0.57	EOF