0.05/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.10/0.30	% Computer   : n021.cluster.edu
0.10/0.30	% Model      : x86_64 x86_64
0.10/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	% Memory     : 8042.1875MB
0.10/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.30	% CPULimit   : 1200
0.10/0.30	% WCLimit    : 120
0.10/0.30	% DateTime   : Tue Jul 13 16:50:11 EDT 2021
0.10/0.30	% CPUTime    : 
0.15/0.33	# No SInE strategy applied
0.15/0.33	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.15/0.33	# and selection function SelectCQIPrecW.
0.15/0.33	#
0.15/0.33	# Presaturation interreduction done
0.15/0.33	# Number of axioms: 35 Number of unprocessed: 35
0.15/0.33	# Tableaux proof search.
0.15/0.33	# APR header successfully linked.
0.15/0.33	# Hello from C++
0.15/0.33	# The folding up rule is enabled...
0.15/0.33	# Local unification is enabled...
0.15/0.33	# Any saturation attempts will use folding labels...
0.15/0.33	# 35 beginning clauses after preprocessing and clausification
0.15/0.33	# Creating start rules for all 8 conjectures.
0.15/0.33	# There are 8 start rule candidates:
0.15/0.33	# Found 17 unit axioms.
0.15/0.33	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.15/0.33	# 8 start rule tableaux created.
0.15/0.33	# 18 extension rule candidate clauses
0.15/0.33	# 17 unit axiom clauses
0.15/0.33	
0.15/0.33	# Requested 8, 32 cores available to the main process.
0.15/0.39	# Creating equality axioms
0.15/0.39	# Ran out of tableaux, making start rules for all clauses
0.15/0.39	# Creating equality axioms
0.15/0.39	# Ran out of tableaux, making start rules for all clauses
0.15/0.39	# Creating equality axioms
0.15/0.39	# Ran out of tableaux, making start rules for all clauses
0.15/0.39	# Creating equality axioms
0.15/0.39	# Ran out of tableaux, making start rules for all clauses
0.15/0.40	# There were 1 total branch saturation attempts.
0.15/0.40	# There were 0 of these attempts blocked.
0.15/0.40	# There were 0 deferred branch saturation attempts.
0.15/0.40	# There were 0 free duplicated saturations.
0.15/0.40	# There were 1 total successful branch saturations.
0.15/0.40	# There were 0 successful branch saturations in interreduction.
0.15/0.40	# There were 0 successful branch saturations on the branch.
0.15/0.40	# There were 1 successful branch saturations after the branch.
0.15/0.40	# There were 1 total branch saturation attempts.
0.15/0.40	# There were 0 of these attempts blocked.
0.15/0.40	# There were 0 deferred branch saturation attempts.
0.15/0.40	# There were 0 free duplicated saturations.
0.15/0.40	# There were 1 total successful branch saturations.
0.15/0.40	# There were 0 successful branch saturations in interreduction.
0.15/0.40	# There were 0 successful branch saturations on the branch.
0.15/0.40	# There were 1 successful branch saturations after the branch.
0.15/0.40	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.40	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.40	# Begin clausification derivation
0.15/0.40	
0.15/0.40	# End clausification derivation
0.15/0.40	# Begin listing active clauses obtained from FOF to CNF conversion
0.15/0.40	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.15/0.40	cnf(i_0_25, plain, (r1(esk12_0))).
0.15/0.40	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.15/0.40	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.15/0.40	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.15/0.40	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.15/0.40	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.15/0.40	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.15/0.40	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.15/0.40	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.15/0.40	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.15/0.40	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.15/0.40	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.15/0.40	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.15/0.40	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.15/0.40	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.15/0.40	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.15/0.40	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.15/0.40	cnf(i_0_46, negated_conjecture, (r1(esk24_1(X1))|r1(esk21_1(X1)))).
0.15/0.40	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.15/0.40	cnf(i_0_40, negated_conjecture, (esk22_1(X1)=X1|esk21_1(X1)=X1)).
0.15/0.40	cnf(i_0_42, negated_conjecture, (esk21_1(X1)=X1|r1(esk24_1(X1)))).
0.15/0.40	cnf(i_0_44, negated_conjecture, (esk22_1(X1)=X1|r1(esk21_1(X1)))).
0.15/0.40	cnf(i_0_45, negated_conjecture, (r1(esk21_1(X1))|r2(esk23_1(X1),esk22_1(X1)))).
0.15/0.40	cnf(i_0_47, negated_conjecture, (r1(esk21_1(X1))|r2(esk24_1(X1),esk23_1(X1)))).
0.15/0.40	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.15/0.40	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.15/0.40	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.15/0.40	cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r2(esk23_1(X1),esk22_1(X1)))).
0.15/0.40	cnf(i_0_43, negated_conjecture, (esk21_1(X1)=X1|r2(esk24_1(X1),esk23_1(X1)))).
0.15/0.40	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.15/0.40	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.15/0.40	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.15/0.40	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.15/0.40	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.15/0.40	cnf(i_0_302, plain, (X92=X92)).
0.15/0.40	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.15/0.40	# Begin printing tableau
0.15/0.40	# Found 6 steps
0.15/0.40	cnf(i_0_302, plain, (X4=X4), inference(start_rule)).
0.15/0.40	cnf(i_0_364, plain, (X4=X4), inference(extension_rule, [i_0_306])).
0.15/0.40	cnf(i_0_411, plain, ($false), inference(closure_rule, [i_0_302])).
0.15/0.40	cnf(i_0_412, plain, (~r2(X4,esk20_1(X4))), inference(closure_rule, [i_0_39])).
0.15/0.40	cnf(i_0_409, plain, (r2(X4,esk20_1(X4))), inference(extension_rule, [i_0_35])).
0.15/0.40	cnf(i_0_446, plain, (~r1(esk20_1(X4))), inference(etableau_closure_rule, [i_0_446, ...])).
0.15/0.40	# End printing tableau
0.15/0.40	# SZS output end
0.15/0.40	# Branches closed with saturation will be marked with an "s"
0.15/0.40	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.40	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.40	# Begin clausification derivation
0.15/0.40	
0.15/0.40	# End clausification derivation
0.15/0.40	# Begin listing active clauses obtained from FOF to CNF conversion
0.15/0.40	cnf(i_0_2, plain, (r1(esk2_1(X1)))).
0.15/0.40	cnf(i_0_25, plain, (r1(esk12_0))).
0.15/0.40	cnf(i_0_16, plain, (r1(esk5_1(X1)))).
0.15/0.40	cnf(i_0_13, plain, (r1(esk7_1(X1)))).
0.15/0.40	cnf(i_0_39, plain, (r2(X1,esk20_1(X1)))).
0.15/0.40	cnf(i_0_17, plain, (r2(X1,esk11_2(X2,X1)))).
0.15/0.40	cnf(i_0_27, plain, (r2(X1,esk16_2(X2,X1)))).
0.15/0.40	cnf(i_0_3, plain, (r3(X1,esk2_1(X1),X1))).
0.15/0.40	cnf(i_0_14, plain, (r4(X1,esk7_1(X1),esk5_1(X1)))).
0.15/0.40	cnf(i_0_21, plain, (r3(X1,X2,esk9_2(X1,X2)))).
0.15/0.40	cnf(i_0_30, plain, (r4(X1,X2,esk14_2(X1,X2)))).
0.15/0.40	cnf(i_0_10, plain, (r3(X1,X2,esk4_2(X1,X2)))).
0.15/0.40	cnf(i_0_20, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2)))).
0.15/0.40	cnf(i_0_6, plain, (r4(X1,X2,esk3_2(X1,X2)))).
0.15/0.40	cnf(i_0_18, plain, (r3(X1,esk11_2(X1,X2),esk8_2(X1,X2)))).
0.15/0.40	cnf(i_0_28, plain, (r4(X1,esk16_2(X1,X2),esk13_2(X1,X2)))).
0.15/0.40	cnf(i_0_29, plain, (r3(esk14_2(X1,X2),X1,esk13_2(X1,X2)))).
0.15/0.40	cnf(i_0_22, plain, (esk12_0=X1|~r1(X1))).
0.15/0.40	cnf(i_0_46, negated_conjecture, (r1(esk24_1(X1))|r1(esk21_1(X1)))).
0.15/0.40	cnf(i_0_35, plain, (~r1(X1)|~r2(X2,X1))).
0.15/0.40	cnf(i_0_40, negated_conjecture, (esk22_1(X1)=X1|esk21_1(X1)=X1)).
0.15/0.40	cnf(i_0_42, negated_conjecture, (esk21_1(X1)=X1|r1(esk24_1(X1)))).
0.15/0.40	cnf(i_0_44, negated_conjecture, (esk22_1(X1)=X1|r1(esk21_1(X1)))).
0.15/0.40	cnf(i_0_45, negated_conjecture, (r1(esk21_1(X1))|r2(esk23_1(X1),esk22_1(X1)))).
0.15/0.40	cnf(i_0_47, negated_conjecture, (r1(esk21_1(X1))|r2(esk24_1(X1),esk23_1(X1)))).
0.15/0.40	cnf(i_0_33, plain, (esk19_1(X1)=X1|esk18_1(X1)=X1)).
0.15/0.40	cnf(i_0_34, plain, (esk18_1(X1)=X1|r1(esk19_1(X1)))).
0.15/0.40	cnf(i_0_36, plain, (X1=esk20_1(X2)|~r2(X2,X1))).
0.15/0.40	cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r2(esk23_1(X1),esk22_1(X1)))).
0.15/0.40	cnf(i_0_43, negated_conjecture, (esk21_1(X1)=X1|r2(esk24_1(X1),esk23_1(X1)))).
0.15/0.40	cnf(i_0_32, plain, (r1(esk19_1(X1))|r2(esk17_1(X1),esk18_1(X1)))).
0.15/0.40	cnf(i_0_31, plain, (esk19_1(X1)=X1|r2(esk17_1(X1),esk18_1(X1)))).
0.15/0.40	cnf(i_0_1, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))).
0.15/0.40	cnf(i_0_7, plain, (esk3_2(X1,X2)=X3|~r4(X1,X2,X3))).
0.15/0.40	cnf(i_0_11, plain, (esk4_2(X1,X2)=X3|~r3(X1,X2,X3))).
0.15/0.40	cnf(i_0_107, plain, (X92=X92)).
0.15/0.40	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.15/0.40	# Begin printing tableau
0.15/0.40	# Found 6 steps
0.15/0.40	cnf(i_0_107, plain, (X4=X4), inference(start_rule)).
0.15/0.40	cnf(i_0_169, plain, (X4=X4), inference(extension_rule, [i_0_111])).
0.15/0.40	cnf(i_0_216, plain, ($false), inference(closure_rule, [i_0_107])).
0.15/0.40	cnf(i_0_217, plain, (~r2(X4,esk20_1(X4))), inference(closure_rule, [i_0_39])).
0.15/0.40	cnf(i_0_214, plain, (r2(X4,esk20_1(X4))), inference(extension_rule, [i_0_35])).
0.15/0.40	cnf(i_0_220, plain, (~r1(esk20_1(X4))), inference(etableau_closure_rule, [i_0_220, ...])).
0.15/0.40	# End printing tableau
0.15/0.40	# SZS output end
0.15/0.40	# Branches closed with saturation will be marked with an "s"
0.15/0.40	# There were 1 total branch saturation attempts.
0.15/0.40	# There were 0 of these attempts blocked.
0.15/0.40	# There were 0 deferred branch saturation attempts.
0.15/0.40	# There were 0 free duplicated saturations.
0.15/0.40	# There were 1 total successful branch saturations.
0.15/0.40	# There were 0 successful branch saturations in interreduction.
0.15/0.40	# There were 0 successful branch saturations on the branch.
0.15/0.40	# There were 1 successful branch saturations after the branch.
0.15/0.40	# Child (12308) has found a proof.
0.15/0.40	
0.15/0.40	# Proof search is over...
0.15/0.40	# Freeing feature tree
0.15/0.40	EOF