0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/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.32	Computer   : n017.cluster.edu
0.12/0.32	Model      : x86_64 x86_64
0.12/0.32	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	RAMPerCPU  : 8042.1875MB
0.12/0.32	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 960
0.12/0.32	% WCLimit    : 120
0.12/0.32	% DateTime   : Tue Aug  9 01:22:00 EDT 2022
0.12/0.32	% CPUTime    : 
0.12/0.36	# No SInE strategy applied
0.12/0.36	# Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
0.12/0.36	# and selection function SelectNewComplexAHPNS.
0.12/0.36	#
0.12/0.36	# Presaturation interreduction done
0.12/0.36	# Number of axioms: 43 Number of unprocessed: 43
0.12/0.36	# Tableaux proof search.
0.12/0.36	# APR header successfully linked.
0.12/0.36	# 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	# 43 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 18 unit axioms.
0.12/0.38	# 1 start rule tableaux created.
0.12/0.38	# 25 extension rule candidate clauses
0.12/0.38	# 18 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	# There were 1 total branch saturation attempts.
0.12/0.38	# There were 0 of these attempts blocked.
0.12/0.38	# There were 0 deferred branch saturation attempts.
0.12/0.38	# There were 0 free duplicated saturations.
0.12/0.38	# There were 1 total successful branch saturations.
0.12/0.38	# There were 0 successful branch saturations in interreduction.
0.12/0.38	# There were 0 successful branch saturations on the branch.
0.12/0.38	# There were 1 successful branch saturations after the branch.
0.12/0.38	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.38	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.38	# Begin clausification derivation
0.12/0.38	
0.12/0.38	# End clausification derivation
0.12/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.12/0.38	cnf(i_0_26, plain, (id(X1,X1))).
0.12/0.38	cnf(i_0_24, plain, (r1(esk9_1(X1)))).
0.12/0.38	cnf(i_0_45, plain, (r1(esk19_1(X1)))).
0.12/0.38	cnf(i_0_42, plain, (r1(esk20_1(X1)))).
0.12/0.38	cnf(i_0_23, plain, (id(esk8_1(X1),X1))).
0.12/0.38	cnf(i_0_31, plain, (r2(X1,esk12_2(X2,X1)))).
0.12/0.38	cnf(i_0_39, plain, (r2(X1,esk17_2(X2,X1)))).
0.12/0.38	cnf(i_0_40, plain, (r4(X1,X2,esk15_2(X1,X2)))).
0.12/0.38	cnf(i_0_43, plain, (id(esk18_1(X1),esk20_1(X1)))).
0.12/0.38	cnf(i_0_28, plain, (r3(X1,X2,esk13_2(X1,X2)))).
0.12/0.38	cnf(i_0_44, plain, (r4(X1,esk19_1(X1),esk18_1(X1)))).
0.12/0.38	cnf(i_0_25, plain, (r3(X1,esk9_1(X1),esk8_1(X1)))).
0.12/0.38	cnf(i_0_32, plain, (id(esk11_2(X1,X2),esk10_2(X1,X2)))).
0.12/0.38	cnf(i_0_37, plain, (id(esk16_2(X1,X2),esk14_2(X1,X2)))).
0.12/0.38	cnf(i_0_29, plain, (r2(esk13_2(X1,X2),esk10_2(X1,X2)))).
0.12/0.38	cnf(i_0_38, plain, (r4(X1,esk17_2(X1,X2),esk16_2(X1,X2)))).
0.12/0.38	cnf(i_0_30, plain, (r3(X1,esk12_2(X1,X2),esk11_2(X1,X2)))).
0.12/0.38	cnf(i_0_41, plain, (r3(esk15_2(X1,X2),X1,esk14_2(X1,X2)))).
0.12/0.38	cnf(i_0_27, plain, (~r1(X1)|~r2(X2,X3)|~id(X1,X3))).
0.12/0.38	cnf(i_0_59, negated_conjecture, (~r3(X1,X2,X3)|~r4(X4,X1,X5)|~r1(X6)|~r2(X6,X7)|~r2(X7,X4)|~id(X3,X8)|~id(X5,X8))).
0.12/0.38	cnf(i_0_6, plain, (id(X1,esk2_0)|~r1(X1))).
0.12/0.38	cnf(i_0_9, plain, (r1(X1)|~id(X1,esk2_0))).
0.12/0.38	cnf(i_0_1, plain, (id(X1,X2)|~id(X2,X1))).
0.12/0.38	cnf(i_0_3, plain, (id(X1,esk1_1(X2))|~r2(X2,X1))).
0.12/0.38	cnf(i_0_16, plain, (r1(esk4_1(X1))|id(X1,esk6_1(X1)))).
0.12/0.38	cnf(i_0_4, plain, (r2(X1,X2)|~id(X2,esk1_1(X1)))).
0.12/0.38	cnf(i_0_50, plain, (r1(X1)|~r1(X2)|~id(X2,X1))).
0.12/0.38	cnf(i_0_47, plain, (r1(X1)|~r1(X2)|~id(X1,X2))).
0.12/0.38	cnf(i_0_18, plain, (id(X1,esk6_1(X1))|id(X1,esk4_1(X1)))).
0.12/0.38	cnf(i_0_11, plain, (r4(X1,X2,X3)|~id(X3,esk3_2(X1,X2)))).
0.12/0.38	cnf(i_0_19, plain, (r3(X1,X2,X3)|~id(X3,esk7_2(X1,X2)))).
0.12/0.38	cnf(i_0_15, plain, (r1(esk4_1(X1))|r2(esk5_1(X1),esk6_1(X1)))).
0.12/0.38	cnf(i_0_12, plain, (id(X1,esk3_2(X2,X3))|~r4(X2,X3,X1))).
0.12/0.38	cnf(i_0_22, plain, (id(X1,esk7_2(X2,X3))|~r3(X2,X3,X1))).
0.12/0.38	cnf(i_0_46, plain, (id(X1,X2)|~id(X3,X2)|~id(X1,X3))).
0.12/0.38	cnf(i_0_17, plain, (r2(esk5_1(X1),esk6_1(X1))|id(X1,esk4_1(X1)))).
0.12/0.38	cnf(i_0_14, plain, (id(X1,X2)|~r2(X2,X3)|~r2(X1,X4)|~id(X4,X3))).
0.12/0.38	cnf(i_0_57, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X4,X2)|~id(X3,X1))).
0.12/0.38	cnf(i_0_56, plain, (r2(X1,X2)|~r2(X3,X4)|~id(X2,X4)|~id(X1,X3))).
0.12/0.38	cnf(i_0_54, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
0.12/0.38	cnf(i_0_51, plain, (r4(X1,X2,X3)|~r4(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.12/0.38	cnf(i_0_34, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X6,X3)|~id(X5,X2)|~id(X4,X1))).
0.12/0.38	cnf(i_0_35, plain, (r3(X1,X2,X3)|~r3(X4,X5,X6)|~id(X3,X6)|~id(X2,X5)|~id(X1,X4))).
0.12/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.12/0.38	# Begin printing tableau
0.12/0.38	# Found 12 steps
0.12/0.38	cnf(i_0_59, negated_conjecture, (~r3(X10,X9,esk13_2(X10,X9))|~r4(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10,esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10))|~r1(esk9_1(X8))|~r2(esk9_1(X8),esk12_2(X7,esk9_1(X8)))|~r2(esk12_2(X7,esk9_1(X8)),esk12_2(X6,esk12_2(X7,esk9_1(X8))))|~id(esk13_2(X10,X9),esk13_2(X10,X9))|~id(esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10),esk13_2(X10,X9))), inference(start_rule)).
0.12/0.38	cnf(i_0_60, plain, (~r3(X10,X9,esk13_2(X10,X9))), inference(closure_rule, [i_0_28])).
0.12/0.38	cnf(i_0_61, plain, (~r4(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10,esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10))), inference(closure_rule, [i_0_40])).
0.12/0.38	cnf(i_0_62, plain, (~r1(esk9_1(X8))), inference(closure_rule, [i_0_24])).
0.12/0.38	cnf(i_0_63, plain, (~r2(esk9_1(X8),esk12_2(X7,esk9_1(X8)))), inference(closure_rule, [i_0_31])).
0.12/0.38	cnf(i_0_64, plain, (~r2(esk12_2(X7,esk9_1(X8)),esk12_2(X6,esk12_2(X7,esk9_1(X8))))), inference(closure_rule, [i_0_31])).
0.12/0.38	cnf(i_0_65, plain, (~id(esk13_2(X10,X9),esk13_2(X10,X9))), inference(closure_rule, [i_0_26])).
0.12/0.38	cnf(i_0_66, plain, (~id(esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10),esk13_2(X10,X9))), inference(extension_rule, [i_0_14])).
0.12/0.38	cnf(i_0_106, plain, (~r2(esk13_2(X10,X9),esk12_2(X17,esk13_2(X10,X9)))), inference(closure_rule, [i_0_31])).
0.12/0.38	cnf(i_0_107, plain, (~r2(esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10),esk12_2(X16,esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10)))), inference(closure_rule, [i_0_31])).
0.12/0.38	cnf(i_0_108, plain, (~id(esk12_2(X16,esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10)),esk12_2(X17,esk13_2(X10,X9)))), inference(extension_rule, [i_0_1])).
0.12/0.38	cnf(i_0_152, plain, (~id(esk12_2(X17,esk13_2(X10,X9)),esk12_2(X16,esk15_2(esk12_2(X6,esk12_2(X7,esk9_1(X8))),X10)))), inference(etableau_closure_rule, [i_0_152, ...])).
0.12/0.38	# End printing tableau
0.12/0.38	# SZS output end
0.12/0.38	# Branches closed with saturation will be marked with an "s"
0.12/0.38	# Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
0.12/0.38	# We now have 3 tableaux to operate on
0.12/0.38	# Found closed tableau during pool population.
0.12/0.38	# Proof search is over...
0.12/0.38	# Freeing feature tree
0.12/0.38	EOF