0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/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   : n015.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:24:49 EDT 2021
0.12/0.33	% CPUTime    : 
0.18/0.36	# No SInE strategy applied
0.18/0.36	# Auto-Mode selected heuristic G_E___208_C18_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: 17 Number of unprocessed: 17
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	# 17 beginning clauses after preprocessing and clausification
0.18/0.36	# Creating start rules for all 17 conjectures.
0.18/0.36	# There are 17 start rule candidates:
0.18/0.36	# Found 0 unit axioms.
0.18/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.18/0.36	# 17 start rule tableaux created.
0.18/0.36	# 17 extension rule candidate clauses
0.18/0.36	# 0 unit axiom clauses
0.18/0.36	
0.18/0.36	# Requested 8, 32 cores available to the main process.
11.88/1.86	# There were 8 total branch saturation attempts.
11.88/1.86	# There were 0 of these attempts blocked.
11.88/1.86	# There were 0 deferred branch saturation attempts.
11.88/1.86	# There were 1 free duplicated saturations.
11.88/1.86	# There were 8 total successful branch saturations.
11.88/1.86	# There were 1 successful branch saturations in interreduction.
11.88/1.86	# There were 0 successful branch saturations on the branch.
11.88/1.86	# There were 6 successful branch saturations after the branch.
11.88/1.86	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
11.88/1.86	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
11.88/1.86	# Begin clausification derivation
11.88/1.86	
11.88/1.86	# End clausification derivation
11.88/1.86	# Begin listing active clauses obtained from FOF to CNF conversion
11.88/1.86	cnf(i_0_14, negated_conjecture, (big_f(X1,X2,esk2_3(X2,X1,X3))|big_f(X3,X2,X1))).
11.88/1.86	cnf(i_0_5, negated_conjecture, (big_f(esk2_3(X1,X2,X3),X2,X1)|~big_f(X1,X2,X3))).
11.88/1.86	cnf(i_0_16, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X2,X1,esk2_3(X1,X2,X3))|~big_f(X3,X1,X2))).
11.88/1.86	cnf(i_0_15, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X1,X3,esk2_3(X3,X1,X2))|~big_f(X2,X3,X1))).
11.88/1.86	cnf(i_0_11, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X2,esk2_3(X2,X3,X1),X3)|~big_f(X3,X1,X2))).
11.88/1.86	cnf(i_0_10, negated_conjecture, (big_f(X1,esk2_3(X1,X2,X3),X2)|big_f(X2,X3,X1))).
11.88/1.86	cnf(i_0_13, negated_conjecture, (big_f(X1,X2,esk2_3(X2,X1,X3))|~big_f(X1,X3,X2)|~big_f(X2,X1,X3))).
11.88/1.86	cnf(i_0_12, negated_conjecture, (big_f(X1,X2,X3)|~big_f(X1,esk2_3(X1,X2,X3),X2)|~big_f(X2,X3,X1))).
11.88/1.86	cnf(i_0_7, negated_conjecture, (big_f(X1,X2,X3)|big_f(X3,X1,X2)|~big_f(esk2_3(X3,X1,X2),X1,X3))).
11.88/1.86	cnf(i_0_8, negated_conjecture, (big_f(X1,X2,X3)|big_f(X2,X3,X1)|~big_f(esk2_3(X2,X3,X1),X3,X2))).
11.88/1.86	cnf(i_0_9, negated_conjecture, (big_f(X1,esk2_3(X1,X2,X3),X2)|~big_f(X3,X1,X2)|~big_f(X1,X2,X3))).
11.88/1.86	cnf(i_0_6, negated_conjecture, (big_f(esk2_3(X1,X2,X3),X2,X1)|~big_f(X2,X3,X1)|~big_f(X3,X1,X2))).
11.88/1.86	cnf(i_0_17, negated_conjecture, (big_f(X1,X2,X3)|big_f(X2,X3,X1)|~big_f(esk1_0,esk1_0,esk2_3(X3,X1,X2))|~big_f(X3,X1,X2))).
11.88/1.86	cnf(i_0_4, negated_conjecture, (~big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|~big_f(X3,X1,X2)|~big_f(X2,X3,X1)|~big_f(X1,X2,X3))).
11.88/1.86	cnf(i_0_2, negated_conjecture, (big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|big_f(X2,X3,X1))).
11.88/1.86	cnf(i_0_3, negated_conjecture, (big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|big_f(X3,X1,X2))).
11.88/1.86	cnf(i_0_1, negated_conjecture, (big_f(esk2_3(X1,X2,X3),esk2_3(X1,X2,X3),esk2_3(X1,X2,X3))|big_f(X1,X2,X3))).
11.88/1.86	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
11.88/1.86	# Begin printing tableau
11.88/1.86	# Found 15 steps
11.88/1.86	cnf(i_0_12, negated_conjecture, (big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))|~big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk2_3(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0)),esk1_0)|~big_f(esk1_0,esk2_3(esk1_0,esk1_0,esk1_0),esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0))), inference(start_rule)).
11.88/1.86	cnf(i_0_44, plain, (big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_7])).
11.88/1.86	cnf(i_0_3394, plain, (big_f(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0)), inference(extension_rule, [i_0_8])).
11.88/1.86	cnf(i_0_152779, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(extension_rule, [i_0_9])).
11.88/1.86	cnf(i_0_152780, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(extension_rule, [i_0_13])).
11.88/1.86	cnf(i_0_161757, plain, (~big_f(esk1_0,esk1_0,esk1_0)), inference(closure_rule, [i_0_152780])).
11.88/1.86	cnf(i_0_3393, plain, (big_f(esk1_0,esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_17])).
11.88/1.86	cnf(i_0_46, plain, (~big_f(esk1_0,esk2_3(esk1_0,esk1_0,esk1_0),esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_46, ...])).
11.88/1.86	cnf(i_0_45, plain, (~big_f(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk2_3(esk2_3(esk2_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0,esk2_3(esk1_0,esk1_0,esk1_0)),esk1_0)), inference(etableau_closure_rule, [i_0_45, ...])).
11.88/1.86	cnf(i_0_152795, plain, (big_f(esk1_0,esk2_3(esk1_0,esk1_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_152795, ...])).
11.88/1.86	cnf(i_0_152796, plain, (~big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_152796, ...])).
11.88/1.86	cnf(i_0_161756, plain, (big_f(esk1_0,esk1_0,esk2_3(esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_161756, ...])).
11.88/1.86	cnf(i_0_161793, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_161793, ...])).
11.88/1.86	cnf(i_0_161794, plain, (big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_161794, ...])).
11.88/1.86	cnf(i_0_161796, plain, (~big_f(esk1_0,esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_161796, ...])).
11.88/1.86	# End printing tableau
11.88/1.86	# SZS output end
11.88/1.86	# Branches closed with saturation will be marked with an "s"
11.88/1.87	# Child (29174) has found a proof.
11.88/1.87	
11.88/1.87	# Proof search is over...
11.88/1.87	# Freeing feature tree
11.88/1.87	EOF