0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.29	Computer   : n027.cluster.edu
0.09/0.29	Model      : x86_64 x86_64
0.09/0.29	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	RAMPerCPU  : 8042.1875MB
0.09/0.29	OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 960
0.09/0.29	% WCLimit    : 120
0.09/0.29	% DateTime   : Tue Aug  9 05:17:51 EDT 2022
0.09/0.29	% CPUTime    : 
0.14/0.33	# No SInE strategy applied
0.14/0.33	# Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.14/0.33	# and selection function SelectComplexExceptUniqMaxHorn.
0.14/0.33	#
0.14/0.33	# Presaturation interreduction done
0.14/0.33	# Number of axioms: 61 Number of unprocessed: 43
0.14/0.33	# Tableaux proof search.
0.14/0.33	# APR header successfully linked.
0.14/0.33	# Hello from C++
0.14/0.33	# The folding up rule is enabled...
0.14/0.33	# Local unification is enabled...
0.14/0.33	# Any saturation attempts will use folding labels...
0.14/0.33	# 43 beginning clauses after preprocessing and clausification
0.14/0.33	# Creating start rules for all 9 conjectures.
0.14/0.33	# There are 9 start rule candidates:
0.14/0.33	# Found 11 unit axioms.
0.14/0.33	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.14/0.33	# 9 start rule tableaux created.
0.14/0.33	# 32 extension rule candidate clauses
0.14/0.33	# 11 unit axiom clauses
0.14/0.33	
0.14/0.33	# Requested 8, 32 cores available to the main process.
0.14/0.35	# There were 1 total branch saturation attempts.
0.14/0.35	# There were 0 of these attempts blocked.
0.14/0.35	# There were 0 deferred branch saturation attempts.
0.14/0.35	# There were 0 free duplicated saturations.
0.14/0.35	# There were 1 total successful branch saturations.
0.14/0.35	# There were 0 successful branch saturations in interreduction.
0.14/0.35	# There were 0 successful branch saturations on the branch.
0.14/0.35	# There were 1 successful branch saturations after the branch.
0.14/0.35	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.35	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.35	# Begin clausification derivation
0.14/0.35	
0.14/0.35	# End clausification derivation
0.14/0.35	# Begin listing active clauses obtained from FOF to CNF conversion
0.14/0.35	cnf(i_0_12, plain, (ilf_type(esk2_0,binary_relation_type))).
0.14/0.35	cnf(i_0_37, plain, (ilf_type(X1,set_type))).
0.14/0.35	cnf(i_0_29, negated_conjecture, (ilf_type(esk11_0,member_type(esk7_0)))).
0.14/0.35	cnf(i_0_30, negated_conjecture, (ilf_type(esk10_0,relation_type(esk7_0,esk9_0)))).
0.14/0.35	cnf(i_0_45, plain, (ilf_type(esk15_1(X1),subset_type(X1)))).
0.14/0.35	cnf(i_0_51, plain, (ilf_type(esk17_2(X1,X2),relation_type(X2,X1)))).
0.14/0.35	cnf(i_0_53, plain, (unordered_pair(unordered_pair(X1,X2),singleton(X1))=ordered_pair(X1,X2))).
0.14/0.35	cnf(i_0_35, negated_conjecture, (~empty(esk7_0))).
0.14/0.35	cnf(i_0_34, negated_conjecture, (~empty(esk8_0))).
0.14/0.35	cnf(i_0_32, negated_conjecture, (~empty(esk9_0))).
0.14/0.35	cnf(i_0_63, plain, (~empty(power_set(X1)))).
0.14/0.35	cnf(i_0_59, plain, (relation_like(X1)|~empty(X1))).
0.14/0.35	cnf(i_0_25, negated_conjecture, (member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|member(esk12_0,esk8_0))).
0.14/0.35	cnf(i_0_27, negated_conjecture, (member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|ilf_type(esk12_0,member_type(esk9_0)))).
0.14/0.35	cnf(i_0_26, negated_conjecture, (member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|member(ordered_pair(esk11_0,esk12_0),esk10_0))).
0.14/0.35	cnf(i_0_60, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
0.14/0.35	cnf(i_0_62, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
0.14/0.35	cnf(i_0_50, plain, (~empty(X1)|~member(X2,X1))).
0.14/0.35	cnf(i_0_28, negated_conjecture, (~member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|~member(ordered_pair(esk11_0,X1),esk10_0)|~member(X1,esk8_0)|~ilf_type(X1,member_type(esk9_0)))).
0.14/0.35	cnf(i_0_48, plain, (empty(X1)|member(esk16_1(X1),X1))).
0.14/0.35	cnf(i_0_21, plain, (relation_like(X1)|member(esk4_1(X1),X1))).
0.14/0.35	cnf(i_0_55, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
0.14/0.35	cnf(i_0_13, plain, (member(X1,power_set(X2))|~member(esk3_2(X1,X2),X2))).
0.14/0.35	cnf(i_0_20, plain, (relation_like(X1)|esk4_1(X1)!=ordered_pair(X2,X3))).
0.14/0.35	cnf(i_0_40, plain, (empty(X1)|ilf_type(esk13_1(X1),member_type(X1)))).
0.14/0.35	cnf(i_0_9, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
0.14/0.35	cnf(i_0_10, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
0.14/0.35	cnf(i_0_2, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
0.14/0.35	cnf(i_0_46, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
0.14/0.35	cnf(i_0_7, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))).
0.14/0.35	cnf(i_0_1, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
0.14/0.35	cnf(i_0_14, plain, (member(esk3_2(X1,X2),X1)|member(X1,power_set(X2)))).
0.14/0.35	cnf(i_0_16, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
0.14/0.35	cnf(i_0_6, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))).
0.14/0.35	cnf(i_0_47, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
0.14/0.35	cnf(i_0_41, plain, (member(esk14_3(X1,X2,X3),X1)|~member(X2,inverse2(X3,X1))|~ilf_type(X3,binary_relation_type))).
0.14/0.35	cnf(i_0_56, plain, (inverse4(X1,X2,X3,X4)=inverse2(X3,X4)|~ilf_type(X3,relation_type(X1,X2)))).
0.14/0.35	cnf(i_0_19, plain, (ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
0.14/0.35	cnf(i_0_23, plain, (ilf_type(inverse4(X1,X2,X3,X4),subset_type(X1))|~ilf_type(X3,relation_type(X1,X2)))).
0.14/0.35	cnf(i_0_39, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))).
0.14/0.35	cnf(i_0_38, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))).
0.14/0.35	cnf(i_0_42, plain, (member(ordered_pair(X1,esk14_3(X2,X1,X3)),X3)|~member(X1,inverse2(X3,X2))|~ilf_type(X3,binary_relation_type))).
0.14/0.35	cnf(i_0_44, plain, (member(X1,inverse2(X2,X3))|~member(ordered_pair(X1,X4),X2)|~member(X4,X3)|~ilf_type(X2,binary_relation_type))).
0.14/0.35	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.14/0.35	# Begin printing tableau
0.14/0.35	# Found 4 steps
0.14/0.35	cnf(i_0_30, negated_conjecture, (ilf_type(esk10_0,relation_type(esk7_0,esk9_0))), inference(start_rule)).
0.14/0.35	cnf(i_0_79, plain, (ilf_type(esk10_0,relation_type(esk7_0,esk9_0))), inference(extension_rule, [i_0_47])).
0.14/0.35	cnf(i_0_123, plain, (ilf_type(esk10_0,subset_type(cross_product(esk7_0,esk9_0)))), inference(extension_rule, [i_0_55])).
0.14/0.35	cnf(i_0_137, plain, (relation_like(esk10_0)), inference(etableau_closure_rule, [i_0_137, ...])).
0.14/0.35	# End printing tableau
0.14/0.35	# SZS output end
0.14/0.35	# Branches closed with saturation will be marked with an "s"
0.14/0.35	# There were 1 total branch saturation attempts.
0.14/0.35	# There were 0 of these attempts blocked.
0.14/0.35	# There were 0 deferred branch saturation attempts.
0.14/0.35	# There were 0 free duplicated saturations.
0.14/0.35	# There were 1 total successful branch saturations.
0.14/0.35	# There were 0 successful branch saturations in interreduction.
0.14/0.35	# There were 0 successful branch saturations on the branch.
0.14/0.35	# There were 1 successful branch saturations after the branch.
0.14/0.35	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.35	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.35	# Begin clausification derivation
0.14/0.35	
0.14/0.35	# End clausification derivation
0.14/0.35	# Begin listing active clauses obtained from FOF to CNF conversion
0.14/0.35	cnf(i_0_12, plain, (ilf_type(esk2_0,binary_relation_type))).
0.14/0.35	cnf(i_0_37, plain, (ilf_type(X1,set_type))).
0.14/0.35	cnf(i_0_29, negated_conjecture, (ilf_type(esk11_0,member_type(esk7_0)))).
0.14/0.35	cnf(i_0_30, negated_conjecture, (ilf_type(esk10_0,relation_type(esk7_0,esk9_0)))).
0.14/0.35	cnf(i_0_45, plain, (ilf_type(esk15_1(X1),subset_type(X1)))).
0.14/0.35	cnf(i_0_51, plain, (ilf_type(esk17_2(X1,X2),relation_type(X2,X1)))).
0.14/0.35	cnf(i_0_53, plain, (unordered_pair(unordered_pair(X1,X2),singleton(X1))=ordered_pair(X1,X2))).
0.14/0.35	cnf(i_0_35, negated_conjecture, (~empty(esk7_0))).
0.14/0.35	cnf(i_0_34, negated_conjecture, (~empty(esk8_0))).
0.14/0.35	cnf(i_0_32, negated_conjecture, (~empty(esk9_0))).
0.14/0.35	cnf(i_0_63, plain, (~empty(power_set(X1)))).
0.14/0.35	cnf(i_0_59, plain, (relation_like(X1)|~empty(X1))).
0.14/0.35	cnf(i_0_25, negated_conjecture, (member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|member(esk12_0,esk8_0))).
0.14/0.35	cnf(i_0_27, negated_conjecture, (member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|ilf_type(esk12_0,member_type(esk9_0)))).
0.14/0.35	cnf(i_0_26, negated_conjecture, (member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|member(ordered_pair(esk11_0,esk12_0),esk10_0))).
0.14/0.35	cnf(i_0_60, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
0.14/0.35	cnf(i_0_62, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
0.14/0.35	cnf(i_0_50, plain, (~empty(X1)|~member(X2,X1))).
0.14/0.35	cnf(i_0_28, negated_conjecture, (~member(esk11_0,inverse4(esk7_0,esk9_0,esk10_0,esk8_0))|~member(ordered_pair(esk11_0,X1),esk10_0)|~member(X1,esk8_0)|~ilf_type(X1,member_type(esk9_0)))).
0.14/0.35	cnf(i_0_48, plain, (empty(X1)|member(esk16_1(X1),X1))).
0.14/0.35	cnf(i_0_21, plain, (relation_like(X1)|member(esk4_1(X1),X1))).
0.14/0.35	cnf(i_0_55, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
0.14/0.35	cnf(i_0_13, plain, (member(X1,power_set(X2))|~member(esk3_2(X1,X2),X2))).
0.14/0.35	cnf(i_0_20, plain, (relation_like(X1)|esk4_1(X1)!=ordered_pair(X2,X3))).
0.14/0.35	cnf(i_0_40, plain, (empty(X1)|ilf_type(esk13_1(X1),member_type(X1)))).
0.14/0.35	cnf(i_0_9, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
0.14/0.35	cnf(i_0_10, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
0.14/0.35	cnf(i_0_2, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
0.14/0.35	cnf(i_0_46, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
0.14/0.35	cnf(i_0_7, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))).
0.14/0.35	cnf(i_0_1, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
0.14/0.35	cnf(i_0_14, plain, (member(esk3_2(X1,X2),X1)|member(X1,power_set(X2)))).
0.14/0.35	cnf(i_0_16, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
0.14/0.35	cnf(i_0_6, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))).
0.14/0.35	cnf(i_0_47, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
0.14/0.35	cnf(i_0_41, plain, (member(esk14_3(X1,X2,X3),X1)|~member(X2,inverse2(X3,X1))|~ilf_type(X3,binary_relation_type))).
0.14/0.35	cnf(i_0_56, plain, (inverse4(X1,X2,X3,X4)=inverse2(X3,X4)|~ilf_type(X3,relation_type(X1,X2)))).
0.14/0.35	cnf(i_0_19, plain, (ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
0.14/0.35	cnf(i_0_23, plain, (ilf_type(inverse4(X1,X2,X3,X4),subset_type(X1))|~ilf_type(X3,relation_type(X1,X2)))).
0.14/0.35	cnf(i_0_39, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))).
0.14/0.35	cnf(i_0_38, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))).
0.14/0.35	cnf(i_0_42, plain, (member(ordered_pair(X1,esk14_3(X2,X1,X3)),X3)|~member(X1,inverse2(X3,X2))|~ilf_type(X3,binary_relation_type))).
0.14/0.35	cnf(i_0_44, plain, (member(X1,inverse2(X2,X3))|~member(ordered_pair(X1,X4),X2)|~member(X4,X3)|~ilf_type(X2,binary_relation_type))).
0.14/0.35	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.14/0.35	# Begin printing tableau
0.14/0.35	# Found 4 steps
0.14/0.35	cnf(i_0_32, negated_conjecture, (~empty(esk9_0)), inference(start_rule)).
0.14/0.35	cnf(i_0_76, plain, (~empty(esk9_0)), inference(extension_rule, [i_0_48])).
0.14/0.35	cnf(i_0_90, plain, (member(esk16_1(esk9_0),esk9_0)), inference(extension_rule, [i_0_10])).
0.14/0.35	cnf(i_0_112, plain, (ilf_type(esk16_1(esk9_0),member_type(esk9_0))), inference(etableau_closure_rule, [i_0_112, ...])).
0.14/0.35	# End printing tableau
0.14/0.35	# SZS output end
0.14/0.35	# Branches closed with saturation will be marked with an "s"
0.14/0.35	# Child (10371) has found a proof.
0.14/0.35	
0.14/0.35	# There were 1 total branch saturation attempts.
0.14/0.35	# There were 0 of these attempts blocked.
0.14/0.35	# There were 0 deferred branch saturation attempts.
0.14/0.35	# There were 0 free duplicated saturations.
0.14/0.35	# There were 1 total successful branch saturations.
0.14/0.35	# There were 0 successful branch saturations in interreduction.
0.14/0.35	# There were 0 successful branch saturations on the branch.
0.14/0.35	# There were 1 successful branch saturations after the branch.
0.14/0.35	# Proof search is over...
0.14/0.35	# Freeing feature tree
0.14/0.35	EOF