0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.11/0.31	Computer   : n006.cluster.edu
0.11/0.31	Model      : x86_64 x86_64
0.11/0.31	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.31	RAMPerCPU  : 8042.1875MB
0.11/0.31	OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.31	% CPULimit   : 960
0.11/0.31	% WCLimit    : 120
0.11/0.31	% DateTime   : Tue Aug  9 04:42:59 EDT 2022
0.11/0.31	% CPUTime    : 
0.11/0.35	# No SInE strategy applied
0.11/0.35	# Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.11/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.11/0.35	#
0.11/0.35	# Presaturation interreduction done
0.11/0.35	# Number of axioms: 62 Number of unprocessed: 44
0.11/0.35	# Tableaux proof search.
0.11/0.35	# APR header successfully linked.
0.11/0.35	# Hello from C++
0.11/0.35	# The folding up rule is enabled...
0.11/0.35	# Local unification is enabled...
0.11/0.35	# Any saturation attempts will use folding labels...
0.11/0.35	# 44 beginning clauses after preprocessing and clausification
0.11/0.35	# Creating start rules for all 7 conjectures.
0.11/0.35	# There are 7 start rule candidates:
0.11/0.35	# Found 11 unit axioms.
0.11/0.35	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.11/0.35	# 7 start rule tableaux created.
0.11/0.35	# 33 extension rule candidate clauses
0.11/0.35	# 11 unit axiom clauses
0.11/0.35	
0.11/0.35	# Requested 8, 32 cores available to the main process.
0.11/0.35	# There are not enough tableaux to fork, creating more from the initial 7
0.11/0.35	# Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
0.11/0.35	# We now have 17 tableaux to operate on
0.16/0.38	# There were 1 total branch saturation attempts.
0.16/0.38	# There were 0 of these attempts blocked.
0.16/0.38	# There were 0 deferred branch saturation attempts.
0.16/0.38	# There were 0 free duplicated saturations.
0.16/0.38	# There were 1 total successful branch saturations.
0.16/0.38	# There were 0 successful branch saturations in interreduction.
0.16/0.38	# There were 0 successful branch saturations on the branch.
0.16/0.38	# There were 1 successful branch saturations after the branch.
0.16/0.38	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.16/0.38	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.16/0.38	# Begin clausification derivation
0.16/0.38	
0.16/0.38	# End clausification derivation
0.16/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.16/0.38	cnf(i_0_9, negated_conjecture, (ilf_type(esk4_0,member_type(esk1_0)))).
0.16/0.38	cnf(i_0_39, plain, (ilf_type(esk10_0,binary_relation_type))).
0.16/0.38	cnf(i_0_24, plain, (ilf_type(X1,set_type))).
0.16/0.38	cnf(i_0_10, negated_conjecture, (ilf_type(esk3_0,relation_type(esk2_0,esk1_0)))).
0.16/0.38	cnf(i_0_58, plain, (ilf_type(esk16_1(X1),subset_type(X1)))).
0.16/0.38	cnf(i_0_16, plain, (ilf_type(esk6_2(X1,X2),relation_type(X2,X1)))).
0.16/0.38	cnf(i_0_21, plain, (unordered_pair(unordered_pair(X1,X2),singleton(X1))=ordered_pair(X1,X2))).
0.16/0.38	cnf(i_0_59, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
0.16/0.38	cnf(i_0_14, negated_conjecture, (~empty(esk1_0))).
0.16/0.38	cnf(i_0_11, negated_conjecture, (~empty(esk2_0))).
0.16/0.38	cnf(i_0_19, plain, (~empty(power_set(X1)))).
0.16/0.38	cnf(i_0_64, plain, (relation_like(X1)|~empty(X1))).
0.16/0.38	cnf(i_0_2, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
0.16/0.38	cnf(i_0_3, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
0.16/0.38	cnf(i_0_6, negated_conjecture, (member(esk4_0,range(esk2_0,esk1_0,esk3_0))|ilf_type(esk5_0,member_type(esk2_0)))).
0.16/0.38	cnf(i_0_7, negated_conjecture, (member(esk4_0,range(esk2_0,esk1_0,esk3_0))|member(ordered_pair(esk5_0,esk4_0),esk3_0))).
0.16/0.38	cnf(i_0_8, negated_conjecture, (~member(esk4_0,range(esk2_0,esk1_0,esk3_0))|~member(ordered_pair(X1,esk4_0),esk3_0)|~ilf_type(X1,member_type(esk2_0)))).
0.16/0.38	cnf(i_0_38, plain, (~member(X1,X2)|~empty(X2))).
0.16/0.38	cnf(i_0_55, plain, (member(esk13_1(X1),X1)|relation_like(X1))).
0.16/0.38	cnf(i_0_36, plain, (member(esk9_1(X1),X1)|empty(X1))).
0.16/0.38	cnf(i_0_49, plain, (empty(X1)|ilf_type(esk12_1(X1),member_type(X1)))).
0.16/0.38	cnf(i_0_4, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
0.16/0.38	cnf(i_0_27, plain, (member(X1,power_set(X2))|~member(esk7_2(X1,X2),X2))).
0.16/0.38	cnf(i_0_54, plain, (relation_like(X1)|esk13_1(X1)!=ordered_pair(X2,X3))).
0.16/0.38	cnf(i_0_46, plain, (member(X1,X2)|empty(X2)|~ilf_type(X1,member_type(X2)))).
0.16/0.38	cnf(i_0_47, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
0.16/0.38	cnf(i_0_34, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
0.16/0.38	cnf(i_0_33, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
0.16/0.38	cnf(i_0_60, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
0.16/0.38	cnf(i_0_43, plain, (X1=X2|~member(esk11_2(X1,X2),X2)|~member(esk11_2(X1,X2),X1))).
0.16/0.38	cnf(i_0_5, plain, (range(X1,X2,X3)=range_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
0.16/0.38	cnf(i_0_28, plain, (member(esk7_2(X1,X2),X1)|member(X1,power_set(X2)))).
0.16/0.38	cnf(i_0_26, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
0.16/0.38	cnf(i_0_30, plain, (member(X1,range_of(X2))|~member(ordered_pair(X3,X1),X2)|~ilf_type(X2,binary_relation_type))).
0.16/0.38	cnf(i_0_42, plain, (X1=X2|member(esk11_2(X1,X2),X1)|member(esk11_2(X1,X2),X2))).
0.16/0.38	cnf(i_0_57, plain, (domain(X1,X2,X3)=domain_of(X3)|~ilf_type(X3,relation_type(X1,X2)))).
0.16/0.38	cnf(i_0_63, plain, (member(X1,domain_of(X2))|~member(ordered_pair(X1,X3),X2)|~ilf_type(X2,binary_relation_type))).
0.16/0.38	cnf(i_0_61, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
0.16/0.38	cnf(i_0_32, plain, (member(ordered_pair(esk8_2(X1,X2),X1),X2)|~member(X1,range_of(X2))|~ilf_type(X2,binary_relation_type))).
0.16/0.38	cnf(i_0_50, plain, (ilf_type(range(X1,X2,X3),subset_type(X2))|~ilf_type(X3,relation_type(X1,X2)))).
0.16/0.38	cnf(i_0_25, plain, (ilf_type(domain(X1,X2,X3),subset_type(X1))|~ilf_type(X3,relation_type(X1,X2)))).
0.16/0.38	cnf(i_0_23, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))).
0.16/0.38	cnf(i_0_22, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))).
0.16/0.38	cnf(i_0_52, plain, (ordered_pair(esk14_2(X1,X2),esk15_2(X1,X2))=X2|~member(X2,X1)|~relation_like(X1))).
0.16/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.16/0.38	# Begin printing tableau
0.16/0.38	# Found 4 steps
0.16/0.38	cnf(i_0_10, negated_conjecture, (ilf_type(esk3_0,relation_type(esk2_0,esk1_0))), inference(start_rule)).
0.16/0.38	cnf(i_0_76, plain, (ilf_type(esk3_0,relation_type(esk2_0,esk1_0))), inference(extension_rule, [i_0_61])).
0.16/0.38	cnf(i_0_517, plain, (ilf_type(esk3_0,subset_type(cross_product(esk2_0,esk1_0)))), inference(extension_rule, [i_0_4])).
0.16/0.38	cnf(i_0_533, plain, (relation_like(esk3_0)), inference(etableau_closure_rule, [i_0_533, ...])).
0.16/0.38	# End printing tableau
0.16/0.38	# SZS output end
0.16/0.38	# Branches closed with saturation will be marked with an "s"
0.16/0.38	# Child (16497) has found a proof.
0.16/0.38	
0.16/0.38	# Proof search is over...
0.16/0.38	# Freeing feature tree
0.16/0.38	EOF