0.06/0.12	% 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.33	Computer   : n021.cluster.edu
0.12/0.33	Model      : x86_64 x86_64
0.12/0.33	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	RAMPerCPU  : 8042.1875MB
0.12/0.33	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 960
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Aug  9 01:57:50 EDT 2022
0.12/0.33	% CPUTime    : 
0.12/0.36	# No SInE strategy applied
0.12/0.36	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.12/0.36	# and selection function SelectCQIPrecW.
0.12/0.36	#
0.12/0.36	# Presaturation interreduction done
0.12/0.36	# Number of axioms: 33 Number of unprocessed: 33
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.36	# The folding up rule is enabled...
0.12/0.36	# Local unification is enabled...
0.12/0.36	# Any saturation attempts will use folding labels...
0.12/0.36	# 33 beginning clauses after preprocessing and clausification
0.12/0.36	# Creating start rules for all 6 conjectures.
0.12/0.36	# There are 6 start rule candidates:
0.12/0.36	# Found 17 unit axioms.
0.12/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.12/0.36	# 6 start rule tableaux created.
0.12/0.36	# 16 extension rule candidate clauses
0.12/0.36	# 17 unit axiom clauses
0.12/0.36	
0.12/0.36	# Requested 8, 32 cores available to the main process.
0.12/0.36	# There are not enough tableaux to fork, creating more from the initial 6
0.12/0.36	# Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
0.12/0.36	# We now have 14 tableaux to operate on
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	# Creating equality axioms
0.12/0.38	# Ran out of tableaux, making start rules for all clauses
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	# 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	# 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	# Creating equality axioms
0.12/0.38	# Ran out of tableaux, making start rules for all clauses
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	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.12/0.38	# SZS output start for /export/starexec/sandbox/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_30, plain, (r1(esk15_1(X1)))).
0.12/0.38	cnf(i_0_33, plain, (r1(esk18_0))).
0.12/0.38	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.12/0.38	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.12/0.38	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.12/0.38	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.12/0.38	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.12/0.38	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.12/0.38	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.12/0.38	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.12/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.12/0.38	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.12/0.38	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.12/0.38	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.12/0.38	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.12/0.38	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.12/0.38	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.12/0.38	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.12/0.38	cnf(i_0_42, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))).
0.12/0.38	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.12/0.38	cnf(i_0_45, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)).
0.12/0.38	cnf(i_0_43, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))).
0.12/0.38	cnf(i_0_44, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))).
0.12/0.38	cnf(i_0_40, negated_conjecture, (r1(esk23_1(X1))|r2(esk22_1(X1),esk21_1(X1)))).
0.12/0.38	cnf(i_0_41, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))).
0.12/0.38	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.12/0.38	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.12/0.38	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.12/0.38	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.12/0.38	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.12/0.38	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.12/0.38	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.12/0.38	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.12/0.38	cnf(i_0_262, plain, (X91=X91)).
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 6 steps
0.12/0.38	cnf(i_0_262, plain, (X4=X4), inference(start_rule)).
0.12/0.38	cnf(i_0_320, plain, (X4=X4), inference(extension_rule, [i_0_266])).
0.12/0.38	cnf(i_0_363, plain, ($false), inference(closure_rule, [i_0_262])).
0.12/0.38	cnf(i_0_364, plain, (~r2(X4,esk1_1(X4))), inference(closure_rule, [i_0_1])).
0.12/0.38	cnf(i_0_361, plain, (r2(X4,esk1_1(X4))), inference(extension_rule, [i_0_19])).
0.12/0.38	cnf(i_0_367, plain, (~r1(esk1_1(X4))), inference(etableau_closure_rule, [i_0_367, ...])).
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	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.12/0.38	# SZS output start for /export/starexec/sandbox/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_30, plain, (r1(esk15_1(X1)))).
0.12/0.38	cnf(i_0_33, plain, (r1(esk18_0))).
0.12/0.38	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.12/0.38	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.12/0.38	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.12/0.38	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.12/0.38	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.12/0.38	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.12/0.38	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.12/0.38	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.12/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.12/0.38	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.12/0.38	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.12/0.38	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.12/0.38	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.12/0.38	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.12/0.38	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.12/0.38	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.12/0.38	cnf(i_0_42, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))).
0.12/0.38	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.12/0.38	cnf(i_0_45, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)).
0.12/0.38	cnf(i_0_43, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))).
0.12/0.38	cnf(i_0_44, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))).
0.12/0.38	cnf(i_0_40, negated_conjecture, (r1(esk23_1(X1))|r2(esk22_1(X1),esk21_1(X1)))).
0.12/0.38	cnf(i_0_41, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))).
0.12/0.38	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.12/0.38	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.12/0.38	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.12/0.38	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.12/0.38	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.12/0.38	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.12/0.38	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.12/0.38	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.12/0.38	cnf(i_0_262, plain, (X91=X91)).
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 6 steps
0.12/0.38	cnf(i_0_262, plain, (X4=X4), inference(start_rule)).
0.12/0.38	cnf(i_0_320, plain, (X4=X4), inference(extension_rule, [i_0_266])).
0.12/0.38	cnf(i_0_363, plain, ($false), inference(closure_rule, [i_0_262])).
0.12/0.38	cnf(i_0_364, plain, (~r2(X4,esk1_1(X4))), inference(closure_rule, [i_0_1])).
0.12/0.38	cnf(i_0_361, plain, (r2(X4,esk1_1(X4))), inference(extension_rule, [i_0_19])).
0.12/0.38	cnf(i_0_367, plain, (~r1(esk1_1(X4))), inference(etableau_closure_rule, [i_0_367, ...])).
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	# Creating equality axioms
0.12/0.38	# Ran out of tableaux, making start rules for all clauses
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	# 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/sandbox/benchmark/theBenchmark.p
0.12/0.38	# SZS output start for /export/starexec/sandbox/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_30, plain, (r1(esk15_1(X1)))).
0.12/0.38	cnf(i_0_33, plain, (r1(esk18_0))).
0.12/0.38	cnf(i_0_31, plain, (r1(esk16_1(X1)))).
0.12/0.38	cnf(i_0_37, plain, (r1(esk20_1(X1)))).
0.12/0.38	cnf(i_0_1, plain, (r2(X1,esk1_1(X1)))).
0.12/0.38	cnf(i_0_9, plain, (r2(X1,esk4_2(X2,X1)))).
0.12/0.38	cnf(i_0_14, plain, (r2(X1,esk8_2(X2,X1)))).
0.12/0.38	cnf(i_0_38, plain, (r3(X1,esk20_1(X1),X1))).
0.12/0.38	cnf(i_0_32, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))).
0.12/0.38	cnf(i_0_5, plain, (r4(X1,X2,esk5_2(X1,X2)))).
0.12/0.38	cnf(i_0_10, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.12/0.38	cnf(i_0_11, plain, (r2(esk9_2(X1,X2),esk6_2(X1,X2)))).
0.12/0.38	cnf(i_0_17, plain, (r4(X1,X2,esk10_2(X1,X2)))).
0.12/0.38	cnf(i_0_26, plain, (r3(X1,X2,esk14_2(X1,X2)))).
0.12/0.38	cnf(i_0_8, plain, (r4(X1,esk4_2(X1,X2),esk2_2(X1,X2)))).
0.12/0.38	cnf(i_0_13, plain, (r3(X1,esk8_2(X1,X2),esk6_2(X1,X2)))).
0.12/0.38	cnf(i_0_6, plain, (r3(esk5_2(X1,X2),X1,esk2_2(X1,X2)))).
0.12/0.38	cnf(i_0_36, plain, (X1=esk18_0|~r1(X1))).
0.12/0.38	cnf(i_0_42, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))).
0.12/0.38	cnf(i_0_19, plain, (~r1(X1)|~r2(X2,X1))).
0.12/0.38	cnf(i_0_45, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)).
0.12/0.38	cnf(i_0_43, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))).
0.12/0.38	cnf(i_0_44, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))).
0.12/0.38	cnf(i_0_40, negated_conjecture, (r1(esk23_1(X1))|r2(esk22_1(X1),esk21_1(X1)))).
0.12/0.38	cnf(i_0_41, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))).
0.12/0.38	cnf(i_0_24, plain, (esk12_1(X1)=X1|esk13_1(X1)=X1)).
0.12/0.38	cnf(i_0_23, plain, (esk12_1(X1)=X1|r1(esk13_1(X1)))).
0.12/0.38	cnf(i_0_4, plain, (esk1_1(X1)=X2|~r2(X1,X2))).
0.12/0.38	cnf(i_0_21, plain, (r1(esk13_1(X1))|r2(esk11_1(X1),esk12_1(X1)))).
0.12/0.38	cnf(i_0_22, plain, (esk13_1(X1)=X1|r2(esk11_1(X1),esk12_1(X1)))).
0.12/0.38	cnf(i_0_20, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.12/0.38	cnf(i_0_16, plain, (esk10_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.12/0.38	cnf(i_0_27, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.12/0.38	cnf(i_0_462, plain, (X91=X91)).
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 6 steps
0.12/0.38	cnf(i_0_462, plain, (X4=X4), inference(start_rule)).
0.12/0.38	cnf(i_0_520, plain, (X4=X4), inference(extension_rule, [i_0_466])).
0.12/0.38	cnf(i_0_563, plain, ($false), inference(closure_rule, [i_0_462])).
0.12/0.38	cnf(i_0_564, plain, (~r2(X4,esk1_1(X4))), inference(closure_rule, [i_0_1])).
0.12/0.38	cnf(i_0_561, plain, (r2(X4,esk1_1(X4))), inference(extension_rule, [i_0_19])).
0.12/0.38	cnf(i_0_594, plain, (~r1(esk1_1(X4))), inference(etableau_closure_rule, [i_0_594, ...])).
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	# Creating equality axioms
0.12/0.38	# Ran out of tableaux, making start rules for all clauses
0.12/0.38	# Child (22580) has found a proof.
0.12/0.38	
0.12/0.38	# Proof search is over...
0.12/0.38	# Freeing feature tree
0.12/0.38	EOF