0.08/0.17	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.14/0.18	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.15/0.40	Computer   : n011.cluster.edu
0.15/0.40	Model      : x86_64 x86_64
0.15/0.40	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.40	RAMPerCPU  : 8042.1875MB
0.15/0.40	OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.40	% CPULimit   : 960
0.15/0.40	% WCLimit    : 120
0.15/0.40	% DateTime   : Tue Aug  9 02:51:51 EDT 2022
0.15/0.40	% CPUTime    : 
0.22/0.44	# No SInE strategy applied
0.22/0.44	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
0.22/0.44	# and selection function SelectComplexExceptUniqMaxHorn.
0.22/0.44	#
0.22/0.44	# Presaturation interreduction done
0.22/0.44	# Number of axioms: 51 Number of unprocessed: 51
0.22/0.44	# Tableaux proof search.
0.22/0.44	# APR header successfully linked.
0.22/0.44	# Hello from C++
0.39/0.58	# The folding up rule is enabled...
0.39/0.58	# Local unification is enabled...
0.39/0.58	# Any saturation attempts will use folding labels...
0.39/0.58	# 51 beginning clauses after preprocessing and clausification
0.39/0.58	# Creating start rules for all 2 conjectures.
0.39/0.58	# There are 2 start rule candidates:
0.39/0.58	# Found 4 unit axioms.
0.39/0.58	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.39/0.58	# 2 start rule tableaux created.
0.39/0.58	# 47 extension rule candidate clauses
0.39/0.58	# 4 unit axiom clauses
0.39/0.58	
0.39/0.58	# Requested 8, 32 cores available to the main process.
0.39/0.58	# There are not enough tableaux to fork, creating more from the initial 2
9.72/9.92	# Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
9.72/9.92	# We now have 12 tableaux to operate on
37.44/15.97	# There were 8 total branch saturation attempts.
37.44/15.97	# There were 4 of these attempts blocked.
37.44/15.97	# There were 0 deferred branch saturation attempts.
37.44/15.97	# There were 0 free duplicated saturations.
37.44/15.97	# There were 2 total successful branch saturations.
37.44/15.97	# There were 0 successful branch saturations in interreduction.
37.44/15.97	# There were 0 successful branch saturations on the branch.
37.44/15.97	# There were 2 successful branch saturations after the branch.
37.44/15.97	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
37.44/15.97	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
37.44/15.97	# Begin clausification derivation
37.44/15.97	
37.44/15.97	# End clausification derivation
37.44/15.97	# Begin listing active clauses obtained from FOF to CNF conversion
37.44/15.97	cnf(i_0_51, negated_conjecture, (between_c(esk15_0,esk16_0,esk17_0,esk18_0))).
37.44/15.97	cnf(i_0_32, plain, (inner_point(esk9_1(X1),X1))).
37.44/15.97	cnf(i_0_50, negated_conjecture, (~between_c(esk15_0,esk18_0,esk17_0,esk16_0))).
37.44/15.97	cnf(i_0_45, plain, (~between_c(X1,X2,X3,X2))).
37.44/15.97	cnf(i_0_7, plain, (~end_point(X1,X2)|~inner_point(X1,X2))).
37.44/15.97	cnf(i_0_15, plain, (~closed(X1)|~end_point(X2,X1))).
37.44/15.97	cnf(i_0_24, plain, (esk7_2(X1,X2)!=X2|~end_point(X2,X1))).
37.44/15.97	cnf(i_0_6, plain, (incident_c(X1,X2)|~inner_point(X1,X2))).
37.44/15.97	cnf(i_0_37, plain, (incident_c(X1,X2)|~end_point(X1,X2))).
37.44/15.97	cnf(i_0_11, plain, (open(X1)|~end_point(X2,X1))).
37.44/15.97	cnf(i_0_14, plain, (closed(X1)|end_point(esk5_1(X1),X1))).
37.44/15.97	cnf(i_0_21, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))).
37.44/15.97	cnf(i_0_22, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))).
37.44/15.97	cnf(i_0_10, plain, (end_point(esk3_1(X1),X1)|~open(X1))).
37.44/15.97	cnf(i_0_2, plain, (part_of(X1,X2)|~incident_c(esk1_2(X2,X1),X2))).
37.44/15.97	cnf(i_0_33, plain, (X1=X2|open(X1)|~part_of(X1,X2))).
37.44/15.97	cnf(i_0_3, plain, (part_of(X1,X2)|incident_c(esk1_2(X2,X1),X1))).
37.44/15.97	cnf(i_0_5, plain, (end_point(X1,X2)|inner_point(X1,X2)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_1, plain, (incident_c(X1,X2)|~part_of(X3,X2)|~incident_c(X1,X3))).
37.44/15.97	cnf(i_0_25, plain, (end_point(esk7_2(X1,X2),X1)|~end_point(X2,X1))).
37.44/15.97	cnf(i_0_38, plain, (end_point(X1,X2)|~part_of(esk12_2(X1,X2),esk13_2(X1,X2))|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_4, plain, (esk2_2(X1,X2)=sum(X1,X2)|~meet(X3,X1,X2))).
37.44/15.97	cnf(i_0_30, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X3))).
37.44/15.97	cnf(i_0_29, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_8, plain, (X1=X2|X1=X3|X2=X3|~end_point(X3,X4)|~end_point(X2,X4)|~end_point(X1,X4))).
37.44/15.97	cnf(i_0_41, plain, (end_point(X1,X2)|incident_c(X1,esk12_2(X1,X2))|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_39, plain, (end_point(X1,X2)|~part_of(esk13_2(X1,X2),esk12_2(X1,X2))|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_13, plain, (X1=X2|~incident_c(esk4_2(X1,X2),X2)|~incident_c(esk4_2(X1,X2),X1))).
37.44/15.97	cnf(i_0_20, plain, (end_point(X1,X2)|~meet(X3,X4,X2)|~incident_c(X1,X4)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_19, plain, (end_point(X1,X2)|~meet(X3,X2,X4)|~incident_c(X1,X4)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_42, plain, (end_point(X1,X2)|incident_c(X1,esk13_2(X1,X2))|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_43, plain, (end_point(X1,X2)|part_of(esk12_2(X1,X2),X2)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_40, plain, (end_point(X1,X2)|part_of(esk13_2(X1,X2),X2)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_49, plain, (inner_point(X1,esk14_4(X2,X3,X1,X4))|~between_c(X2,X3,X1,X4))).
37.44/15.97	cnf(i_0_48, plain, (end_point(X1,esk14_4(X2,X3,X4,X1))|~between_c(X2,X3,X4,X1))).
37.44/15.97	cnf(i_0_31, plain, (incident_c(X1,X2)|incident_c(X1,X3)|~incident_c(X1,sum(X2,X3)))).
37.44/15.97	cnf(i_0_47, plain, (end_point(X1,esk14_4(X2,X1,X3,X4))|~between_c(X2,X1,X3,X4))).
37.44/15.97	cnf(i_0_46, plain, (part_of(esk14_4(X1,X2,X3,X4),X1)|~between_c(X1,X2,X3,X4))).
37.44/15.97	cnf(i_0_28, plain, (X1=sum(X2,X3)|~incident_c(esk8_3(X1,X2,X3),X3)|~incident_c(esk8_3(X1,X2,X3),X1))).
37.44/15.97	cnf(i_0_27, plain, (X1=sum(X2,X3)|~incident_c(esk8_3(X1,X2,X3),X2)|~incident_c(esk8_3(X1,X2,X3),X1))).
37.44/15.97	cnf(i_0_34, plain, (sum(esk10_2(X1,X2),esk11_2(X1,X2))=X1|~inner_point(X2,X1))).
37.44/15.97	cnf(i_0_35, plain, (meet(X1,esk10_2(X2,X1),esk11_2(X2,X1))|~inner_point(X1,X2))).
37.44/15.97	cnf(i_0_12, plain, (X1=X2|incident_c(esk4_2(X1,X2),X1)|incident_c(esk4_2(X1,X2),X2))).
37.44/15.97	cnf(i_0_17, plain, (meet(X1,X2,X3)|incident_c(esk6_3(X1,X2,X3),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_18, plain, (meet(X1,X2,X3)|incident_c(esk6_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_36, plain, (part_of(X1,X2)|part_of(X2,X1)|~end_point(X3,X4)|~part_of(X2,X4)|~part_of(X1,X4)|~incident_c(X3,X2)|~incident_c(X3,X1))).
37.44/15.97	cnf(i_0_23, plain, (meet(X1,X2,X3)|~closed(sum(X2,X3))|~end_point(X1,X2)|~meet(X4,X2,X3))).
37.44/15.97	cnf(i_0_16, plain, (meet(X1,X2,X3)|~end_point(esk6_3(X1,X2,X3),X3)|~end_point(esk6_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
37.44/15.97	cnf(i_0_44, plain, (X1=X2|between_c(X3,X2,X4,X1)|~end_point(X2,X5)|~end_point(X1,X5)|~inner_point(X4,X5)|~part_of(X5,X3))).
37.44/15.97	cnf(i_0_26, plain, (X1=sum(X2,X3)|incident_c(esk8_3(X1,X2,X3),X1)|incident_c(esk8_3(X1,X2,X3),X2)|incident_c(esk8_3(X1,X2,X3),X3))).
37.44/15.97	cnf(i_0_9, plain, (part_of(X1,X2)|part_of(X1,X3)|part_of(X2,X1)|part_of(X2,X3)|part_of(X3,X1)|part_of(X3,X2)|~end_point(X4,X3)|~end_point(X4,X2)|~end_point(X4,X1)|~part_of(X3,X5)|~part_of(X2,X5)|~part_of(X1,X5))).
37.44/15.97	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
37.44/15.97	# Begin printing tableau
37.44/15.97	# Found 6 steps
37.44/15.97	cnf(i_0_51, negated_conjecture, (between_c(esk15_0,esk16_0,esk17_0,esk18_0)), inference(start_rule)).
37.44/15.97	cnf(i_0_58, plain, (between_c(esk15_0,esk16_0,esk17_0,esk18_0)), inference(extension_rule, [i_0_46])).
37.44/15.97	cnf(i_0_290, plain, (part_of(esk14_4(esk15_0,esk16_0,esk17_0,esk18_0),esk15_0)), inference(extension_rule, [i_0_33])).
37.44/15.97	cnf(i_0_373, plain, (esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)=esk15_0), inference(etableau_closure_rule, [i_0_373, ...])).
37.44/15.97	cnf(i_0_374, plain, (open(esk14_4(esk15_0,esk16_0,esk17_0,esk18_0))), inference(extension_rule, [i_0_10])).
37.44/15.97	cnf(i_0_623254, plain, (end_point(esk3_1(esk14_4(esk15_0,esk16_0,esk17_0,esk18_0)),esk14_4(esk15_0,esk16_0,esk17_0,esk18_0))), inference(etableau_closure_rule, [i_0_623254, ...])).
37.44/15.97	# End printing tableau
37.44/15.97	# SZS output end
37.44/15.97	# Branches closed with saturation will be marked with an "s"
37.56/16.02	# Child (25375) has found a proof.
37.56/16.02	
37.56/16.02	# Proof search is over...
37.56/16.02	# Freeing feature tree
37.71/16.08	EOF