TSTP Solution File: SEU180+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU180+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 09:24:32 EDT 2022
% Result : Theorem 3.56s 0.91s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU180+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 14:18:55 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.40 # No SInE strategy applied
% 0.20/0.40 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.40 # and selection function SelectNewComplexAHP.
% 0.20/0.40 #
% 0.20/0.40 # Presaturation interreduction done
% 0.20/0.40 # Number of axioms: 238 Number of unprocessed: 207
% 0.20/0.40 # Tableaux proof search.
% 0.20/0.40 # APR header successfully linked.
% 0.20/0.40 # Hello from C++
% 0.20/0.40 # The folding up rule is enabled...
% 0.20/0.40 # Local unification is enabled...
% 0.20/0.40 # Any saturation attempts will use folding labels...
% 0.20/0.40 # 207 beginning clauses after preprocessing and clausification
% 0.20/0.40 # Creating start rules for all 3 conjectures.
% 0.20/0.40 # There are 3 start rule candidates:
% 0.20/0.40 # Found 37 unit axioms.
% 0.20/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.40 # 3 start rule tableaux created.
% 0.20/0.40 # 170 extension rule candidate clauses
% 0.20/0.40 # 37 unit axiom clauses
% 0.20/0.40
% 0.20/0.40 # Requested 8, 32 cores available to the main process.
% 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 3
% 0.20/0.40 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.40 # We now have 19 tableaux to operate on
% 3.56/0.91 # There were 1 total branch saturation attempts.
% 3.56/0.91 # There were 0 of these attempts blocked.
% 3.56/0.91 # There were 0 deferred branch saturation attempts.
% 3.56/0.91 # There were 0 free duplicated saturations.
% 3.56/0.91 # There were 1 total successful branch saturations.
% 3.56/0.91 # There were 0 successful branch saturations in interreduction.
% 3.56/0.91 # There were 0 successful branch saturations on the branch.
% 3.56/0.91 # There were 1 successful branch saturations after the branch.
% 3.56/0.91 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.56/0.91 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.56/0.91 # Begin clausification derivation
% 3.56/0.91
% 3.56/0.91 # End clausification derivation
% 3.56/0.91 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.56/0.91 cnf(i_0_197, negated_conjecture, (relation(esk41_0))).
% 3.56/0.91 cnf(i_0_152, plain, (relation(esk32_0))).
% 3.56/0.91 cnf(i_0_120, plain, (empty(empty_set))).
% 3.56/0.91 cnf(i_0_153, plain, (empty(esk32_0))).
% 3.56/0.91 cnf(i_0_156, plain, (empty(esk34_0))).
% 3.56/0.91 cnf(i_0_157, plain, (empty(esk35_1(X1)))).
% 3.56/0.91 cnf(i_0_194, lemma, (subset(empty_set,X1))).
% 3.56/0.91 cnf(i_0_163, plain, (subset(X1,X1))).
% 3.56/0.91 cnf(i_0_176, lemma, (in(X1,esk37_1(X1)))).
% 3.56/0.91 cnf(i_0_256, plain, (in(X1,esk44_1(X1)))).
% 3.56/0.91 cnf(i_0_251, lemma, (union(powerset(X1))=X1)).
% 3.56/0.91 cnf(i_0_229, plain, (set_difference(empty_set,X1)=empty_set)).
% 3.56/0.91 cnf(i_0_179, plain, (set_union2(X1,empty_set)=X1)).
% 3.56/0.91 cnf(i_0_182, lemma, (unordered_pair(empty_set,empty_set)=powerset(empty_set))).
% 3.56/0.91 cnf(i_0_213, plain, (set_difference(X1,empty_set)=X1)).
% 3.56/0.91 cnf(i_0_128, plain, (set_union2(X1,X1)=X1)).
% 3.56/0.91 cnf(i_0_103, plain, (element(X1,powerset(X1)))).
% 3.56/0.91 cnf(i_0_118, plain, (element(esk30_1(X1),X1))).
% 3.56/0.91 cnf(i_0_158, plain, (element(esk35_1(X1),powerset(X1)))).
% 3.56/0.91 cnf(i_0_244, lemma, (subset(X1,set_union2(X1,X2)))).
% 3.56/0.91 cnf(i_0_201, lemma, (subset(set_difference(X1,X2),X1))).
% 3.56/0.91 cnf(i_0_190, plain, (set_difference(X1,X1)=empty_set)).
% 3.56/0.91 cnf(i_0_209, lemma, (set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2))).
% 3.56/0.91 cnf(i_0_220, lemma, (set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2))).
% 3.56/0.91 cnf(i_0_12, plain, (set_meet(empty_set)=empty_set)).
% 3.56/0.91 cnf(i_0_37, plain, (in(X1,unordered_pair(X2,X1)))).
% 3.56/0.91 cnf(i_0_196, negated_conjecture, (in(unordered_pair(unordered_pair(esk39_0,esk39_0),unordered_pair(esk39_0,esk40_0)),esk41_0))).
% 3.56/0.91 cnf(i_0_38, plain, (in(X1,unordered_pair(X1,X2)))).
% 3.56/0.91 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 3.56/0.91 cnf(i_0_4, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 3.56/0.91 cnf(i_0_5, plain, (set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1)))).
% 3.56/0.91 cnf(i_0_159, plain, (~empty(esk36_0))).
% 3.56/0.91 cnf(i_0_119, plain, (~empty(powerset(X1)))).
% 3.56/0.91 cnf(i_0_132, plain, (~proper_subset(X1,X1))).
% 3.56/0.91 cnf(i_0_133, lemma, (unordered_pair(X1,X1)!=empty_set)).
% 3.56/0.91 cnf(i_0_125, plain, (~empty(unordered_pair(X1,X2)))).
% 3.56/0.91 cnf(i_0_25, plain, (~in(X1,empty_set))).
% 3.56/0.91 cnf(i_0_195, negated_conjecture, (~in(esk39_0,relation_field(esk41_0))|~in(esk40_0,relation_field(esk41_0)))).
% 3.56/0.91 cnf(i_0_241, plain, (X1=empty_set|~empty(X1))).
% 3.56/0.91 cnf(i_0_243, plain, (~empty(X1)|~in(X2,X1))).
% 3.56/0.91 cnf(i_0_236, lemma, (~subset(X1,X2)|~proper_subset(X2,X1))).
% 3.56/0.91 cnf(i_0_154, plain, (empty(X1)|~empty(esk33_1(X1)))).
% 3.56/0.91 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 3.56/0.91 cnf(i_0_219, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 3.56/0.91 cnf(i_0_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))).
% 3.56/0.91 cnf(i_0_126, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 3.56/0.91 cnf(i_0_124, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 3.56/0.91 cnf(i_0_96, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
% 3.56/0.91 cnf(i_0_135, lemma, (~disjoint(unordered_pair(X1,X1),X2)|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_10, plain, (relation(X1)|in(esk3_1(X1),X1))).
% 3.56/0.91 cnf(i_0_180, plain, (element(X1,X2)|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_257, lemma, (X1=X2|unordered_pair(X3,X3)!=unordered_pair(X1,X2))).
% 3.56/0.91 cnf(i_0_249, lemma, (X1=X2|unordered_pair(X1,X1)!=unordered_pair(X2,X3))).
% 3.56/0.91 cnf(i_0_247, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 3.56/0.91 cnf(i_0_24, plain, (X1=empty_set|in(esk8_1(X1),X1))).
% 3.56/0.91 cnf(i_0_140, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 3.56/0.91 cnf(i_0_215, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 3.56/0.91 cnf(i_0_239, lemma, (set_difference(X1,unordered_pair(X2,X2))!=X1|~in(X2,X1))).
% 3.56/0.91 cnf(i_0_122, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 3.56/0.91 cnf(i_0_207, lemma, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))).
% 3.56/0.91 cnf(i_0_208, lemma, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))).
% 3.56/0.91 cnf(i_0_246, lemma, (set_difference(X1,X2)=X1|~disjoint(X1,X2))).
% 3.56/0.91 cnf(i_0_235, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 3.56/0.91 cnf(i_0_245, lemma, (disjoint(X1,X2)|set_difference(X1,X2)!=X1)).
% 3.56/0.91 cnf(i_0_31, plain, (empty(X1)|~element(X1,X2)|~empty(X2))).
% 3.56/0.91 cnf(i_0_54, plain, (subset(X1,X2)|~in(esk17_2(X1,X2),X2))).
% 3.56/0.91 cnf(i_0_242, lemma, (X1=X2|~subset(unordered_pair(X1,X1),unordered_pair(X2,X2)))).
% 3.56/0.91 cnf(i_0_216, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))).
% 3.56/0.91 cnf(i_0_30, plain, (element(X1,X2)|~empty(X2)|~empty(X1))).
% 3.56/0.91 cnf(i_0_164, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 3.56/0.91 cnf(i_0_231, lemma, (~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2))))).
% 3.56/0.91 cnf(i_0_6, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_127, plain, (empty(X1)|empty(X2)|~empty(cartesian_product2(X1,X2)))).
% 3.56/0.91 cnf(i_0_9, plain, (relation(X1)|esk3_1(X1)!=unordered_pair(unordered_pair(X2,X3),unordered_pair(X2,X2)))).
% 3.56/0.91 cnf(i_0_139, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_172, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_155, plain, (element(esk33_1(X1),powerset(X1))|empty(X1))).
% 3.56/0.91 cnf(i_0_234, lemma, (~element(X1,powerset(X2))|~in(X3,subset_complement(X2,X1))|~in(X3,X1))).
% 3.56/0.91 cnf(i_0_146, lemma, (subset(X1,union(X2))|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_214, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_137, lemma, (subset(unordered_pair(X1,X1),X2)|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_168, lemma, (X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X2,X3))).
% 3.56/0.91 cnf(i_0_150, lemma, (element(X1,powerset(X2))|~in(esk31_2(X1,X2),X2))).
% 3.56/0.91 cnf(i_0_86, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 3.56/0.91 cnf(i_0_136, lemma, (disjoint(unordered_pair(X1,X1),X2)|in(X1,X2))).
% 3.56/0.91 cnf(i_0_87, plain, (disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set)).
% 3.56/0.91 cnf(i_0_224, lemma, (X1=empty_set|complements_of_subsets(X2,X1)!=empty_set|~element(X1,powerset(powerset(X2))))).
% 3.56/0.91 cnf(i_0_33, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 3.56/0.91 cnf(i_0_94, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_56, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_181, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 3.56/0.91 cnf(i_0_237, lemma, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))).
% 3.56/0.91 cnf(i_0_160, plain, (union_of_subsets(X1,X2)=union(X2)|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_174, lemma, (in(powerset(X1),esk37_1(X2))|~in(X1,esk37_1(X2)))).
% 3.56/0.91 cnf(i_0_55, plain, (subset(X1,X2)|in(esk17_2(X1,X2),X1))).
% 3.56/0.91 cnf(i_0_161, plain, (meet_of_subsets(X1,X2)=set_meet(X2)|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_84, plain, (subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1)))).
% 3.56/0.91 cnf(i_0_141, lemma, (in(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_217, lemma, (disjoint(X1,X2)|in(esk42_2(X1,X2),X2))).
% 3.56/0.91 cnf(i_0_134, lemma, (set_union2(unordered_pair(X1,X1),X2)=X2|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_206, lemma, (subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_145, lemma, (X1=unordered_pair(X2,X2)|X1=empty_set|~subset(X1,unordered_pair(X2,X2)))).
% 3.56/0.91 cnf(i_0_218, lemma, (disjoint(X1,X2)|in(esk42_2(X1,X2),X1))).
% 3.56/0.91 cnf(i_0_230, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_193, plain, (X1=X2|~in(esk38_2(X1,X2),X2)|~in(esk38_2(X1,X2),X1))).
% 3.56/0.91 cnf(i_0_238, lemma, (set_difference(X1,unordered_pair(X2,X2))=X1|in(X2,X1))).
% 3.56/0.91 cnf(i_0_184, lemma, (in(X1,relation_dom(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),X2))).
% 3.56/0.91 cnf(i_0_183, lemma, (in(X1,relation_rng(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2))).
% 3.56/0.91 cnf(i_0_151, lemma, (element(X1,powerset(X2))|in(esk31_2(X1,X2),X1))).
% 3.56/0.91 cnf(i_0_88, plain, (set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2))).
% 3.56/0.91 cnf(i_0_189, lemma, (set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_248, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))).
% 3.56/0.91 cnf(i_0_254, plain, (in(esk45_2(X1,X2),esk44_1(X1))|~in(X2,esk44_1(X1)))).
% 3.56/0.91 cnf(i_0_148, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),cartesian_product2(X4,X2)))).
% 3.56/0.91 cnf(i_0_149, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),cartesian_product2(X2,X4)))).
% 3.56/0.91 cnf(i_0_187, lemma, (subset(relation_dom(X1),relation_dom(X2))|~relation(X2)|~relation(X1)|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_185, lemma, (subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))|~relation(X1))).
% 3.56/0.91 cnf(i_0_221, lemma, (disjoint(X1,X2)|~element(X2,powerset(X3))|~element(X1,powerset(X3))|~subset(X1,subset_complement(X3,X2)))).
% 3.56/0.91 cnf(i_0_186, lemma, (subset(relation_rng(X1),relation_rng(X2))|~relation(X2)|~relation(X1)|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_130, plain, (subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1)))).
% 3.56/0.91 cnf(i_0_108, plain, (element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1)))).
% 3.56/0.91 cnf(i_0_131, plain, (complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_253, plain, (in(X1,esk45_2(X2,X3))|~subset(X1,X3)|~in(X3,esk44_1(X2)))).
% 3.56/0.91 cnf(i_0_199, lemma, (X1=X2|unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3))!=unordered_pair(unordered_pair(X4,X2),unordered_pair(X4,X4)))).
% 3.56/0.91 cnf(i_0_200, lemma, (X1=X2|unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1))!=unordered_pair(unordered_pair(X2,X4),unordered_pair(X2,X2)))).
% 3.56/0.91 cnf(i_0_170, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))|~subset(X1,X3))).
% 3.56/0.91 cnf(i_0_27, plain, (X1=powerset(X2)|~subset(esk9_2(X2,X1),X2)|~in(esk9_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_175, lemma, (in(X1,esk37_1(X2))|~subset(X1,X3)|~in(X3,esk37_1(X2)))).
% 3.56/0.91 cnf(i_0_255, plain, (in(X1,esk44_1(X2))|~subset(X1,X3)|~in(X3,esk44_1(X2)))).
% 3.56/0.91 cnf(i_0_113, plain, (element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_169, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))|~subset(X2,X3))).
% 3.56/0.91 cnf(i_0_21, plain, (X1=unordered_pair(X2,X2)|esk7_2(X2,X1)!=X2|~in(esk7_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_20, plain, (esk7_2(X1,X2)=X1|X2=unordered_pair(X1,X1)|in(esk7_2(X1,X2),X2))).
% 3.56/0.91 cnf(i_0_198, lemma, (subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3))).
% 3.56/0.91 cnf(i_0_114, plain, (element(meet_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_35, plain, (X1=unordered_pair(X2,X3)|esk10_3(X2,X3,X1)!=X3|~in(esk10_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_36, plain, (X1=unordered_pair(X2,X3)|esk10_3(X2,X3,X1)!=X2|~in(esk10_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_173, lemma, (are_equipotent(X1,esk37_1(X2))|in(X1,esk37_1(X2))|~subset(X1,esk37_1(X2)))).
% 3.56/0.91 cnf(i_0_252, plain, (are_equipotent(X1,esk44_1(X2))|in(X1,esk44_1(X2))|~subset(X1,esk44_1(X2)))).
% 3.56/0.91 cnf(i_0_70, plain, (X1=union(X2)|~in(esk23_2(X2,X1),X3)|~in(esk23_2(X2,X1),X1)|~in(X3,X2))).
% 3.56/0.91 cnf(i_0_116, plain, (element(complements_of_subsets(X1,X2),powerset(powerset(X1)))|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_222, lemma, (subset(X1,subset_complement(X2,X3))|~disjoint(X1,X3)|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 3.56/0.91 cnf(i_0_162, plain, (subset_difference(X1,X2,X3)=set_difference(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1)))).
% 3.56/0.91 cnf(i_0_142, lemma, (subset(X1,set_difference(X2,unordered_pair(X3,X3)))|in(X3,X1)|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_192, plain, (X1=X2|in(esk38_2(X1,X2),X1)|in(esk38_2(X1,X2),X2))).
% 3.56/0.91 cnf(i_0_232, lemma, (disjoint(X1,X2)|in(esk43_2(X1,X2),set_difference(X1,set_difference(X1,X2))))).
% 3.56/0.91 cnf(i_0_171, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~subset(X2,X4)|~subset(X1,X3))).
% 3.56/0.91 cnf(i_0_178, lemma, (subset(X1,set_difference(X2,set_difference(X2,X3)))|~subset(X1,X3)|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_41, plain, (X1=set_union2(X2,X3)|~in(esk11_3(X2,X3,X1),X1)|~in(esk11_3(X2,X3,X1),X3))).
% 3.56/0.91 cnf(i_0_42, plain, (X1=set_union2(X2,X3)|~in(esk11_3(X2,X3,X1),X1)|~in(esk11_3(X2,X3,X1),X2))).
% 3.56/0.91 cnf(i_0_15, plain, (X1=set_meet(X2)|X2=empty_set|~in(esk5_2(X2,X1),esk6_2(X2,X1))|~in(esk5_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_147, lemma, (in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_233, lemma, (X1=empty_set|in(X2,subset_complement(X1,X3))|in(X2,X3)|~element(X3,powerset(X1))|~element(X2,X1))).
% 3.56/0.91 cnf(i_0_26, plain, (X1=powerset(X2)|subset(esk9_2(X2,X1),X2)|in(esk9_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_68, plain, (X1=union(X2)|in(esk24_2(X2,X1),X2)|in(esk23_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_115, plain, (element(subset_difference(X1,X2,X3),powerset(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1)))).
% 3.56/0.91 cnf(i_0_81, plain, (X1=relation_rng(X2)|~relation(X2)|~in(unordered_pair(unordered_pair(X3,esk27_2(X2,X1)),unordered_pair(X3,X3)),X2)|~in(esk27_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_16, plain, (X1=set_meet(X2)|X2=empty_set|in(esk6_2(X2,X1),X2)|~in(esk5_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_188, lemma, (subset(set_difference(X1,set_difference(X1,X2)),set_difference(X3,set_difference(X3,X2)))|~subset(X1,X3))).
% 3.56/0.91 cnf(i_0_69, plain, (X1=union(X2)|in(esk23_2(X2,X1),esk24_2(X2,X1))|in(esk23_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_74, plain, (X1=set_difference(X2,X3)|in(esk25_3(X2,X3,X1),X1)|~in(esk25_3(X2,X3,X1),X3))).
% 3.56/0.91 cnf(i_0_64, plain, (X1=relation_dom(X2)|~relation(X2)|~in(unordered_pair(unordered_pair(esk20_2(X2,X1),X3),unordered_pair(esk20_2(X2,X1),esk20_2(X2,X1))),X2)|~in(esk20_2(X2,X1),X1))).
% 3.56/0.91 cnf(i_0_14, plain, (X1=set_meet(X2)|X2=empty_set|in(esk5_2(X2,X1),X1)|in(esk5_2(X2,X1),X3)|~in(X3,X2))).
% 3.56/0.91 cnf(i_0_227, lemma, (subset_difference(X1,X1,meet_of_subsets(X1,X2))=union_of_subsets(X1,complements_of_subsets(X1,X2))|X2=empty_set|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_226, lemma, (subset_difference(X1,X1,union_of_subsets(X1,X2))=meet_of_subsets(X1,complements_of_subsets(X1,X2))|X2=empty_set|~element(X2,powerset(powerset(X1))))).
% 3.56/0.91 cnf(i_0_91, plain, (X1=complements_of_subsets(X2,X3)|element(esk29_3(X2,X3,X1),powerset(X2))|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2))))).
% 3.56/0.91 cnf(i_0_59, plain, (X1=set_difference(X2,set_difference(X2,X3))|~in(esk18_3(X2,X3,X1),X1)|~in(esk18_3(X2,X3,X1),X3)|~in(esk18_3(X2,X3,X1),X2))).
% 3.56/0.91 cnf(i_0_48, plain, (X1=cartesian_product2(X2,X3)|in(esk15_3(X2,X3,X1),X2)|in(esk14_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_47, plain, (X1=cartesian_product2(X2,X3)|in(esk16_3(X2,X3,X1),X3)|in(esk14_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_75, plain, (X1=set_difference(X2,X3)|in(esk25_3(X2,X3,X1),X2)|in(esk25_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_34, plain, (esk10_3(X1,X2,X3)=X1|esk10_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk10_3(X1,X2,X3),X3))).
% 3.56/0.91 cnf(i_0_58, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk18_3(X2,X3,X1),X2)|in(esk18_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_11, plain, (unordered_pair(unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)))=X2|~relation(X1)|~in(X2,X1))).
% 3.56/0.91 cnf(i_0_90, plain, (X1=complements_of_subsets(X2,X3)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2)))|~in(subset_complement(X2,esk29_3(X2,X3,X1)),X3)|~in(esk29_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_49, plain, (X1=cartesian_product2(X2,X3)|esk14_3(X2,X3,X1)!=unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4))|~in(esk14_3(X2,X3,X1),X1)|~in(X5,X3)|~in(X4,X2))).
% 3.56/0.91 cnf(i_0_76, plain, (X1=set_difference(X2,X3)|in(esk25_3(X2,X3,X1),X3)|~in(esk25_3(X2,X3,X1),X1)|~in(esk25_3(X2,X3,X1),X2))).
% 3.56/0.91 cnf(i_0_57, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk18_3(X2,X3,X1),X3)|in(esk18_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_40, plain, (X1=set_union2(X2,X3)|in(esk11_3(X2,X3,X1),X2)|in(esk11_3(X2,X3,X1),X3)|in(esk11_3(X2,X3,X1),X1))).
% 3.56/0.91 cnf(i_0_63, plain, (X1=relation_dom(X2)|in(unordered_pair(unordered_pair(esk20_2(X2,X1),esk20_2(X2,X1)),unordered_pair(esk20_2(X2,X1),esk21_2(X2,X1))),X2)|in(esk20_2(X2,X1),X1)|~relation(X2))).
% 3.56/0.91 cnf(i_0_80, plain, (X1=relation_rng(X2)|in(unordered_pair(unordered_pair(esk27_2(X2,X1),esk28_2(X2,X1)),unordered_pair(esk28_2(X2,X1),esk28_2(X2,X1))),X2)|in(esk27_2(X2,X1),X1)|~relation(X2))).
% 3.56/0.91 cnf(i_0_89, plain, (X1=complements_of_subsets(X2,X3)|in(subset_complement(X2,esk29_3(X2,X3,X1)),X3)|in(esk29_3(X2,X3,X1),X1)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2))))).
% 3.56/0.91 cnf(i_0_46, plain, (unordered_pair(unordered_pair(esk15_3(X1,X2,X3),esk15_3(X1,X2,X3)),unordered_pair(esk15_3(X1,X2,X3),esk16_3(X1,X2,X3)))=esk14_3(X1,X2,X3)|X3=cartesian_product2(X1,X2)|in(esk14_3(X1,X2,X3),X3))).
% 3.56/0.91 cnf(i_0_23, plain, (X1=X2|~in(X1,unordered_pair(X2,X2)))).
% 3.56/0.91 cnf(i_0_78, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_28, plain, (in(X1,powerset(X2))|~subset(X1,X2))).
% 3.56/0.91 cnf(i_0_29, plain, (subset(X1,X2)|~in(X1,powerset(X2)))).
% 3.56/0.91 cnf(i_0_79, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
% 3.56/0.91 cnf(i_0_61, plain, (in(X1,X2)|~in(X1,set_difference(X3,set_difference(X3,X2))))).
% 3.56/0.91 cnf(i_0_43, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_39, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 3.56/0.91 cnf(i_0_44, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_45, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 3.56/0.91 cnf(i_0_71, plain, (in(X1,union(X2))|~in(X3,X2)|~in(X1,X3))).
% 3.56/0.91 cnf(i_0_19, plain, (X1=empty_set|in(X2,X3)|~in(X2,set_meet(X1))|~in(X3,X1))).
% 3.56/0.91 cnf(i_0_77, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_17, plain, (X1=empty_set|in(X2,set_meet(X1))|~in(X2,esk4_3(X1,set_meet(X1),X2)))).
% 3.56/0.91 cnf(i_0_73, plain, (in(X1,esk22_3(X2,union(X2),X1))|~in(X1,union(X2)))).
% 3.56/0.91 cnf(i_0_72, plain, (in(esk22_3(X1,union(X1),X2),X1)|~in(X2,union(X1)))).
% 3.56/0.91 cnf(i_0_60, plain, (in(X1,set_difference(X2,set_difference(X2,X3)))|~in(X1,X3)|~in(X1,X2))).
% 3.56/0.91 cnf(i_0_18, plain, (X1=empty_set|in(esk4_3(X1,set_meet(X1),X2),X1)|in(X2,set_meet(X1)))).
% 3.56/0.91 cnf(i_0_53, plain, (in(esk12_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))).
% 3.56/0.91 cnf(i_0_52, plain, (in(esk13_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))).
% 3.56/0.91 cnf(i_0_66, plain, (in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,esk19_3(X2,relation_dom(X2),X1))),X2)|~relation(X2)|~in(X1,relation_dom(X2)))).
% 3.56/0.91 cnf(i_0_92, plain, (in(X1,complements_of_subsets(X2,X3))|~element(X3,powerset(powerset(X2)))|~element(X1,powerset(X2))|~in(subset_complement(X2,X1),X3))).
% 3.56/0.91 cnf(i_0_93, plain, (in(subset_complement(X1,X2),X3)|~element(X3,powerset(powerset(X1)))|~in(X2,complements_of_subsets(X1,X3)))).
% 3.56/0.91 cnf(i_0_83, plain, (in(unordered_pair(unordered_pair(X1,esk26_3(X2,relation_rng(X2),X1)),unordered_pair(esk26_3(X2,relation_rng(X2),X1),esk26_3(X2,relation_rng(X2),X1))),X2)|~relation(X2)|~in(X1,relation_rng(X2)))).
% 3.56/0.91 cnf(i_0_51, plain, (unordered_pair(unordered_pair(esk12_4(X1,X2,cartesian_product2(X1,X2),X3),esk12_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk12_4(X1,X2,cartesian_product2(X1,X2),X3),esk13_4(X1,X2,cartesian_product2(X1,X2),X3)))=X3|~in(X3,cartesian_product2(X1,X2)))).
% 3.56/0.91 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.56/0.91 # Begin printing tableau
% 3.56/0.91 # Found 5 steps
% 3.56/0.91 cnf(i_0_197, negated_conjecture, (relation(esk41_0)), inference(start_rule)).
% 3.56/0.91 cnf(i_0_309, plain, (relation(esk41_0)), inference(extension_rule, [i_0_122])).
% 3.56/0.91 cnf(i_0_810, plain, (~relation(esk32_0)), inference(closure_rule, [i_0_152])).
% 3.56/0.91 cnf(i_0_808, plain, (relation(set_union2(esk32_0,esk41_0))), inference(extension_rule, [i_0_86])).
% 3.56/0.91 cnf(i_0_908, plain, (set_union2(relation_dom(set_union2(esk32_0,esk41_0)),relation_rng(set_union2(esk32_0,esk41_0)))=relation_field(set_union2(esk32_0,esk41_0))), inference(etableau_closure_rule, [i_0_908, ...])).
% 3.56/0.91 # End printing tableau
% 3.56/0.91 # SZS output end
% 3.56/0.91 # Branches closed with saturation will be marked with an "s"
% 3.56/0.92 # Child (306) has found a proof.
% 3.56/0.92
% 3.56/0.92 # Proof search is over...
% 3.56/0.92 # Freeing feature tree
%------------------------------------------------------------------------------