0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/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   : n032.cluster.edu
0.09/0.29	% Model      : x86_64 x86_64
0.09/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory     : 8042.1875MB
0.09/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 1200
0.09/0.29	% WCLimit    : 120
0.09/0.29	% DateTime   : Tue Jul 13 17:20:18 EDT 2021
0.09/0.29	% CPUTime    : 
0.13/0.32	# No SInE strategy applied
0.13/0.32	# Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
0.13/0.32	# and selection function SelectNewComplexAHP.
0.13/0.32	#
0.13/0.32	# Presaturation interreduction done
0.13/0.32	# Number of axioms: 179 Number of unprocessed: 155
0.13/0.32	# Tableaux proof search.
0.13/0.32	# APR header successfully linked.
0.13/0.32	# Hello from C++
0.13/0.32	# The folding up rule is enabled...
0.13/0.32	# Local unification is enabled...
0.13/0.32	# Any saturation attempts will use folding labels...
0.13/0.32	# 155 beginning clauses after preprocessing and clausification
0.13/0.32	# Creating start rules for all 4 conjectures.
0.13/0.32	# There are 4 start rule candidates:
0.13/0.32	# Found 33 unit axioms.
0.13/0.32	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.13/0.32	# 4 start rule tableaux created.
0.13/0.32	# 122 extension rule candidate clauses
0.13/0.32	# 33 unit axiom clauses
0.13/0.32	
0.13/0.32	# Requested 8, 32 cores available to the main process.
0.13/0.32	# There are not enough tableaux to fork, creating more from the initial 4
0.13/0.32	# Returning from population with 35 new_tableaux and 0 remaining starting tableaux.
0.13/0.32	# We now have 35 tableaux to operate on
13.26/2.02	# There were 2 total branch saturation attempts.
13.26/2.02	# There were 0 of these attempts blocked.
13.26/2.02	# There were 0 deferred branch saturation attempts.
13.26/2.02	# There were 0 free duplicated saturations.
13.26/2.02	# There were 2 total successful branch saturations.
13.26/2.02	# There were 0 successful branch saturations in interreduction.
13.26/2.02	# There were 0 successful branch saturations on the branch.
13.26/2.02	# There were 2 successful branch saturations after the branch.
13.26/2.02	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
13.26/2.02	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
13.26/2.02	# Begin clausification derivation
13.26/2.02	
13.26/2.02	# End clausification derivation
13.26/2.02	# Begin listing active clauses obtained from FOF to CNF conversion
13.26/2.02	cnf(i_0_159, plain, (empty(empty_set))).
13.26/2.02	cnf(i_0_97, negated_conjecture, (element(esk14_0,powerset(esk13_0)))).
13.26/2.02	cnf(i_0_96, negated_conjecture, (element(esk15_0,powerset(esk13_0)))).
13.26/2.02	cnf(i_0_82, plain, (empty(esk10_0))).
13.26/2.02	cnf(i_0_81, lemma, (subset(empty_set,X1))).
13.26/2.02	cnf(i_0_182, plain, (subset(X1,X1))).
13.26/2.02	cnf(i_0_4, lemma, (union(powerset(X1))=X1)).
13.26/2.02	cnf(i_0_168, plain, (empty(esk28_1(X1)))).
13.26/2.02	cnf(i_0_93, lemma, (powerset(empty_set)=unordered_pair(empty_set,empty_set))).
13.26/2.02	cnf(i_0_110, plain, (set_difference(empty_set,X1)=empty_set)).
13.26/2.02	cnf(i_0_45, plain, (element(esk8_1(X1),X1))).
13.26/2.02	cnf(i_0_169, plain, (element(esk28_1(X1),powerset(X1)))).
13.26/2.02	cnf(i_0_124, plain, (set_difference(X1,empty_set)=X1)).
13.26/2.02	cnf(i_0_84, plain, (set_union2(X1,empty_set)=X1)).
13.26/2.02	cnf(i_0_22, plain, (set_union2(X1,X1)=X1)).
13.26/2.02	cnf(i_0_85, lemma, (in(X1,esk11_1(X1)))).
13.26/2.02	cnf(i_0_127, plain, (in(X1,esk19_1(X1)))).
13.26/2.02	cnf(i_0_126, lemma, (subset(X1,set_union2(X1,X2)))).
13.26/2.02	cnf(i_0_158, lemma, (subset(set_difference(X1,X2),X1))).
13.26/2.02	cnf(i_0_184, plain, (set_difference(X1,X1)=empty_set)).
13.26/2.02	cnf(i_0_50, lemma, (set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2))).
13.26/2.02	cnf(i_0_51, lemma, (set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2))).
13.26/2.02	cnf(i_0_149, plain, (in(X1,unordered_pair(X1,X2)))).
13.26/2.02	cnf(i_0_148, plain, (in(X1,unordered_pair(X2,X1)))).
13.26/2.02	cnf(i_0_121, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
13.26/2.02	cnf(i_0_68, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
13.26/2.02	cnf(i_0_38, plain, (set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1)))).
13.26/2.02	cnf(i_0_91, plain, (~empty(esk12_0))).
13.26/2.02	cnf(i_0_78, plain, (~empty(powerset(X1)))).
13.26/2.02	cnf(i_0_24, plain, (~proper_subset(X1,X1))).
13.26/2.02	cnf(i_0_29, lemma, (unordered_pair(X1,X1)!=empty_set)).
13.26/2.02	cnf(i_0_89, plain, (~empty(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))))).
13.26/2.02	cnf(i_0_141, plain, (~in(X1,empty_set))).
13.26/2.02	cnf(i_0_95, negated_conjecture, (~disjoint(esk14_0,esk15_0)|~subset(esk14_0,subset_complement(esk13_0,esk15_0)))).
13.26/2.02	cnf(i_0_94, negated_conjecture, (disjoint(esk14_0,esk15_0)|subset(esk14_0,subset_complement(esk13_0,esk15_0)))).
13.26/2.02	cnf(i_0_63, plain, (X1=empty_set|~empty(X1))).
13.26/2.02	cnf(i_0_11, lemma, (X1=empty_set|~subset(X1,empty_set))).
13.26/2.02	cnf(i_0_176, plain, (~empty(X1)|~in(X2,X1))).
13.26/2.02	cnf(i_0_120, lemma, (~proper_subset(X1,X2)|~subset(X2,X1))).
13.26/2.02	cnf(i_0_111, plain, (empty(X1)|~empty(esk17_1(X1)))).
13.26/2.02	cnf(i_0_55, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))).
13.26/2.02	cnf(i_0_69, plain, (~in(X1,X2)|~in(X2,X1))).
13.26/2.02	cnf(i_0_161, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
13.26/2.02	cnf(i_0_64, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
13.26/2.02	cnf(i_0_6, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
13.26/2.02	cnf(i_0_21, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
13.26/2.02	cnf(i_0_165, plain, (empty(X1)|~empty(X2)|~element(X1,X2))).
13.26/2.02	cnf(i_0_76, lemma, (disjoint(X1,X2)|set_difference(X1,X2)!=X1)).
13.26/2.02	cnf(i_0_56, plain, (X1=X2|~empty(X2)|~empty(X1))).
13.26/2.02	cnf(i_0_119, lemma, (~disjoint(unordered_pair(X1,X1),X2)|~in(X1,X2))).
13.26/2.02	cnf(i_0_47, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
13.26/2.02	cnf(i_0_77, lemma, (set_difference(X1,X2)=X1|~disjoint(X1,X2))).
13.26/2.02	cnf(i_0_164, plain, (element(X1,X2)|~empty(X2)|~empty(X1))).
13.26/2.02	cnf(i_0_52, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
13.26/2.02	cnf(i_0_140, plain, (X1=empty_set|in(esk24_1(X1),X1))).
13.26/2.02	cnf(i_0_48, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
13.26/2.02	cnf(i_0_26, lemma, (set_difference(X1,unordered_pair(X2,X2))!=X1|~in(X2,X1))).
13.26/2.02	cnf(i_0_157, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))).
13.26/2.02	cnf(i_0_145, plain, (subset(X1,X2)|~in(esk25_2(X1,X2),X2))).
13.26/2.02	cnf(i_0_23, plain, (subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1)))).
13.26/2.02	cnf(i_0_175, plain, (element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1)))).
13.26/2.02	cnf(i_0_66, lemma, (subset(X1,union(X2))|~in(X1,X2))).
13.26/2.02	cnf(i_0_122, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
13.26/2.02	cnf(i_0_102, lemma, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))).
13.26/2.02	cnf(i_0_101, lemma, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))).
13.26/2.02	cnf(i_0_112, plain, (empty(X1)|element(esk17_1(X1),powerset(X1)))).
13.26/2.02	cnf(i_0_166, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
13.26/2.02	cnf(i_0_49, plain, (subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1)))).
13.26/2.02	cnf(i_0_167, plain, (element(X1,X2)|~in(X1,X2))).
13.26/2.02	cnf(i_0_79, lemma, (~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2))))).
13.26/2.02	cnf(i_0_177, lemma, (X1=X2|unordered_pair(X1,X3)!=unordered_pair(X2,X2))).
13.26/2.02	cnf(i_0_44, lemma, (X1=X2|unordered_pair(X1,X2)!=unordered_pair(X3,X3))).
13.26/2.02	cnf(i_0_154, lemma, (X1=X2|~subset(unordered_pair(X1,X1),unordered_pair(X2,X2)))).
13.26/2.02	cnf(i_0_162, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
13.26/2.02	cnf(i_0_90, lemma, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))).
13.26/2.02	cnf(i_0_7, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
13.26/2.02	cnf(i_0_147, plain, (in(X1,X2)|~in(X1,X3)|~subset(X3,X2))).
13.26/2.02	cnf(i_0_143, lemma, (subset(unordered_pair(X1,X1),X2)|~in(X1,X2))).
13.26/2.02	cnf(i_0_74, plain, (disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set)).
13.26/2.02	cnf(i_0_86, lemma, (in(powerset(X1),esk11_1(X2))|~in(X1,esk11_1(X2)))).
13.26/2.02	cnf(i_0_13, lemma, (disjoint(unordered_pair(X1,X1),X2)|in(X1,X2))).
13.26/2.02	cnf(i_0_75, lemma, (subset(set_union2(X1,X2),X3)|~subset(X1,X3)|~subset(X2,X3))).
13.26/2.02	cnf(i_0_146, plain, (in(esk25_2(X1,X2),X1)|subset(X1,X2))).
13.26/2.02	cnf(i_0_155, lemma, (disjoint(X1,X2)|in(esk27_2(X1,X2),X2))).
13.26/2.02	cnf(i_0_156, lemma, (disjoint(X1,X2)|in(esk27_2(X1,X2),X1))).
13.26/2.02	cnf(i_0_99, lemma, (X1=X2|X3=X2|unordered_pair(X1,X3)!=unordered_pair(X2,X4))).
13.26/2.02	cnf(i_0_160, lemma, (in(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
13.26/2.02	cnf(i_0_179, plain, (X1=X2|~in(esk29_2(X1,X2),X2)|~in(esk29_2(X1,X2),X1))).
13.26/2.02	cnf(i_0_61, lemma, (set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2))).
13.26/2.02	cnf(i_0_187, lemma, (X1=unordered_pair(X2,X2)|X1=empty_set|~subset(X1,unordered_pair(X2,X2)))).
13.26/2.02	cnf(i_0_103, lemma, (subset(unordered_pair(X1,X2),X3)|~in(X1,X3)|~in(X2,X3))).
13.26/2.02	cnf(i_0_92, lemma, (set_union2(unordered_pair(X1,X1),X2)=X2|~in(X1,X2))).
13.26/2.02	cnf(i_0_25, lemma, (set_difference(X1,unordered_pair(X2,X2))=X1|in(X2,X1))).
13.26/2.02	cnf(i_0_131, plain, (in(esk20_2(X1,X2),esk19_1(X1))|~in(X2,esk19_1(X1)))).
13.26/2.02	cnf(i_0_130, plain, (in(X1,esk20_2(X2,X3))|~in(X3,esk19_1(X2))|~subset(X1,X3))).
13.26/2.02	cnf(i_0_73, plain, (set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2))).
13.26/2.02	cnf(i_0_65, lemma, (subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3))).
13.26/2.02	cnf(i_0_170, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))|~subset(X1,X3))).
13.26/2.02	cnf(i_0_171, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))|~subset(X2,X3))).
13.26/2.02	cnf(i_0_40, plain, (X1=powerset(X2)|~in(esk7_2(X2,X1),X1)|~subset(esk7_2(X2,X1),X2))).
13.26/2.02	cnf(i_0_87, lemma, (are_equipotent(X1,esk11_1(X2))|in(X1,esk11_1(X2))|~subset(X1,esk11_1(X2)))).
13.26/2.02	cnf(i_0_88, lemma, (in(X1,esk11_1(X2))|~in(X3,esk11_1(X2))|~subset(X1,X3))).
13.26/2.02	cnf(i_0_128, plain, (in(X1,esk19_1(X2))|~in(X3,esk19_1(X2))|~subset(X1,X3))).
13.26/2.02	cnf(i_0_10, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),cartesian_product2(X4,X2)))).
13.26/2.02	cnf(i_0_129, plain, (are_equipotent(X1,esk19_1(X2))|in(X1,esk19_1(X2))|~subset(X1,esk19_1(X2)))).
13.26/2.02	cnf(i_0_163, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~subset(X1,X3)|~subset(X2,X4))).
13.26/2.02	cnf(i_0_144, lemma, (subset(X1,set_difference(X2,set_difference(X2,X3)))|~subset(X1,X2)|~subset(X1,X3))).
13.26/2.02	cnf(i_0_117, plain, (esk18_2(X1,X2)=X1|X2=unordered_pair(X1,X1)|in(esk18_2(X1,X2),X2))).
13.26/2.02	cnf(i_0_9, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),cartesian_product2(X2,X4)))).
13.26/2.02	cnf(i_0_153, plain, (unordered_pair(X1,X2)=X3|esk26_3(X1,X2,X3)!=X1|~in(esk26_3(X1,X2,X3),X3))).
13.26/2.02	cnf(i_0_152, plain, (unordered_pair(X1,X2)=X3|esk26_3(X1,X2,X3)!=X2|~in(esk26_3(X1,X2,X3),X3))).
13.26/2.02	cnf(i_0_125, lemma, (in(X1,X2)|subset(X2,set_difference(X3,unordered_pair(X1,X1)))|~subset(X2,X3))).
13.26/2.02	cnf(i_0_118, plain, (X1=unordered_pair(X2,X2)|esk18_2(X2,X1)!=X2|~in(esk18_2(X2,X1),X1))).
13.26/2.03	cnf(i_0_136, plain, (X1=union(X2)|~in(esk22_2(X2,X1),X3)|~in(esk22_2(X2,X1),X1)|~in(X3,X2))).
13.26/2.03	cnf(i_0_80, lemma, (disjoint(X1,X2)|in(esk9_2(X1,X2),set_difference(X1,set_difference(X1,X2))))).
13.26/2.03	cnf(i_0_2, lemma, (X1=X2|unordered_pair(unordered_pair(X3,X2),unordered_pair(X3,X3))!=unordered_pair(unordered_pair(X4,X1),unordered_pair(X4,X4)))).
13.26/2.03	cnf(i_0_3, lemma, (X1=X2|unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1))!=unordered_pair(unordered_pair(X2,X4),unordered_pair(X2,X2)))).
13.26/2.03	cnf(i_0_105, plain, (X1=set_union2(X2,X3)|~in(esk16_3(X2,X3,X1),X1)|~in(esk16_3(X2,X3,X1),X3))).
13.26/2.03	cnf(i_0_106, plain, (X1=set_union2(X2,X3)|~in(esk16_3(X2,X3,X1),X1)|~in(esk16_3(X2,X3,X1),X2))).
13.26/2.03	cnf(i_0_39, plain, (X1=powerset(X2)|in(esk7_2(X2,X1),X1)|subset(esk7_2(X2,X1),X2))).
13.26/2.03	cnf(i_0_43, lemma, (subset(set_difference(X1,set_difference(X1,X2)),set_difference(X3,set_difference(X3,X2)))|~subset(X1,X3))).
13.26/2.03	cnf(i_0_178, plain, (X1=X2|in(esk29_2(X1,X2),X1)|in(esk29_2(X1,X2),X2))).
13.26/2.03	cnf(i_0_134, plain, (X1=union(X2)|in(esk23_2(X2,X1),X2)|in(esk22_2(X2,X1),X1))).
13.26/2.03	cnf(i_0_192, plain, (X1=set_difference(X2,X3)|in(esk30_3(X2,X3,X1),X1)|~in(esk30_3(X2,X3,X1),X3))).
13.26/2.03	cnf(i_0_135, plain, (X1=union(X2)|in(esk22_2(X2,X1),esk23_2(X2,X1))|in(esk22_2(X2,X1),X1))).
13.26/2.03	cnf(i_0_151, plain, (esk26_3(X1,X2,X3)=X2|esk26_3(X1,X2,X3)=X1|unordered_pair(X1,X2)=X3|in(esk26_3(X1,X2,X3),X3))).
13.26/2.03	cnf(i_0_8, lemma, (in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))|~in(X1,X3)|~in(X2,X4))).
13.26/2.03	cnf(i_0_191, plain, (X1=set_difference(X2,X3)|in(esk30_3(X2,X3,X1),X2)|in(esk30_3(X2,X3,X1),X1))).
13.26/2.03	cnf(i_0_30, plain, (cartesian_product2(X1,X2)=X3|in(esk5_3(X1,X2,X3),X1)|in(esk4_3(X1,X2,X3),X3))).
13.26/2.03	cnf(i_0_31, plain, (cartesian_product2(X1,X2)=X3|in(esk6_3(X1,X2,X3),X2)|in(esk4_3(X1,X2,X3),X3))).
13.26/2.03	cnf(i_0_15, plain, (set_difference(X1,set_difference(X1,X2))=X3|in(esk1_3(X1,X2,X3),X1)|in(esk1_3(X1,X2,X3),X3))).
13.26/2.03	cnf(i_0_16, plain, (set_difference(X1,set_difference(X1,X2))=X3|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X2)|~in(esk1_3(X1,X2,X3),X1))).
13.26/2.03	cnf(i_0_33, plain, (cartesian_product2(X1,X2)=X3|esk4_3(X1,X2,X3)!=unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4))|~in(esk4_3(X1,X2,X3),X3)|~in(X5,X2)|~in(X4,X1))).
13.26/2.03	cnf(i_0_193, plain, (X1=set_difference(X2,X3)|in(esk30_3(X2,X3,X1),X3)|~in(esk30_3(X2,X3,X1),X1)|~in(esk30_3(X2,X3,X1),X2))).
13.26/2.03	cnf(i_0_14, plain, (set_difference(X1,set_difference(X1,X2))=X3|in(esk1_3(X1,X2,X3),X2)|in(esk1_3(X1,X2,X3),X3))).
13.26/2.03	cnf(i_0_104, plain, (X1=set_union2(X2,X3)|in(esk16_3(X2,X3,X1),X2)|in(esk16_3(X2,X3,X1),X3)|in(esk16_3(X2,X3,X1),X1))).
13.26/2.03	cnf(i_0_32, plain, (unordered_pair(unordered_pair(esk5_3(X1,X2,X3),esk5_3(X1,X2,X3)),unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)))=esk4_3(X1,X2,X3)|cartesian_product2(X1,X2)=X3|in(esk4_3(X1,X2,X3),X3))).
13.26/2.03	cnf(i_0_189, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
13.26/2.03	cnf(i_0_42, plain, (subset(X1,X2)|~in(X1,powerset(X2)))).
13.26/2.03	cnf(i_0_115, plain, (X1=X2|~in(X1,unordered_pair(X2,X2)))).
13.26/2.03	cnf(i_0_188, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
13.26/2.03	cnf(i_0_41, plain, (in(X1,powerset(X2))|~subset(X1,X2))).
13.26/2.03	cnf(i_0_150, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
13.26/2.03	cnf(i_0_107, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
13.26/2.03	cnf(i_0_108, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
13.26/2.03	cnf(i_0_137, plain, (in(X1,union(X2))|~in(X3,X2)|~in(X1,X3))).
13.26/2.03	cnf(i_0_18, plain, (in(X1,X2)|~in(X1,set_difference(X3,set_difference(X3,X2))))).
13.26/2.03	cnf(i_0_109, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
13.26/2.03	cnf(i_0_190, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))).
13.26/2.03	cnf(i_0_139, plain, (in(X1,esk21_3(X2,union(X2),X1))|~in(X1,union(X2)))).
13.26/2.03	cnf(i_0_138, plain, (in(esk21_3(X1,union(X1),X2),X1)|~in(X2,union(X1)))).
13.26/2.03	cnf(i_0_17, plain, (in(X1,set_difference(X2,set_difference(X2,X3)))|~in(X1,X3)|~in(X1,X2))).
13.26/2.03	cnf(i_0_35, plain, (in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))).
13.26/2.03	cnf(i_0_36, plain, (in(esk3_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))).
13.26/2.03	cnf(i_0_37, plain, (unordered_pair(unordered_pair(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),esk3_4(X1,X2,cartesian_product2(X1,X2),X3)))=X3|~in(X3,cartesian_product2(X1,X2)))).
13.26/2.03	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
13.26/2.03	# Begin printing tableau
13.26/2.03	# Found 5 steps
13.26/2.03	cnf(i_0_95, negated_conjecture, (~disjoint(esk14_0,esk15_0)|~subset(esk14_0,subset_complement(esk13_0,esk15_0))), inference(start_rule)).
13.26/2.03	cnf(i_0_231, plain, (~disjoint(esk14_0,esk15_0)), inference(extension_rule, [i_0_21])).
13.26/2.03	cnf(i_0_866, plain, (~disjoint(esk15_0,esk14_0)), inference(extension_rule, [i_0_76])).
13.26/2.03	cnf(i_0_232, plain, (~subset(esk14_0,subset_complement(esk13_0,esk15_0))), inference(etableau_closure_rule, [i_0_232, ...])).
13.26/2.03	cnf(i_0_891, plain, (set_difference(esk15_0,esk14_0)!=esk15_0), inference(etableau_closure_rule, [i_0_891, ...])).
13.26/2.03	# End printing tableau
13.26/2.03	# SZS output end
13.26/2.03	# Branches closed with saturation will be marked with an "s"
13.67/2.03	# Child (21813) has found a proof.
13.67/2.03	
13.67/2.03	# Proof search is over...
13.67/2.03	# Freeing feature tree
13.67/2.05	EOF