0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.09	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.29	Computer   : n019.cluster.edu
0.09/0.29	Model      : x86_64 x86_64
0.09/0.29	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	RAMPerCPU  : 8042.1875MB
0.09/0.29	OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 960
0.09/0.29	% WCLimit    : 120
0.09/0.29	% DateTime   : Tue Aug  9 05:23:21 EDT 2022
0.09/0.29	% CPUTime    : 
0.14/0.32	# No SInE strategy applied
0.14/0.32	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.14/0.32	# and selection function SelectCQIPrecW.
0.14/0.32	#
0.14/0.32	# Presaturation interreduction done
0.14/0.32	# Number of axioms: 28 Number of unprocessed: 28
0.14/0.32	# Tableaux proof search.
0.14/0.32	# APR header successfully linked.
0.14/0.32	# Hello from C++
0.14/0.33	# The folding up rule is enabled...
0.14/0.33	# Local unification is enabled...
0.14/0.33	# Any saturation attempts will use folding labels...
0.14/0.33	# 28 beginning clauses after preprocessing and clausification
0.14/0.33	# Creating start rules for all 1 conjectures.
0.14/0.33	# There are 1 start rule candidates:
0.14/0.33	# Found 17 unit axioms.
0.14/0.33	# 1 start rule tableaux created.
0.14/0.33	# 11 extension rule candidate clauses
0.14/0.33	# 17 unit axiom clauses
0.14/0.33	
0.14/0.33	# Requested 8, 32 cores available to the main process.
0.14/0.33	# There are not enough tableaux to fork, creating more from the initial 1
0.14/0.33	# Creating equality axioms
0.14/0.33	# Ran out of tableaux, making start rules for all clauses
0.14/0.33	# Returning from population with 34 new_tableaux and 0 remaining starting tableaux.
0.14/0.33	# We now have 34 tableaux to operate on
0.14/0.36	# There were 1 total branch saturation attempts.
0.14/0.36	# There were 0 of these attempts blocked.
0.14/0.36	# There were 0 deferred branch saturation attempts.
0.14/0.36	# There were 0 free duplicated saturations.
0.14/0.36	# There were 1 total successful branch saturations.
0.14/0.36	# There were 0 successful branch saturations in interreduction.
0.14/0.36	# There were 0 successful branch saturations on the branch.
0.14/0.36	# There were 1 successful branch saturations after the branch.
0.14/0.36	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.36	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.36	# Begin clausification derivation
0.14/0.36	
0.14/0.36	# End clausification derivation
0.14/0.36	# Begin listing active clauses obtained from FOF to CNF conversion
0.14/0.36	cnf(i_0_30, plain, (r1(esk15_1(X1)))).
0.14/0.36	cnf(i_0_33, plain, (r1(esk18_0))).
0.14/0.36	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.14/0.36	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.14/0.36	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.14/0.36	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.14/0.36	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.14/0.36	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.14/0.36	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.14/0.36	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.14/0.36	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.14/0.36	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.14/0.36	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.14/0.36	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.14/0.36	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.14/0.36	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.14/0.36	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.14/0.36	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.14/0.36	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.14/0.36	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.14/0.36	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.14/0.36	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.14/0.36	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.14/0.36	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.14/0.36	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.14/0.36	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.14/0.36	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.14/0.36	cnf(i_0_40, negated_conjecture, (~r1(X1)|~r1(X2)|~r1(X3)|~r3(X4,X5,X6)|~r2(X7,X8)|~r2(X1,X7)|~r2(X8,X9)|~r2(X10,X11)|~r2(X9,X10)|~r2(X11,X12)|~r2(X12,X4)|~r2(X13,X5)|~r2(X2,X13)|~r2(X3,X14)|~r2(X14,X15)|~r2(X16,X17)|~r2(X15,X16)|~r2(X17,X18)|~r2(X18,X19)|~r2(X19,X20)|~r2(X20,X21)|~r2(X21,X6))).
0.14/0.36	cnf(i_0_156, plain, (X109=X109)).
0.14/0.36	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.14/0.36	# Begin printing tableau
0.14/0.36	# Found 7 steps
0.14/0.36	cnf(i_0_30, plain, (r1(esk15_1(X7))), inference(start_rule)).
0.14/0.36	cnf(i_0_164, plain, (r1(esk15_1(X7))), inference(extension_rule, [i_0_19])).
0.14/0.36	cnf(i_0_230, plain, (~r2(X2,esk15_1(X7))), inference(extension_rule, [i_0_160])).
0.14/0.36	cnf(i_0_343, plain, ($false), inference(closure_rule, [i_0_156])).
0.14/0.36	cnf(i_0_344, plain, (esk18_0!=esk15_1(X7)), inference(extension_rule, [i_0_36])).
0.14/0.36	cnf(i_0_490, plain, (~r1(esk15_1(X7))), inference(closure_rule, [i_0_30])).
0.14/0.36	cnf(i_0_345, plain, (~r2(X2,esk18_0)), inference(etableau_closure_rule, [i_0_345, ...])).
0.14/0.36	# End printing tableau
0.14/0.36	# SZS output end
0.14/0.36	# Branches closed with saturation will be marked with an "s"
0.14/0.36	# There were 1 total branch saturation attempts.
0.14/0.36	# There were 0 of these attempts blocked.
0.14/0.36	# There were 0 deferred branch saturation attempts.
0.14/0.36	# There were 0 free duplicated saturations.
0.14/0.36	# There were 1 total successful branch saturations.
0.14/0.36	# There were 0 successful branch saturations in interreduction.
0.14/0.36	# There were 0 successful branch saturations on the branch.
0.14/0.36	# There were 1 successful branch saturations after the branch.
0.14/0.36	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.36	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.36	# Begin clausification derivation
0.14/0.36	
0.14/0.36	# End clausification derivation
0.14/0.36	# Begin listing active clauses obtained from FOF to CNF conversion
0.14/0.36	cnf(i_0_30, plain, (r1(esk15_1(X1)))).
0.14/0.36	cnf(i_0_33, plain, (r1(esk18_0))).
0.14/0.36	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.14/0.36	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.14/0.36	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.14/0.36	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.14/0.36	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.14/0.36	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.14/0.36	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.14/0.36	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.14/0.36	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.14/0.36	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.14/0.36	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.14/0.36	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.14/0.36	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.14/0.36	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.14/0.36	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.14/0.36	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.14/0.36	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.14/0.36	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.14/0.36	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.14/0.36	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.14/0.36	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.14/0.36	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.14/0.36	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.14/0.36	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.14/0.36	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.14/0.36	cnf(i_0_40, negated_conjecture, (~r1(X1)|~r1(X2)|~r1(X3)|~r3(X4,X5,X6)|~r2(X7,X8)|~r2(X1,X7)|~r2(X8,X9)|~r2(X10,X11)|~r2(X9,X10)|~r2(X11,X12)|~r2(X12,X4)|~r2(X13,X5)|~r2(X2,X13)|~r2(X3,X14)|~r2(X14,X15)|~r2(X16,X17)|~r2(X15,X16)|~r2(X17,X18)|~r2(X18,X19)|~r2(X19,X20)|~r2(X20,X21)|~r2(X21,X6))).
0.14/0.36	cnf(i_0_156, plain, (X109=X109)).
0.14/0.36	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.14/0.36	# Begin printing tableau
0.14/0.36	# Found 6 steps
0.14/0.36	cnf(i_0_33, plain, (r1(esk18_0)), inference(start_rule)).
0.14/0.36	cnf(i_0_165, plain, (r1(esk18_0)), inference(extension_rule, [i_0_36])).
0.14/0.36	cnf(i_0_292, plain, (esk18_0=esk18_0), inference(extension_rule, [i_0_160])).
0.14/0.36	cnf(i_0_564, plain, ($false), inference(closure_rule, [i_0_156])).
0.14/0.36	cnf(i_0_565, plain, (~r2(esk18_0,esk1_1(esk18_0))), inference(closure_rule, [i_0_1])).
0.14/0.36	cnf(i_0_562, plain, (r2(esk18_0,esk1_1(esk18_0))), inference(etableau_closure_rule, [i_0_562, ...])).
0.14/0.36	# End printing tableau
0.14/0.36	# SZS output end
0.14/0.36	# Branches closed with saturation will be marked with an "s"
0.14/0.36	# There were 1 total branch saturation attempts.
0.14/0.36	# There were 0 of these attempts blocked.
0.14/0.36	# There were 0 deferred branch saturation attempts.
0.14/0.36	# There were 0 free duplicated saturations.
0.14/0.36	# There were 1 total successful branch saturations.
0.14/0.36	# There were 0 successful branch saturations in interreduction.
0.14/0.36	# There were 0 successful branch saturations on the branch.
0.14/0.36	# There were 1 successful branch saturations after the branch.
0.14/0.36	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.36	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.36	# Begin clausification derivation
0.14/0.36	
0.14/0.36	# End clausification derivation
0.14/0.36	# Begin listing active clauses obtained from FOF to CNF conversion
0.14/0.36	cnf(i_0_30, plain, (r1(esk15_1(X1)))).
0.14/0.36	cnf(i_0_33, plain, (r1(esk18_0))).
0.14/0.36	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.14/0.36	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.14/0.36	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.14/0.36	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.14/0.36	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.14/0.36	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.14/0.36	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.14/0.36	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.14/0.36	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.14/0.36	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.14/0.36	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.14/0.36	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.14/0.36	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.14/0.36	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.14/0.36	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.14/0.36	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.14/0.36	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.14/0.36	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.14/0.36	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.14/0.36	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.14/0.36	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.14/0.36	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.14/0.36	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.14/0.36	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.14/0.36	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.14/0.36	cnf(i_0_40, negated_conjecture, (~r1(X1)|~r1(X2)|~r1(X3)|~r3(X4,X5,X6)|~r2(X7,X8)|~r2(X1,X7)|~r2(X8,X9)|~r2(X10,X11)|~r2(X9,X10)|~r2(X11,X12)|~r2(X12,X4)|~r2(X13,X5)|~r2(X2,X13)|~r2(X3,X14)|~r2(X14,X15)|~r2(X16,X17)|~r2(X15,X16)|~r2(X17,X18)|~r2(X18,X19)|~r2(X19,X20)|~r2(X20,X21)|~r2(X21,X6))).
0.14/0.36	cnf(i_0_156, plain, (X109=X109)).
0.14/0.36	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.14/0.36	# Begin printing tableau
0.14/0.36	# Found 6 steps
0.14/0.36	cnf(i_0_30, plain, (r1(esk15_1(X6))), inference(start_rule)).
0.14/0.36	cnf(i_0_164, plain, (r1(esk15_1(X6))), inference(extension_rule, [i_0_36])).
0.14/0.36	cnf(i_0_225, plain, (esk15_1(X6)=esk18_0), inference(extension_rule, [i_0_160])).
0.14/0.36	cnf(i_0_686, plain, ($false), inference(closure_rule, [i_0_156])).
0.14/0.36	cnf(i_0_687, plain, (~r2(esk15_1(X6),esk1_1(esk15_1(X6)))), inference(closure_rule, [i_0_1])).
0.14/0.36	cnf(i_0_684, plain, (r2(esk18_0,esk1_1(esk15_1(X6)))), inference(etableau_closure_rule, [i_0_684, ...])).
0.14/0.36	# End printing tableau
0.14/0.36	# SZS output end
0.14/0.36	# Branches closed with saturation will be marked with an "s"
0.14/0.36	# Child (1625) has found a proof.
0.14/0.36	
0.14/0.36	# Proof search is over...
0.14/0.36	# Freeing feature tree
0.14/0.36	EOF