0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.32	% Computer   : n002.cluster.edu
0.13/0.32	% Model      : x86_64 x86_64
0.13/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.32	% Memory     : 8042.1875MB
0.13/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.32	% CPULimit   : 1200
0.13/0.32	% WCLimit    : 120
0.13/0.32	% DateTime   : Tue Jul 13 16:57:03 EDT 2021
0.13/0.33	% CPUTime    : 
0.19/0.36	# No SInE strategy applied
0.19/0.36	# Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.19/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.19/0.36	#
0.19/0.36	# Presaturation interreduction done
0.19/0.36	# Number of axioms: 55 Number of unprocessed: 41
0.19/0.36	# Tableaux proof search.
0.19/0.36	# APR header successfully linked.
0.19/0.36	# Hello from C++
0.19/0.36	# The folding up rule is enabled...
0.19/0.36	# Local unification is enabled...
0.19/0.36	# Any saturation attempts will use folding labels...
0.19/0.36	# 41 beginning clauses after preprocessing and clausification
0.19/0.36	# Creating start rules for all 3 conjectures.
0.19/0.36	# There are 3 start rule candidates:
0.19/0.36	# Found 9 unit axioms.
0.19/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.36	# 3 start rule tableaux created.
0.19/0.36	# 32 extension rule candidate clauses
0.19/0.36	# 9 unit axiom clauses
0.19/0.36	
0.19/0.36	# Requested 8, 32 cores available to the main process.
0.19/0.36	# There are not enough tableaux to fork, creating more from the initial 3
0.19/0.36	# Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
0.19/0.36	# We now have 8 tableaux to operate on
13.58/2.09	# There were 4 total branch saturation attempts.
13.58/2.09	# There were 0 of these attempts blocked.
13.58/2.09	# There were 0 deferred branch saturation attempts.
13.58/2.09	# There were 0 free duplicated saturations.
13.58/2.09	# There were 4 total successful branch saturations.
13.58/2.09	# There were 0 successful branch saturations in interreduction.
13.58/2.09	# There were 0 successful branch saturations on the branch.
13.58/2.09	# There were 4 successful branch saturations after the branch.
13.58/2.09	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
13.58/2.09	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
13.58/2.09	# Begin clausification derivation
13.58/2.09	
13.58/2.09	# End clausification derivation
13.58/2.09	# Begin listing active clauses obtained from FOF to CNF conversion
13.58/2.09	cnf(i_0_2, negated_conjecture, (subset(esk2_0,esk3_0))).
13.58/2.09	cnf(i_0_35, plain, (ilf_type(esk12_0,binary_relation_type))).
13.58/2.09	cnf(i_0_56, plain, (ilf_type(X1,set_type))).
13.58/2.09	cnf(i_0_33, plain, (subset(X1,X1))).
13.58/2.09	cnf(i_0_3, negated_conjecture, (ilf_type(esk4_0,relation_type(esk2_0,esk1_0)))).
13.58/2.09	cnf(i_0_24, plain, (ilf_type(esk9_1(X1),subset_type(X1)))).
13.58/2.09	cnf(i_0_37, plain, (ilf_type(esk13_2(X1,X2),relation_type(X2,X1)))).
13.58/2.09	cnf(i_0_1, negated_conjecture, (restrict4(esk2_0,esk1_0,esk4_0,esk3_0)!=esk4_0)).
13.58/2.09	cnf(i_0_48, plain, (~empty(power_set(X1)))).
13.58/2.09	cnf(i_0_25, plain, (relation_like(X1)|~empty(X1))).
13.58/2.09	cnf(i_0_46, plain, (relation_like(X1)|~ilf_type(X1,binary_relation_type))).
13.58/2.09	cnf(i_0_44, plain, (ilf_type(X1,binary_relation_type)|~relation_like(X1))).
13.58/2.09	cnf(i_0_19, plain, (relation_like(X1)|member(esk8_1(X1),X1))).
13.58/2.09	cnf(i_0_30, plain, (~empty(X1)|~member(X2,X1))).
13.58/2.09	cnf(i_0_31, plain, (empty(X1)|member(esk11_1(X1),X1))).
13.58/2.09	cnf(i_0_9, plain, (subset(X1,X2)|~member(esk5_2(X1,X2),X2))).
13.58/2.09	cnf(i_0_16, plain, (relation_like(X1)|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
13.58/2.09	cnf(i_0_17, plain, (ilf_type(restrict(X1,X2),binary_relation_type)|~ilf_type(X1,binary_relation_type))).
13.58/2.09	cnf(i_0_8, plain, (ilf_type(X1,subset_type(X2))|~ilf_type(X1,member_type(power_set(X2))))).
13.58/2.09	cnf(i_0_60, plain, (empty(X1)|ilf_type(esk16_1(X1),member_type(X1)))).
13.58/2.09	cnf(i_0_27, plain, (member(X1,power_set(X2))|~member(esk10_2(X1,X2),X2))).
13.58/2.09	cnf(i_0_18, plain, (relation_like(X1)|esk8_1(X1)!=ordered_pair(X2,X3))).
13.58/2.09	cnf(i_0_51, plain, (empty(X1)|member(X2,X1)|~ilf_type(X2,member_type(X1)))).
13.58/2.09	cnf(i_0_50, plain, (ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,subset_type(cross_product(X2,X3))))).
13.58/2.09	cnf(i_0_7, plain, (ilf_type(X1,member_type(power_set(X2)))|~ilf_type(X1,subset_type(X2)))).
13.58/2.09	cnf(i_0_52, plain, (ilf_type(X1,member_type(X2))|~member(X1,X2))).
13.58/2.09	cnf(i_0_10, plain, (member(esk5_2(X1,X2),X1)|subset(X1,X2))).
13.58/2.09	cnf(i_0_12, plain, (member(X1,X2)|~member(X1,X3)|~subset(X3,X2))).
13.58/2.09	cnf(i_0_26, plain, (member(X1,X2)|~member(X3,power_set(X2))|~member(X1,X3))).
13.58/2.09	cnf(i_0_58, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),restrict(X4,X2))|~ilf_type(X4,binary_relation_type))).
13.58/2.09	cnf(i_0_28, plain, (member(esk10_2(X1,X2),X1)|member(X1,power_set(X2)))).
13.58/2.09	cnf(i_0_49, plain, (ilf_type(X1,subset_type(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3)))).
13.58/2.09	cnf(i_0_55, plain, (restrict4(X1,X2,X3,X4)=restrict(X3,X4)|~ilf_type(X3,relation_type(X1,X2)))).
13.58/2.09	cnf(i_0_14, plain, (ilf_type(restrict4(X1,X2,X3,X4),relation_type(X1,X2))|~ilf_type(X3,relation_type(X1,X2)))).
13.58/2.09	cnf(i_0_57, plain, (member(ordered_pair(X1,X2),X3)|~member(ordered_pair(X1,X2),restrict(X3,X4))|~ilf_type(X3,binary_relation_type))).
13.58/2.09	cnf(i_0_22, plain, (ordered_pair(esk6_2(X1,X2),esk7_2(X1,X2))=X2|~relation_like(X1)|~member(X2,X1))).
13.58/2.09	cnf(i_0_54, plain, (member(X1,X2)|~member(ordered_pair(X3,X1),X4)|~ilf_type(X4,relation_type(X5,X2)))).
13.58/2.09	cnf(i_0_53, plain, (member(X1,X2)|~member(ordered_pair(X1,X3),X4)|~ilf_type(X4,relation_type(X2,X5)))).
13.58/2.09	cnf(i_0_39, plain, (X1=X2|~member(ordered_pair(esk14_2(X1,X2),esk15_2(X1,X2)),X2)|~member(ordered_pair(esk14_2(X1,X2),esk15_2(X1,X2)),X1)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
13.58/2.09	cnf(i_0_59, plain, (member(ordered_pair(X1,X2),restrict(X3,X4))|~member(ordered_pair(X1,X2),X3)|~member(X1,X4)|~ilf_type(X3,binary_relation_type))).
13.58/2.09	cnf(i_0_38, plain, (X1=X2|member(ordered_pair(esk14_2(X1,X2),esk15_2(X1,X2)),X1)|member(ordered_pair(esk14_2(X1,X2),esk15_2(X1,X2)),X2)|~ilf_type(X2,binary_relation_type)|~ilf_type(X1,binary_relation_type))).
13.58/2.09	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
13.58/2.09	# Begin printing tableau
13.58/2.09	# Found 7 steps
13.58/2.09	cnf(i_0_1, negated_conjecture, (restrict4(esk2_0,esk1_0,esk4_0,esk3_0)!=esk4_0), inference(start_rule)).
13.58/2.09	cnf(i_0_61, plain, (restrict4(esk2_0,esk1_0,esk4_0,esk3_0)!=esk4_0), inference(extension_rule, [i_0_38])).
13.58/2.09	cnf(i_0_140, plain, (member(ordered_pair(esk14_2(restrict4(esk2_0,esk1_0,esk4_0,esk3_0),esk4_0),esk15_2(restrict4(esk2_0,esk1_0,esk4_0,esk3_0),esk4_0)),restrict4(esk2_0,esk1_0,esk4_0,esk3_0))), inference(extension_rule, [i_0_30])).
13.58/2.09	cnf(i_0_141, plain, (member(ordered_pair(esk14_2(restrict4(esk2_0,esk1_0,esk4_0,esk3_0),esk4_0),esk15_2(restrict4(esk2_0,esk1_0,esk4_0,esk3_0),esk4_0)),esk4_0)), inference(etableau_closure_rule, [i_0_141, ...])).
13.58/2.09	cnf(i_0_142, plain, (~ilf_type(esk4_0,binary_relation_type)), inference(etableau_closure_rule, [i_0_142, ...])).
13.58/2.09	cnf(i_0_143, plain, (~ilf_type(restrict4(esk2_0,esk1_0,esk4_0,esk3_0),binary_relation_type)), inference(etableau_closure_rule, [i_0_143, ...])).
13.58/2.09	cnf(i_0_312, plain, (~empty(restrict4(esk2_0,esk1_0,esk4_0,esk3_0))), inference(etableau_closure_rule, [i_0_312, ...])).
13.58/2.09	# End printing tableau
13.58/2.09	# SZS output end
13.58/2.09	# Branches closed with saturation will be marked with an "s"
13.58/2.09	# Child (5011) has found a proof.
13.58/2.09	
13.58/2.09	# Proof search is over...
13.58/2.09	# Freeing feature tree
13.58/2.10	EOF