0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.12/0.34	Computer   : n012.cluster.edu
0.12/0.34	Model      : x86_64 x86_64
0.12/0.34	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	RAMPerCPU  : 8042.1875MB
0.12/0.34	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 960
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Aug  9 04:01:14 EDT 2022
0.12/0.34	% CPUTime    : 
0.12/0.37	# No SInE strategy applied
0.12/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.12/0.37	# and selection function SelectCQIPrecW.
0.12/0.37	#
0.12/0.37	# Presaturation interreduction done
0.12/0.37	# Number of axioms: 28 Number of unprocessed: 28
0.12/0.37	# Tableaux proof search.
0.12/0.37	# APR header successfully linked.
0.12/0.37	# Hello from C++
0.12/0.38	# The folding up rule is enabled...
0.12/0.38	# Local unification is enabled...
0.12/0.38	# Any saturation attempts will use folding labels...
0.12/0.38	# 28 beginning clauses after preprocessing and clausification
0.12/0.38	# Creating start rules for all 1 conjectures.
0.12/0.38	# There are 1 start rule candidates:
0.12/0.38	# Found 17 unit axioms.
0.12/0.38	# 1 start rule tableaux created.
0.12/0.38	# 11 extension rule candidate clauses
0.12/0.38	# 17 unit axiom clauses
0.12/0.38	
0.12/0.38	# Requested 8, 32 cores available to the main process.
0.12/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.38	# Creating equality axioms
0.12/0.38	# Ran out of tableaux, making start rules for all clauses
0.12/0.38	# Returning from population with 33 new_tableaux and 0 remaining starting tableaux.
0.12/0.38	# We now have 33 tableaux to operate on
0.19/0.39	# There were 1 total branch saturation attempts.
0.19/0.39	# There were 0 of these attempts blocked.
0.19/0.39	# There were 0 deferred branch saturation attempts.
0.19/0.39	# There were 0 free duplicated saturations.
0.19/0.39	# There were 1 total successful branch saturations.
0.19/0.39	# There were 0 successful branch saturations in interreduction.
0.19/0.39	# There were 0 successful branch saturations on the branch.
0.19/0.39	# There were 1 successful branch saturations after the branch.
0.19/0.39	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# Begin clausification derivation
0.19/0.39	
0.19/0.39	# End clausification derivation
0.19/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.39	cnf(i_0_30, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_33, plain, (r1(esk18_0))).
0.19/0.39	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.19/0.39	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.19/0.39	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.19/0.39	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.19/0.39	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.19/0.39	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.19/0.39	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.19/0.39	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.19/0.39	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.19/0.39	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.39	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.19/0.39	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.19/0.39	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.39	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.39	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.39	cnf(i_0_40, negated_conjecture, (~r1(X1)|~r1(X2)|~r3(X3,X3,X4)|~r2(X5,X3)|~r2(X1,X5)|~r2(X2,X6)|~r2(X6,X7)|~r2(X7,X8)|~r2(X8,X4))).
0.19/0.39	cnf(i_0_87, plain, (X96=X96)).
0.19/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.39	# Begin printing tableau
0.19/0.39	# Found 5 steps
0.19/0.39	cnf(i_0_30, plain, (r1(esk15_1(X5))), inference(start_rule)).
0.19/0.39	cnf(i_0_95, plain, (r1(esk15_1(X5))), inference(extension_rule, [i_0_94])).
0.19/0.39	cnf(i_0_194, plain, (r1(esk15_1(X5))), inference(extension_rule, [i_0_36])).
0.19/0.39	cnf(i_0_195, plain, ($false), inference(closure_rule, [i_0_87])).
0.19/0.39	cnf(i_0_197, plain, (esk15_1(X5)=esk18_0), inference(etableau_closure_rule, [i_0_197, ...])).
0.19/0.39	# End printing tableau
0.19/0.39	# SZS output end
0.19/0.39	# Branches closed with saturation will be marked with an "s"
0.19/0.39	# There were 1 total branch saturation attempts.
0.19/0.39	# There were 0 of these attempts blocked.
0.19/0.39	# There were 0 deferred branch saturation attempts.
0.19/0.39	# There were 0 free duplicated saturations.
0.19/0.39	# There were 1 total successful branch saturations.
0.19/0.39	# There were 0 successful branch saturations in interreduction.
0.19/0.39	# There were 0 successful branch saturations on the branch.
0.19/0.39	# There were 1 successful branch saturations after the branch.
0.19/0.39	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# Begin clausification derivation
0.19/0.39	
0.19/0.39	# End clausification derivation
0.19/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.39	cnf(i_0_30, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_33, plain, (r1(esk18_0))).
0.19/0.39	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.19/0.39	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.19/0.39	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.19/0.39	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.19/0.39	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.19/0.39	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.19/0.39	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.19/0.39	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.19/0.39	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.19/0.39	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.39	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.19/0.39	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.19/0.39	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.39	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.39	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.39	cnf(i_0_40, negated_conjecture, (~r1(X1)|~r1(X2)|~r3(X3,X3,X4)|~r2(X5,X3)|~r2(X1,X5)|~r2(X2,X6)|~r2(X6,X7)|~r2(X7,X8)|~r2(X8,X4))).
0.19/0.39	cnf(i_0_87, plain, (X96=X96)).
0.19/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.39	# Begin printing tableau
0.19/0.39	# Found 6 steps
0.19/0.39	cnf(i_0_33, plain, (r1(esk18_0)), inference(start_rule)).
0.19/0.39	cnf(i_0_96, plain, (r1(esk18_0)), inference(extension_rule, [i_0_36])).
0.19/0.39	cnf(i_0_197, plain, (esk18_0=esk18_0), inference(extension_rule, [i_0_91])).
0.19/0.39	cnf(i_0_404, plain, ($false), inference(closure_rule, [i_0_87])).
0.19/0.39	cnf(i_0_405, plain, (~r2(esk18_0,esk1_1(esk18_0))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_402, plain, (r2(esk18_0,esk1_1(esk18_0))), inference(etableau_closure_rule, [i_0_402, ...])).
0.19/0.39	# End printing tableau
0.19/0.39	# SZS output end
0.19/0.39	# Branches closed with saturation will be marked with an "s"
0.19/0.39	# There were 1 total branch saturation attempts.
0.19/0.39	# There were 0 of these attempts blocked.
0.19/0.39	# There were 0 deferred branch saturation attempts.
0.19/0.39	# There were 0 free duplicated saturations.
0.19/0.39	# There were 1 total successful branch saturations.
0.19/0.39	# There were 0 successful branch saturations in interreduction.
0.19/0.39	# There were 0 successful branch saturations on the branch.
0.19/0.39	# There were 1 successful branch saturations after the branch.
0.19/0.39	# There were 1 total branch saturation attempts.
0.19/0.39	# There were 0 of these attempts blocked.
0.19/0.39	# There were 0 deferred branch saturation attempts.
0.19/0.39	# There were 0 free duplicated saturations.
0.19/0.39	# There were 1 total successful branch saturations.
0.19/0.39	# There were 0 successful branch saturations in interreduction.
0.19/0.39	# There were 0 successful branch saturations on the branch.
0.19/0.39	# There were 1 successful branch saturations after the branch.
0.19/0.39	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# Begin clausification derivation
0.19/0.39	
0.19/0.39	# End clausification derivation
0.19/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.39	cnf(i_0_30, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_33, plain, (r1(esk18_0))).
0.19/0.39	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.19/0.39	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.19/0.39	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.19/0.39	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.19/0.39	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.19/0.39	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.19/0.39	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.19/0.39	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.19/0.39	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.19/0.39	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.39	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.19/0.39	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.19/0.39	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.39	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.39	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.39	cnf(i_0_40, negated_conjecture, (~r1(X1)|~r1(X2)|~r3(X3,X3,X4)|~r2(X5,X3)|~r2(X1,X5)|~r2(X2,X6)|~r2(X6,X7)|~r2(X7,X8)|~r2(X8,X4))).
0.19/0.39	cnf(i_0_87, plain, (X96=X96)).
0.19/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.39	# Begin printing tableau
0.19/0.39	# Found 6 steps
0.19/0.39	cnf(i_0_30, plain, (r1(esk15_1(X7))), inference(start_rule)).
0.19/0.39	cnf(i_0_95, plain, (r1(esk15_1(X7))), inference(extension_rule, [i_0_19])).
0.19/0.39	cnf(i_0_148, plain, (~r2(X2,esk15_1(X7))), inference(extension_rule, [i_0_91])).
0.19/0.39	cnf(i_0_235, plain, ($false), inference(closure_rule, [i_0_87])).
0.19/0.39	cnf(i_0_237, plain, (~r2(X2,esk1_1(X2))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_236, plain, (esk1_1(X2)!=esk15_1(X7)), inference(etableau_closure_rule, [i_0_236, ...])).
0.19/0.39	# End printing tableau
0.19/0.39	# SZS output end
0.19/0.39	# Branches closed with saturation will be marked with an "s"
0.19/0.39	# There were 1 total branch saturation attempts.
0.19/0.39	# There were 0 of these attempts blocked.
0.19/0.39	# There were 0 deferred branch saturation attempts.
0.19/0.39	# There were 0 free duplicated saturations.
0.19/0.39	# There were 1 total successful branch saturations.
0.19/0.39	# There were 0 successful branch saturations in interreduction.
0.19/0.39	# There were 0 successful branch saturations on the branch.
0.19/0.39	# There were 1 successful branch saturations after the branch.
0.19/0.39	# Child (24051) has found a proof.
0.19/0.39	
0.19/0.39	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.39	# Begin clausification derivation
0.19/0.39	
0.19/0.39	# End clausification derivation
0.19/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.39	cnf(i_0_30, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_33, plain, (r1(esk18_0))).
0.19/0.39	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.19/0.39	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.19/0.39	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.19/0.39	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.19/0.39	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.19/0.39	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.19/0.39	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.19/0.39	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.19/0.39	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.19/0.39	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.19/0.39	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.19/0.39	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.19/0.39	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.19/0.39	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.19/0.39	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.19/0.39	cnf(i_0_40, negated_conjecture, (~r1(X1)|~r1(X2)|~r3(X3,X3,X4)|~r2(X5,X3)|~r2(X1,X5)|~r2(X2,X6)|~r2(X6,X7)|~r2(X7,X8)|~r2(X8,X4))).
0.19/0.39	cnf(i_0_87, plain, (X96=X96)).
0.19/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.39	# Begin printing tableau
0.19/0.39	# Found 13 steps
0.19/0.39	cnf(i_0_30, plain, (r1(esk15_1(X5))), inference(start_rule)).
0.19/0.39	cnf(i_0_95, plain, (r1(esk15_1(X5))), inference(extension_rule, [i_0_40])).
0.19/0.39	cnf(i_0_165, plain, (~r1(esk15_1(esk1_1(esk1_1(esk15_1(X5)))))), inference(closure_rule, [i_0_30])).
0.19/0.39	cnf(i_0_166, plain, (~r3(esk1_1(esk1_1(esk15_1(X5))),esk1_1(esk1_1(esk15_1(X5))),esk9_2(esk1_1(esk1_1(esk15_1(X5))),esk1_1(esk1_1(esk15_1(X5)))))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_167, plain, (~r2(esk1_1(esk15_1(X5)),esk1_1(esk1_1(esk15_1(X5))))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_168, plain, (~r2(esk15_1(X5),esk1_1(esk15_1(X5)))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_169, plain, (~r2(esk15_1(esk1_1(esk1_1(esk15_1(X5)))),esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5))))))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_170, plain, (~r2(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5))))),esk1_1(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5)))))))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_171, plain, (~r2(esk1_1(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5)))))),esk1_1(esk1_1(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5))))))))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_172, plain, (~r2(esk1_1(esk1_1(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5))))))),esk9_2(esk1_1(esk1_1(esk15_1(X5))),esk1_1(esk1_1(esk15_1(X5)))))), inference(extension_rule, [i_0_91])).
0.19/0.39	cnf(i_0_235, plain, ($false), inference(closure_rule, [i_0_87])).
0.19/0.39	cnf(i_0_237, plain, (~r2(esk1_1(esk1_1(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5))))))),esk1_1(esk1_1(esk1_1(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5)))))))))), inference(closure_rule, [i_0_1])).
0.19/0.39	cnf(i_0_236, plain, (esk1_1(esk1_1(esk1_1(esk1_1(esk15_1(esk1_1(esk1_1(esk15_1(X5))))))))!=esk9_2(esk1_1(esk1_1(esk15_1(X5))),esk1_1(esk1_1(esk15_1(X5))))), inference(etableau_closure_rule, [i_0_236, ...])).
0.19/0.39	# End printing tableau
0.19/0.39	# SZS output end
0.19/0.39	# Branches closed with saturation will be marked with an "s"
0.19/0.39	# Proof search is over...
0.19/0.39	# Freeing feature tree
0.19/0.39	EOF