0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/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   : n002.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:45:33 EDT 2021
0.12/0.33	% CPUTime    : 
0.19/0.36	# No SInE strategy applied
0.19/0.36	# Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
0.19/0.36	# and selection function SelectNewComplexAHPNS.
0.19/0.36	#
0.19/0.36	# Presaturation interreduction done
0.19/0.36	# Number of axioms: 44 Number of unprocessed: 44
0.19/0.36	# Tableaux proof search.
0.19/0.36	# APR header successfully linked.
0.19/0.36	# 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	# 44 beginning clauses after preprocessing and clausification
0.19/0.37	# Creating start rules for all 2 conjectures.
0.19/0.37	# There are 2 start rule candidates:
0.19/0.37	# Found 18 unit axioms.
0.19/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.37	# 2 start rule tableaux created.
0.19/0.37	# 26 extension rule candidate clauses
0.19/0.37	# 18 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 2
0.19/0.37	# Returning from population with 25 new_tableaux and 0 remaining starting tableaux.
0.19/0.37	# We now have 25 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	# 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/sandbox2/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox2/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_10, plain, (id(X1,X1))).
0.19/0.39	cnf(i_0_13, plain, (r1(esk6_1(X1)))).
0.19/0.39	cnf(i_0_52, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_49, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (id(esk5_1(X1),X1))).
0.19/0.39	cnf(i_0_50, plain, (id(esk14_1(X1),esk16_1(X1)))).
0.19/0.39	cnf(i_0_53, plain, (r3(X1,X2,esk20_2(X1,X2)))).
0.19/0.39	cnf(i_0_57, plain, (r2(X1,esk19_2(X2,X1)))).
0.19/0.39	cnf(i_0_8, plain, (r2(X1,esk3_2(X2,X1)))).
0.19/0.39	cnf(i_0_12, plain, (r3(X1,esk6_1(X1),esk5_1(X1)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk4_2(X1,X2)))).
0.19/0.39	cnf(i_0_7, plain, (id(esk2_2(X1,X2),esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_55, plain, (id(esk18_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_51, plain, (r4(X1,esk15_1(X1),esk14_1(X1)))).
0.19/0.39	cnf(i_0_56, plain, (r3(X1,esk19_2(X1,X2),esk18_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk4_2(X1,X2),X1,esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_54, plain, (r2(esk20_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_9, plain, (r4(X1,esk3_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_31, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))).
0.19/0.39	cnf(i_0_48, plain, (id(X1,esk13_0)|~r1(X1))).
0.19/0.39	cnf(i_0_45, plain, (r1(X1)|~id(X1,esk13_0))).
0.19/0.39	cnf(i_0_40, plain, (id(X1,X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_20, plain, (r1(X1)|~r1(X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_19, plain, (r1(X1)|~r1(X2)|~id(X1,X2))).
0.19/0.39	cnf(i_0_17, plain, (id(X1,esk7_1(X2))|~r2(X2,X1))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,X2)|~id(X2,esk7_1(X1)))).
0.19/0.39	cnf(i_0_26, plain, (r1(esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (id(X1,esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_36, plain, (r3(X1,X2,X3)|~id(X3,esk12_2(X1,X2)))).
0.19/0.39	cnf(i_0_39, plain, (id(X1,esk12_2(X2,X3))|~r3(X2,X3,X1))).
0.19/0.39	cnf(i_0_28, plain, (r1(esk11_1(X1))|r2(esk9_1(X1),esk10_1(X1)))).
0.19/0.39	cnf(i_0_24, plain, (r4(X1,X2,X3)|~id(X3,esk8_2(X1,X2)))).
0.19/0.39	cnf(i_0_23, plain, (id(X1,esk8_2(X2,X3))|~r4(X2,X3,X1))).
0.19/0.39	cnf(i_0_30, plain, (id(X1,X2)|~id(X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))).
0.19/0.39	cnf(i_0_29, plain, (r2(esk9_1(X1),esk10_1(X1))|id(X1,esk11_1(X1)))).
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_58, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))).
0.19/0.39	cnf(i_0_34, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))).
0.19/0.39	cnf(i_0_33, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))).
0.19/0.39	cnf(i_0_1, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
0.19/0.39	cnf(i_0_4, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_41, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_44, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
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 9 steps
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X5,esk22_2(esk20_2(esk21_0,X5),X5))|~r3(esk21_0,X5,esk20_2(esk21_0,X5))|~id(esk20_2(esk21_0,X5),esk20_2(esk21_0,X5))), inference(start_rule)).
0.19/0.39	cnf(i_0_62, plain, (~r3(esk21_0,X5,esk20_2(esk21_0,X5))), inference(closure_rule, [i_0_53])).
0.19/0.39	cnf(i_0_63, plain, (~id(esk20_2(esk21_0,X5),esk20_2(esk21_0,X5))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_61, plain, (id(X5,esk22_2(esk20_2(esk21_0,X5),X5))), inference(extension_rule, [i_0_44])).
0.19/0.39	cnf(i_0_133, plain, (~r4(esk22_2(esk20_2(esk21_0,X5),X5),X6,esk4_2(esk22_2(esk20_2(esk21_0,X5),X5),X6))), inference(closure_rule, [i_0_5])).
0.19/0.39	cnf(i_0_134, plain, (~id(esk4_2(esk22_2(esk20_2(esk21_0,X5),X5),X6),esk4_2(esk22_2(esk20_2(esk21_0,X5),X5),X6))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_135, plain, (~id(X6,X6)), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_132, plain, (r4(X5,X6,esk4_2(esk22_2(esk20_2(esk21_0,X5),X5),X6))), inference(extension_rule, [i_0_23])).
0.19/0.39	cnf(i_0_174, plain, (id(esk4_2(esk22_2(esk20_2(esk21_0,X5),X5),X6),esk8_2(X5,X6))), inference(etableau_closure_rule, [i_0_174, ...])).
0.19/0.39	# End printing tableau
0.19/0.39	# SZS output end
0.19/0.39	# Branches closed with saturation will # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox2/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_10, plain, (id(X1,X1))).
0.19/0.39	cnf(i_0_13, plain, (r1(esk6_1(X1)))).
0.19/0.39	cnf(i_0_52, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_49, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (id(esk5_1(X1),X1))).
0.19/0.39	cnf(i_0_50, plain, (id(esk14_1(X1),esk16_1(X1)))).
0.19/0.39	cnf(i_0_53, plain, (r3(X1,X2,esk20_2(X1,X2)))).
0.19/0.39	cnf(i_0_57, plain, (r2(X1,esk19_2(X2,X1)))).
0.19/0.39	cnf(i_0_8, plain, (r2(X1,esk3_2(X2,X1)))).
0.19/0.39	cnf(i_0_12, plain, (r3(X1,esk6_1(X1),esk5_1(X1)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk4_2(X1,X2)))).
0.19/0.39	cnf(i_0_7, plain, (id(esk2_2(X1,X2),esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_55, plain, (id(esk18_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_51, plain, (r4(X1,esk15_1(X1),esk14_1(X1)))).
0.19/0.39	cnf(i_0_56, plain, (r3(X1,esk19_2(X1,X2),esk18_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk4_2(X1,X2),X1,esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_54, plain, (r2(esk20_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_9, plain, (r4(X1,esk3_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_31, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))).
0.19/0.39	cnf(i_0_48, plain, (id(X1,esk13_0)|~r1(X1))).
0.19/0.39	cnf(i_0_45, plain, (r1(X1)|~id(X1,esk13_0))).
0.19/0.39	cnf(i_0_40, plain, (id(X1,X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_20, plain, (r1(X1)|~r1(X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_19, plain, (r1(X1)|~r1(X2)|~id(X1,X2))).
0.19/0.39	cnf(i_0_17, plain, (id(X1,esk7_1(X2))|~r2(X2,X1))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,X2)|~id(X2,esk7_1(X1)))).
0.19/0.39	cnf(i_0_26, plain, (r1(esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (id(X1,esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_36, plain, (r3(X1,X2,X3)|~id(X3,esk12_2(X1,X2)))).
0.19/0.39	cnf(i_0_39, plain, (id(X1,esk12_2(X2,X3))|~r3(X2,X3,X1))).
0.19/0.39	cnf(i_0_28, plain, (r1(esk11_1(X1))|r2(esk9_1(X1),esk10_1(X1)))).
0.19/0.39	cnf(i_0_24, plain, (r4(X1,X2,X3)|~id(X3,esk8_2(X1,X2)))).
0.19/0.39	cnf(i_0_23, plain, (id(X1,esk8_2(X2,X3))|~r4(X2,X3,X1))).
0.19/0.39	cnf(i_0_30, plain, (id(X1,X2)|~id(X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))).
0.19/0.39	cnf(i_0_29, plain, (r2(esk9_1(X1),esk10_1(X1))|id(X1,esk11_1(X1)))).
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_58, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))).
0.19/0.39	cnf(i_0_34, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))).
0.19/0.39	cnf(i_0_33, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))).
0.19/0.39	cnf(i_0_1, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
0.19/0.39	cnf(i_0_4, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_41, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_44, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
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 9 steps
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X8,esk22_2(esk20_2(esk21_0,X8),X8))|~r3(esk21_0,X8,esk20_2(esk21_0,X8))|~id(esk20_2(esk21_0,X8),esk20_2(esk21_0,X8))), inference(start_rule)).
0.19/0.39	cnf(i_0_62, plain, (~r3(esk21_0,X8,esk20_2(esk21_0,X8))), inference(closure_rule, [i_0_53])).
0.19/0.39	cnf(i_0_63, plain, (~id(esk20_2(esk21_0,X8),esk20_2(esk21_0,X8))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_61, plain, (id(X8,esk22_2(esk20_2(esk21_0,X8),X8))), inference(extension_rule, [i_0_41])).
0.19/0.39	cnf(i_0_128, plain, (~r4(X8,X6,esk4_2(X8,X6))), inference(closure_rule, [i_0_5])).
0.19/0.39	cnf(i_0_129, plain, (~id(esk4_2(X8,X6),esk4_2(X8,X6))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_130, plain, (~id(X6,X6)), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_127, plain, (r4(esk22_2(esk20_2(esk21_0,X8),X8),X6,esk4_2(X8,X6))), inference(extension_rule, [i_0_23])).
0.19/0.39	cnf(i_0_174, plain, (id(esk4_2(X8,X6),esk8_2(esk22_2(esk20_2(esk21_0,X8),X8),X6))), inference(etableau_closure_rule, [i_0_174, ...])).
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/sandbox2/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox2/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_10, plain, (id(X1,X1))).
0.19/0.39	cnf(i_0_13, plain, (r1(esk6_1(X1)))).
0.19/0.39	cnf(i_0_52, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_49, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (id(esk5_1(X1),X1))).
0.19/0.39	cnf(i_0_50, plain, (id(esk14_1(X1),esk16_1(X1)))).
0.19/0.39	cnf(i_0_53, plain, (r3(X1,X2,esk20_2(X1,X2)))).
0.19/0.39	cnf(i_0_57, plain, (r2(X1,esk19_2(X2,X1)))).
0.19/0.39	cnf(i_0_8, plain, (r2(X1,esk3_2(X2,X1)))).
0.19/0.39	cnf(i_0_12, plain, (r3(X1,esk6_1(X1),esk5_1(X1)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk4_2(X1,X2)))).
0.19/0.39	cnf(i_0_7, plain, (id(esk2_2(X1,X2),esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_55, plain, (id(esk18_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_51, plain, (r4(X1,esk15_1(X1),esk14_1(X1)))).
0.19/0.39	cnf(i_0_56, plain, (r3(X1,esk19_2(X1,X2),esk18_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk4_2(X1,X2),X1,esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_54, plain, (r2(esk20_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_9, plain, (r4(X1,esk3_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_31, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))).
0.19/0.39	cnf(i_0_48, plain, (id(X1,esk13_0)|~r1(X1))).
0.19/0.39	cnf(i_0_45, plain, (r1(X1)|~id(X1,esk13_0))).
0.19/0.39	cnf(i_0_40, plain, (id(X1,X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_20, plain, (r1(X1)|~r1(X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_19, plain, (r1(X1)|~r1(X2)|~id(X1,X2))).
0.19/0.39	cnf(i_0_17, plain, (id(X1,esk7_1(X2))|~r2(X2,X1))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,X2)|~id(X2,esk7_1(X1)))).
0.19/0.39	cnf(i_0_26, plain, (r1(esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (id(X1,esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_36, plain, (r3(X1,X2,X3)|~id(X3,esk12_2(X1,X2)))).
0.19/0.39	cnf(i_0_39, plain, (id(X1,esk12_2(X2,X3))|~r3(X2,X3,X1))).
0.19/0.39	cnf(i_0_28, plain, (r1(esk11_1(X1))|r2(esk9_1(X1),esk10_1(X1)))).
0.19/0.39	cnf(i_0_24, plain, (r4(X1,X2,X3)|~id(X3,esk8_2(X1,X2)))).
0.19/0.39	cnf(i_0_23, plain, (id(X1,esk8_2(X2,X3))|~r4(X2,X3,X1))).
0.19/0.39	cnf(i_0_30, plain, (id(X1,X2)|~id(X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))).
0.19/0.39	cnf(i_0_29, plain, (r2(esk9_1(X1),esk10_1(X1))|id(X1,esk11_1(X1)))).
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_58, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))).
0.19/0.39	cnf(i_0_34, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))).
0.19/0.39	cnf(i_0_33, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))).
0.19/0.39	cnf(i_0_1, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
0.19/0.39	cnf(i_0_4, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_41, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_44, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
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 9 steps
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X6,esk22_2(esk20_2(esk21_0,X6),X6))|~r3(esk21_0,X6,esk20_2(esk21_0,X6))|~id(esk20_2(esk21_0,X6),esk20_2(esk21_0,X6))), inference(start_rule)).
0.19/0.39	cnf(i_0_62, plain, (~r3(esk21_0,X6,esk20_2(esk21_0,X6))), inference(closure_rule, [i_0_53])).
0.19/0.39	cnf(i_0_63, plain, (~id(esk20_2(esk21_0,X6),esk20_2(esk21_0,X6))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_61, plain, (id(X6,esk22_2(esk20_2(esk21_0,X6),X6))), inference(extension_rule, [i_0_44])).
0.19/0.39	cnf(i_0_133, plain, (~r4(X5,esk22_2(esk20_2(esk21_0,X6),X6),esk4_2(X5,esk22_2(esk20_2(esk21_0,X6),X6)))), inference(closure_rule, [i_0_5])).
0.19/0.39	cnf(i_0_134, plain, (~id(esk4_2(X5,esk22_2(esk20_2(esk21_0,X6),X6)),esk4_2(X5,esk22_2(esk20_2(esk21_0,X6),X6)))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_136, plain, (~id(X5,X5)), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_132, plain, (r4(X5,X6,esk4_2(X5,esk22_2(esk20_2(esk21_0,X6),X6)))), inference(extension_rule, [i_0_23])).
0.19/0.39	cnf(i_0_174, plain, (id(esk4_2(X5,esk22_2(esk20_2(esk21_0,X6),X6)),esk8_2(X5,X6))), inference(etableau_closure_rule, [i_0_174, ...])).
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	be marked with an "s"
0.19/0.39	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.39	# SZS output start for /export/starexec/sandbox2/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_10, plain, (id(X1,X1))).
0.19/0.39	cnf(i_0_13, plain, (r1(esk6_1(X1)))).
0.19/0.39	cnf(i_0_52, plain, (r1(esk15_1(X1)))).
0.19/0.39	cnf(i_0_49, plain, (r1(esk16_1(X1)))).
0.19/0.39	cnf(i_0_11, plain, (id(esk5_1(X1),X1))).
0.19/0.39	cnf(i_0_50, plain, (id(esk14_1(X1),esk16_1(X1)))).
0.19/0.39	cnf(i_0_53, plain, (r3(X1,X2,esk20_2(X1,X2)))).
0.19/0.39	cnf(i_0_57, plain, (r2(X1,esk19_2(X2,X1)))).
0.19/0.39	cnf(i_0_8, plain, (r2(X1,esk3_2(X2,X1)))).
0.19/0.39	cnf(i_0_12, plain, (r3(X1,esk6_1(X1),esk5_1(X1)))).
0.19/0.39	cnf(i_0_5, plain, (r4(X1,X2,esk4_2(X1,X2)))).
0.19/0.39	cnf(i_0_7, plain, (id(esk2_2(X1,X2),esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_55, plain, (id(esk18_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_51, plain, (r4(X1,esk15_1(X1),esk14_1(X1)))).
0.19/0.39	cnf(i_0_56, plain, (r3(X1,esk19_2(X1,X2),esk18_2(X1,X2)))).
0.19/0.39	cnf(i_0_6, plain, (r3(esk4_2(X1,X2),X1,esk1_2(X1,X2)))).
0.19/0.39	cnf(i_0_54, plain, (r2(esk20_2(X1,X2),esk17_2(X1,X2)))).
0.19/0.39	cnf(i_0_9, plain, (r4(X1,esk3_2(X1,X2),esk2_2(X1,X2)))).
0.19/0.39	cnf(i_0_31, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))).
0.19/0.39	cnf(i_0_48, plain, (id(X1,esk13_0)|~r1(X1))).
0.19/0.39	cnf(i_0_45, plain, (r1(X1)|~id(X1,esk13_0))).
0.19/0.39	cnf(i_0_40, plain, (id(X1,X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_20, plain, (r1(X1)|~r1(X2)|~id(X2,X1))).
0.19/0.39	cnf(i_0_19, plain, (r1(X1)|~r1(X2)|~id(X1,X2))).
0.19/0.39	cnf(i_0_17, plain, (id(X1,esk7_1(X2))|~r2(X2,X1))).
0.19/0.39	cnf(i_0_14, plain, (r2(X1,X2)|~id(X2,esk7_1(X1)))).
0.19/0.39	cnf(i_0_26, plain, (r1(esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_27, plain, (id(X1,esk11_1(X1))|id(X1,esk10_1(X1)))).
0.19/0.39	cnf(i_0_36, plain, (r3(X1,X2,X3)|~id(X3,esk12_2(X1,X2)))).
0.19/0.39	cnf(i_0_39, plain, (id(X1,esk12_2(X2,X3))|~r3(X2,X3,X1))).
0.19/0.39	cnf(i_0_28, plain, (r1(esk11_1(X1))|r2(esk9_1(X1),esk10_1(X1)))).
0.19/0.39	cnf(i_0_24, plain, (r4(X1,X2,X3)|~id(X3,esk8_2(X1,X2)))).
0.19/0.39	cnf(i_0_23, plain, (id(X1,esk8_2(X2,X3))|~r4(X2,X3,X1))).
0.19/0.39	cnf(i_0_30, plain, (id(X1,X2)|~id(X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_60, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X3)|~id(X3,X1))).
0.19/0.39	cnf(i_0_29, plain, (r2(esk9_1(X1),esk10_1(X1))|id(X1,esk11_1(X1)))).
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X1,esk22_2(X2,X1))|~r3(esk21_0,X1,X3)|~id(X3,X2))).
0.19/0.39	cnf(i_0_58, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))).
0.19/0.39	cnf(i_0_34, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))).
0.19/0.39	cnf(i_0_33, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))).
0.19/0.39	cnf(i_0_1, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
0.19/0.39	cnf(i_0_4, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_41, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.19/0.39	cnf(i_0_44, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
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 9 steps
0.19/0.39	cnf(i_0_59, negated_conjecture, (id(X7,esk22_2(esk20_2(esk21_0,X7),X7))|~r3(esk21_0,X7,esk20_2(esk21_0,X7))|~id(esk20_2(esk21_0,X7),esk20_2(esk21_0,X7))), inference(start_rule)).
0.19/0.39	cnf(i_0_62, plain, (~r3(esk21_0,X7,esk20_2(esk21_0,X7))), inference(closure_rule, [i_0_53])).
0.19/0.39	cnf(i_0_63, plain, (~id(esk20_2(esk21_0,X7),esk20_2(esk21_0,X7))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_61, plain, (id(X7,esk22_2(esk20_2(esk21_0,X7),X7))), inference(extension_rule, [i_0_41])).
0.19/0.39	cnf(i_0_128, plain, (~r4(X5,X7,esk4_2(X5,X7))), inference(closure_rule, [i_0_5])).
0.19/0.39	cnf(i_0_129, plain, (~id(esk4_2(X5,X7),esk4_2(X5,X7))), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_131, plain, (~id(X5,X5)), inference(closure_rule, [i_0_10])).
0.19/0.39	cnf(i_0_127, plain, (r4(X5,esk22_2(esk20_2(esk21_0,X7),X7),esk4_2(X5,X7))), inference(extension_rule, [i_0_23])).
0.19/0.39	cnf(i_0_174, plain, (id(esk4_2(X5,X7),esk8_2(X5,esk22_2(esk20_2(esk21_0,X7),X7)))), inference(etableau_closure_rule, [i_0_174, ...])).
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	# Child (12370) has found a proof.
0.19/0.39	
0.19/0.39	# Proof search is over...
0.19/0.39	# Freeing feature tree
0.19/0.39	EOF