0.07/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.14/0.36	% Computer   : n027.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 13:54:10 EDT 2021
0.14/0.36	% CPUTime    : 
0.21/0.39	# No SInE strategy applied
0.21/0.39	# Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y
0.21/0.39	# and selection function SelectMaxLComplexAvoidPosPred.
0.21/0.39	#
0.21/0.39	# Number of axioms: 2 Number of unprocessed: 2
0.21/0.39	# Tableaux proof search.
0.21/0.39	# APR header successfully linked.
0.21/0.39	# Hello from C++
0.21/0.44	# The folding up rule is enabled...
0.21/0.44	# Local unification is enabled...
0.21/0.44	# Any saturation attempts will use folding labels...
0.21/0.44	# 2 beginning clauses after preprocessing and clausification
0.21/0.44	# Creating start rules for all 1 conjectures.
0.21/0.44	# There are 1 start rule candidates:
0.21/0.44	# Found 2 unit axioms.
0.21/0.44	# 1 start rule tableaux created.
0.21/0.44	# 0 extension rule candidate clauses
0.21/0.44	# 2 unit axiom clauses
0.21/0.44	
0.21/0.44	# Requested 8, 32 cores available to the main process.
0.21/0.44	# There are not enough tableaux to fork, creating more from the initial 1
0.21/0.44	# Creating equality axioms
0.21/0.44	# Ran out of tableaux, making start rules for all clauses
0.21/0.49	# Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
0.21/0.49	# We now have 10 tableaux to operate on
0.54/0.55	# There were 3 total branch saturation attempts.
0.54/0.55	# There were 0 of these attempts blocked.
0.54/0.55	# There were 0 deferred branch saturation attempts.
0.54/0.55	# There were 0 free duplicated saturations.
0.54/0.55	# There were 3 total successful branch saturations.
0.54/0.55	# There were 0 successful branch saturations in interreduction.
0.54/0.55	# There were 0 successful branch saturations on the branch.
0.54/0.55	# There were 3 successful branch saturations after the branch.
0.54/0.55	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.54/0.55	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.54/0.55	# Begin clausification derivation
0.54/0.55	
0.54/0.55	# End clausification derivation
0.54/0.55	# Begin listing active clauses obtained from FOF to CNF conversion
0.54/0.55	cnf(i_0_4, negated_conjecture, (f(x0,f(x0,x0))!=f(x1,f(x1,x1)))).
0.54/0.55	cnf(i_0_3, plain, (f(f(f(f(X2,X1),f(X1,X3)),X4),f(X1,f(f(X1,f(f(X2,X2),X2)),X3)))=X1)).
0.54/0.55	cnf(i_0_6, plain, (X5=X5)).
0.54/0.55	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.54/0.55	# Begin printing tableau
0.54/0.55	# Found 10 steps
0.54/0.55	cnf(i_0_4, negated_conjecture, (f(x0,f(x0,x0))!=f(x1,f(x1,x1))), inference(start_rule)).
0.54/0.55	cnf(i_0_11, plain, (f(x0,f(x0,x0))!=f(x1,f(x1,x1))), inference(extension_rule, [i_0_10])).
0.54/0.55	cnf(i_0_23, plain, (f(x0,x0)!=f(x1,x1)), inference(extension_rule, [i_0_9])).
0.54/0.55	cnf(i_0_22, plain, (x0!=x1), inference(etableau_closure_rule, [i_0_22, ...])).
0.54/0.55	cnf(i_0_6476, plain, (f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0))))!=f(x0,x0)), inference(extension_rule, [i_0_10])).
0.54/0.55	cnf(i_0_12564, plain, (x0!=f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0)))), inference(closure_rule, [i_0_3])).
0.54/0.55	cnf(i_0_6477, plain, (f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0))))!=f(x1,x1)), inference(extension_rule, [i_0_9])).
0.54/0.55	cnf(i_0_12563, plain, ($false), inference(closure_rule, [i_0_6])).
0.54/0.55	cnf(i_0_12580, plain, (f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0))))!=f(f(f(f(X2,f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0))))),f(f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0)))),X3)),X4),f(f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0)))),f(f(f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0)))),f(f(X2,X2),X2)),X3)))), inference(closure_rule, [i_0_3])).
0.54/0.55	cnf(i_0_12581, plain, (f(f(f(f(X2,f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0))))),f(f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0)))),X3)),X4),f(f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0)))),f(f(f(x0,f(f(f(f(X2,x0),f(x0,x0)),X4),f(x0,f(f(x0,f(f(X2,X2),X2)),x0)))),f(f(X2,X2),X2)),X3)))!=f(x1,x1)), inference(etableau_closure_rule, [i_0_12581, ...])).
0.54/0.55	# End printing tableau
0.54/0.55	# SZS output end
0.54/0.55	# Branches closed with saturation will be marked with an "s"
0.54/0.55	# Child (28277) has found a proof.
0.54/0.55	
0.54/0.55	# Proof search is over...
0.54/0.55	# Freeing feature tree
0.54/0.55	EOF