0.08/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.15	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.15/0.36	% Computer   : n015.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 12:29:04 EDT 2021
0.15/0.37	% CPUTime    : 
0.22/0.40	# No SInE strategy applied
0.22/0.40	# Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
0.22/0.40	# and selection function SelectMaxLComplexAvoidPosPred.
0.22/0.40	#
0.22/0.40	# Number of axioms: 48 Number of unprocessed: 48
0.22/0.40	# Tableaux proof search.
0.22/0.40	# APR header successfully linked.
0.22/0.40	# Hello from C++
0.22/0.40	# The folding up rule is enabled...
0.22/0.40	# Local unification is enabled...
0.22/0.40	# Any saturation attempts will use folding labels...
0.22/0.40	# 48 beginning clauses after preprocessing and clausification
0.22/0.40	# Creating start rules for all 5 conjectures.
0.22/0.40	# There are 5 start rule candidates:
0.22/0.40	# Found 6 unit axioms.
0.22/0.40	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.22/0.40	# 5 start rule tableaux created.
0.22/0.40	# 42 extension rule candidate clauses
0.22/0.40	# 6 unit axiom clauses
0.22/0.40	
0.22/0.40	# Requested 8, 32 cores available to the main process.
0.22/0.40	# There are not enough tableaux to fork, creating more from the initial 5
0.22/0.40	# Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
0.22/0.40	# We now have 11 tableaux to operate on
3.48/0.93	# There were 5 total branch saturation attempts.
3.48/0.93	# There were 0 of these attempts blocked.
3.48/0.93	# There were 0 deferred branch saturation attempts.
3.48/0.93	# There were 0 free duplicated saturations.
3.48/0.93	# There were 5 total successful branch saturations.
3.48/0.93	# There were 1 successful branch saturations in interreduction.
3.48/0.93	# There were 0 successful branch saturations on the branch.
3.48/0.93	# There were 4 successful branch saturations after the branch.
3.48/0.93	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
3.48/0.93	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
3.48/0.93	# Begin clausification derivation
3.48/0.93	
3.48/0.93	# End clausification derivation
3.48/0.93	# Begin listing active clauses obtained from FOF to CNF conversion
3.48/0.93	cnf(i_0_48, negated_conjecture, (open(esk14_0))).
3.48/0.93	cnf(i_0_45, negated_conjecture, (part_of(esk15_0,esk14_0))).
3.48/0.93	cnf(i_0_47, negated_conjecture, (part_of(esk16_0,esk14_0))).
3.48/0.93	cnf(i_0_30, plain, (inner_point(esk8_1(X1),X1))).
3.48/0.93	cnf(i_0_12, plain, (closed(X1)|end_point(esk3_1(X1),X1))).
3.48/0.93	cnf(i_0_42, plain, (open(X2)|~end_point(X1,X2))).
3.48/0.93	cnf(i_0_43, plain, (end_point(esk13_1(X1),X1)|~open(X1))).
3.48/0.93	cnf(i_0_10, plain, (X1=X2|open(X1)|~part_of(X1,X2))).
3.48/0.93	cnf(i_0_11, plain, (~closed(X1)|~end_point(X2,X1))).
3.48/0.93	cnf(i_0_2, plain, (incident_c(X1,X2)|~end_point(X1,X2))).
3.48/0.93	cnf(i_0_15, plain, (incident_c(X1,X2)|~inner_point(X1,X2))).
3.48/0.93	cnf(i_0_44, negated_conjecture, (~open(sum(esk15_0,esk16_0)))).
3.48/0.93	cnf(i_0_16, plain, (~end_point(X1,X2)|~inner_point(X1,X2))).
3.48/0.93	cnf(i_0_19, plain, (esk5_2(X2,X1)!=X1|~end_point(X1,X2))).
3.48/0.93	cnf(i_0_46, negated_conjecture, (meet(esk17_0,esk15_0,esk16_0))).
3.48/0.93	cnf(i_0_14, plain, (end_point(X1,X2)|inner_point(X1,X2)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_22, plain, (part_of(X2,X1)|incident_c(esk6_2(X1,X2),X2))).
3.48/0.93	cnf(i_0_20, plain, (incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1))).
3.48/0.93	cnf(i_0_25, plain, (incident_c(X1,X3)|X3!=sum(X4,X2)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_24, plain, (incident_c(X1,X3)|X3!=sum(X2,X4)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_18, plain, (end_point(esk5_2(X1,X2),X1)|~end_point(X2,X1))).
3.48/0.93	cnf(i_0_23, plain, (X3=X4|X1=X4|X1=X3|~end_point(X4,X2)|~end_point(X3,X2)|~end_point(X1,X2))).
3.48/0.93	cnf(i_0_26, plain, (incident_c(X1,X4)|incident_c(X1,X3)|X2!=sum(X4,X3)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_7, plain, (end_point(X1,X2)|incident_c(X1,esk1_2(X1,X2))|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_6, plain, (end_point(X1,X2)|incident_c(X1,esk2_2(X1,X2))|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_9, plain, (end_point(X1,X2)|part_of(esk1_2(X1,X2),X2)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_8, plain, (end_point(X1,X2)|part_of(esk2_2(X1,X2),X2)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_21, plain, (part_of(X2,X1)|~incident_c(esk6_2(X1,X2),X1))).
3.48/0.93	cnf(i_0_33, plain, (X1=X2|incident_c(esk11_2(X1,X2),X2)|incident_c(esk11_2(X1,X2),X1))).
3.48/0.93	cnf(i_0_31, plain, (sum(esk9_2(X1,X2),esk10_2(X1,X2))=X1|~inner_point(X2,X1))).
3.48/0.93	cnf(i_0_40, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))).
3.48/0.93	cnf(i_0_41, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))).
3.48/0.93	cnf(i_0_13, plain, (esk4_2(X2,X3)=sum(X2,X3)|~meet(X1,X2,X3))).
3.48/0.93	cnf(i_0_34, plain, (X1=X2|~incident_c(esk11_2(X1,X2),X2)|~incident_c(esk11_2(X1,X2),X1))).
3.48/0.93	cnf(i_0_32, plain, (meet(X1,esk9_2(X2,X1),esk10_2(X2,X1))|~inner_point(X1,X2))).
3.48/0.93	cnf(i_0_4, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk1_2(X1,X2),esk2_2(X1,X2)))).
3.48/0.93	cnf(i_0_5, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk2_2(X1,X2),esk1_2(X1,X2)))).
3.48/0.93	cnf(i_0_3, plain, (part_of(X3,X1)|part_of(X1,X3)|~part_of(X3,X2)|~part_of(X1,X2)|~end_point(X4,X2)|~incident_c(X4,X3)|~incident_c(X4,X1))).
3.48/0.93	cnf(i_0_38, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X3,X2))).
3.48/0.93	cnf(i_0_39, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X2,X3))).
3.48/0.93	cnf(i_0_17, plain, (meet(X5,X2,X3)|X1!=sum(X2,X3)|~closed(X1)|~end_point(X5,X2)|~meet(X4,X2,X3))).
3.48/0.93	cnf(i_0_36, plain, (meet(X1,X2,X3)|incident_c(esk12_3(X1,X2,X3),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_37, plain, (meet(X1,X2,X3)|incident_c(esk12_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
3.48/0.93	cnf(i_0_1, plain, (part_of(X5,X4)|part_of(X5,X1)|part_of(X4,X5)|part_of(X4,X1)|part_of(X1,X5)|part_of(X1,X4)|~part_of(X5,X2)|~part_of(X4,X2)|~part_of(X1,X2)|~end_point(X3,X5)|~end_point(X3,X4)|~end_point(X3,X1))).
3.48/0.93	cnf(i_0_27, plain, (X1=sum(X2,X3)|incident_c(esk7_3(X1,X2,X3),X3)|incident_c(esk7_3(X1,X2,X3),X2)|incident_c(esk7_3(X1,X2,X3),X1))).
3.48/0.93	cnf(i_0_29, plain, (X1=sum(X2,X3)|~incident_c(esk7_3(X1,X2,X3),X3)|~incident_c(esk7_3(X1,X2,X3),X1))).
3.48/0.93	cnf(i_0_28, plain, (X1=sum(X2,X3)|~incident_c(esk7_3(X1,X2,X3),X2)|~incident_c(esk7_3(X1,X2,X3),X1))).
3.48/0.93	cnf(i_0_35, plain, (meet(X1,X2,X3)|~incident_c(X1,X3)|~incident_c(X1,X2)|~end_point(esk12_3(X1,X2,X3),X3)|~end_point(esk12_3(X1,X2,X3),X2))).
3.48/0.93	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
3.48/0.93	# Begin printing tableau
3.48/0.93	# Found 12 steps
3.48/0.93	cnf(i_0_46, negated_conjecture, (meet(esk17_0,esk15_0,esk16_0)), inference(start_rule)).
3.48/0.93	cnf(i_0_49, plain, (meet(esk17_0,esk15_0,esk16_0)), inference(extension_rule, [i_0_17])).
3.48/0.93	cnf(i_0_150, plain, (meet(esk3_1(esk15_0),esk15_0,esk16_0)), inference(extension_rule, [i_0_40])).
3.48/0.93	cnf(i_0_390, plain, (incident_c(esk3_1(esk15_0),esk16_0)), inference(extension_rule, [i_0_14])).
3.48/0.93	cnf(i_0_151, plain, ($false), inference(extension_rule, [i_0_10])).
3.48/0.93	cnf(i_0_421, plain, (open(sum(esk15_0,esk16_0))), inference(closure_rule, [i_0_44])).
3.48/0.93	cnf(i_0_152, plain, (~closed(sum(esk15_0,esk16_0))), inference(etableau_closure_rule, [i_0_152, ...])).
3.48/0.93	cnf(i_0_422, plain, (~part_of(sum(esk15_0,esk16_0),sum(esk15_0,esk16_0))), inference(etableau_closure_rule, [i_0_422, ...])).
3.48/0.93	cnf(i_0_153, plain, (~end_point(esk3_1(esk15_0),esk15_0)), inference(extension_rule, [i_0_12])).
3.48/0.93	cnf(i_0_411, plain, (end_point(esk3_1(esk15_0),esk16_0)), inference(etableau_closure_rule, [i_0_411, ...])).
3.48/0.93	cnf(i_0_412, plain, (inner_point(esk3_1(esk15_0),esk16_0)), inference(etableau_closure_rule, [i_0_412, ...])).
3.48/0.93	cnf(i_0_544, plain, (closed(esk15_0)), inference(etableau_closure_rule, [i_0_544, ...])).
3.48/0.93	# End printing tableau
3.48/0.93	# SZS output end
3.48/0.93	# Branches closed with saturation will be marked with an "s"
3.48/0.94	# Child (21219) has found a proof.
3.48/0.94	
3.48/0.94	# Proof search is over...
3.48/0.94	# Freeing feature tree
3.48/0.94	EOF