0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/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   : n011.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 10:47:25 EDT 2021
0.13/0.34	% CPUTime    : 
0.19/0.37	# No SInE strategy applied
0.19/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
0.19/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.19/0.37	#
0.19/0.37	# Presaturation interreduction done
0.19/0.37	# Number of axioms: 6 Number of unprocessed: 6
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	# 6 beginning clauses after preprocessing and clausification
0.19/0.37	# Creating start rules for all 6 conjectures.
0.19/0.37	# There are 6 start rule candidates:
0.19/0.37	# Found 4 unit axioms.
0.19/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.37	# 6 start rule tableaux created.
0.19/0.37	# 2 extension rule candidate clauses
0.19/0.37	# 4 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 6
0.19/0.37	# Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
0.19/0.37	# We now have 8 tableaux to operate on
0.19/0.37	# Closed tableau found in foldup close cycle with 0 folds and 3 closures done.
0.19/0.37	# There were 0 total branch saturation attempts.
0.19/0.37	# There were 0 of these attempts blocked.
0.19/0.37	# There were 0 deferred branch saturation attempts.
0.19/0.37	# There were 0 free duplicated saturations.
0.19/0.37	# There were 0 total successful branch saturations.
0.19/0.37	# There were 0 successful branch saturations in interreduction.
0.19/0.37	# There were 0 successful branch saturations on the branch.
0.19/0.37	# There were 0 successful branch saturations after the branch.
0.19/0.37	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.37	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.37	# Begin clausification derivation
0.19/0.37	
0.19/0.37	# End clausification derivation
0.19/0.37	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.37	cnf(i_0_4, negated_conjecture, (big_f(X1,esk4_1(X1)))).
0.19/0.37	cnf(i_0_3, negated_conjecture, (big_s(X1,esk6_2(X2,X1)))).
0.19/0.37	cnf(i_0_2, negated_conjecture, (big_f(esk6_2(X1,X2),esk7_2(X1,X2)))).
0.19/0.37	cnf(i_0_1, negated_conjecture, (~big_d(esk7_2(X1,X2),X1,esk5_1(X1)))).
0.19/0.37	cnf(i_0_6, negated_conjecture, (big_d(X1,esk1_0,X2)|~big_s(esk2_1(X2),X1))).
0.19/0.37	cnf(i_0_5, negated_conjecture, (big_d(X1,X2,X3)|~big_d(X4,X5,esk3_1(X3))|~big_f(X5,X2)|~big_f(X4,X1))).
0.19/0.37	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.37	# Begin printing tableau
0.19/0.37	# Found 6 steps
0.19/0.37	cnf(i_0_3, negated_conjecture, (big_s(esk2_1(esk3_1(esk5_1(esk4_1(esk1_0)))),esk6_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))))), inference(start_rule)).
0.19/0.37	cnf(i_0_15, plain, (big_s(esk2_1(esk3_1(esk5_1(esk4_1(esk1_0)))),esk6_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))))), inference(extension_rule, [i_0_6])).
0.19/0.37	cnf(i_0_45, plain, (big_d(esk6_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))),esk1_0,esk3_1(esk5_1(esk4_1(esk1_0))))), inference(extension_rule, [i_0_5])).
0.19/0.37	cnf(i_0_53, plain, (big_d(esk7_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))),esk4_1(esk1_0),esk5_1(esk4_1(esk1_0)))), inference(closure_rule, [i_0_1])).
0.19/0.37	cnf(i_0_55, plain, (~big_f(esk1_0,esk4_1(esk1_0))), inference(closure_rule, [i_0_4])).
0.19/0.37	cnf(i_0_56, plain, (~big_f(esk6_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))),esk7_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))))), inference(closure_rule, [i_0_2])).
0.19/0.37	# End printing tableau
0.19/0.37	# SZS output end
0.19/0.37	# Branches closed with saturation will be marked with an "s"
0.19/0.37	# Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
0.19/0.37	# There were 0 total branch saturation attempts.
0.19/0.37	# There were 0 of these attempts blocked.
0.19/0.37	# There were 0 deferred branch saturation attempts.
0.19/0.37	# There were 0 free duplicated saturations.
0.19/0.37	# There were 0 total successful branch saturations.
0.19/0.37	# There were 0 successful branch saturations in interreduction.
0.19/0.37	# There were 0 successful branch saturations on the branch.
0.19/0.37	# There were 0 successful branch saturations after the branch.
0.19/0.37	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.37	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.37	# Begin clausification derivation
0.19/0.37	
0.19/0.37	# End clausification derivation
0.19/0.37	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.37	cnf(i_0_4, negated_conjecture, (big_f(X1,esk4_1(X1)))).
0.19/0.37	cnf(i_0_3, negated_conjecture, (big_s(X1,esk6_2(X2,X1)))).
0.19/0.37	cnf(i_0_2, negated_conjecture, (big_f(esk6_2(X1,X2),esk7_2(X1,X2)))).
0.19/0.37	cnf(i_0_1, negated_conjecture, (~big_d(esk7_2(X1,X2),X1,esk5_1(X1)))).
0.19/0.37	cnf(i_0_6, negated_conjecture, (big_d(X1,esk1_0,X2)|~big_s(esk2_1(X2),X1))).
0.19/0.37	cnf(i_0_5, negated_conjecture, (big_d(X1,X2,X3)|~big_d(X4,X5,esk3_1(X3))|~big_f(X5,X2)|~big_f(X4,X1))).
0.19/0.37	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.37	# Begin printing tableau
0.19/0.37	# Found 6 steps
0.19/0.37	cnf(i_0_4, negated_conjecture, (big_f(esk1_0,esk4_1(esk1_0))), inference(start_rule)).
0.19/0.37	cnf(i_0_16, plain, (big_f(esk1_0,esk4_1(esk1_0))), inference(extension_rule, [i_0_5])).
0.19/0.37	cnf(i_0_47, plain, (big_d(esk7_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))),esk4_1(esk1_0),esk5_1(esk4_1(esk1_0)))), inference(closure_rule, [i_0_1])).
0.19/0.37	cnf(i_0_50, plain, (~big_f(esk6_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))),esk7_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))))), inference(closure_rule, [i_0_2])).
0.19/0.37	cnf(i_0_48, plain, (~big_d(esk6_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))),esk1_0,esk3_1(esk5_1(esk4_1(esk1_0))))), inference(extension_rule, [i_0_6])).
0.19/0.37	cnf(i_0_88, plain, (~big_s(esk2_1(esk3_1(esk5_1(esk4_1(esk1_0)))),esk6_2(esk4_1(esk1_0),esk2_1(esk3_1(esk5_1(esk4_1(esk1_0))))))), inference(closure_rule, [i_0_3])).
0.19/0.37	# End printing tableau
0.19/0.37	# SZS output end
0.19/0.37	# Branches closed with saturation will be marked with an "s"
0.19/0.37	# Child (18801) has found a proof.
0.19/0.37	
0.19/0.37	# Proof search is over...
0.19/0.37	# Freeing feature tree
0.19/0.37	EOF