TSTP Solution File: SEU170+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU170+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 : n014.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:27 EDT 2022
% Result : Theorem 10.41s 1.75s
% Output : CNFRefutation 10.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU170+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 21:26:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.39 # No SInE strategy applied
% 0.12/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.12/0.39 # and selection function SelectNewComplexAHP.
% 0.12/0.39 #
% 0.12/0.39 # Presaturation interreduction done
% 0.12/0.39 # Number of axioms: 179 Number of unprocessed: 155
% 0.12/0.39 # Tableaux proof search.
% 0.12/0.39 # APR header successfully linked.
% 0.12/0.39 # Hello from C++
% 0.12/0.39 # The folding up rule is enabled...
% 0.12/0.39 # Local unification is enabled...
% 0.12/0.39 # Any saturation attempts will use folding labels...
% 0.12/0.39 # 155 beginning clauses after preprocessing and clausification
% 0.12/0.39 # Creating start rules for all 4 conjectures.
% 0.12/0.39 # There are 4 start rule candidates:
% 0.12/0.39 # Found 33 unit axioms.
% 0.12/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.39 # 4 start rule tableaux created.
% 0.12/0.39 # 122 extension rule candidate clauses
% 0.12/0.39 # 33 unit axiom clauses
% 0.12/0.39
% 0.12/0.39 # Requested 8, 32 cores available to the main process.
% 0.12/0.39 # There are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.39 # Returning from population with 35 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.39 # We now have 35 tableaux to operate on
% 10.41/1.75 # There were 2 total branch saturation attempts.
% 10.41/1.75 # There were 0 of these attempts blocked.
% 10.41/1.75 # There were 0 deferred branch saturation attempts.
% 10.41/1.75 # There were 0 free duplicated saturations.
% 10.41/1.75 # There were 2 total successful branch saturations.
% 10.41/1.75 # There were 0 successful branch saturations in interreduction.
% 10.41/1.75 # There were 0 successful branch saturations on the branch.
% 10.41/1.75 # There were 2 successful branch saturations after the branch.
% 10.41/1.75 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.41/1.75 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.41/1.75 # Begin clausification derivation
% 10.41/1.75
% 10.41/1.75 # End clausification derivation
% 10.41/1.75 # Begin listing active clauses obtained from FOF to CNF conversion
% 10.41/1.75 cnf(i_0_85, plain, (empty(empty_set))).
% 10.41/1.75 cnf(i_0_165, negated_conjecture, (element(esk26_0,powerset(esk25_0)))).
% 10.41/1.75 cnf(i_0_164, negated_conjecture, (element(esk27_0,powerset(esk25_0)))).
% 10.41/1.75 cnf(i_0_112, plain, (empty(esk19_0))).
% 10.41/1.75 cnf(i_0_140, lemma, (subset(empty_set,X1))).
% 10.41/1.75 cnf(i_0_116, plain, (subset(X1,X1))).
% 10.41/1.75 cnf(i_0_187, lemma, (union(powerset(X1))=X1)).
% 10.41/1.75 cnf(i_0_113, plain, (empty(esk20_1(X1)))).
% 10.41/1.75 cnf(i_0_134, lemma, (powerset(empty_set)=unordered_pair(empty_set,empty_set))).
% 10.41/1.75 cnf(i_0_169, plain, (set_difference(empty_set,X1)=empty_set)).
% 10.41/1.75 cnf(i_0_83, plain, (element(esk17_1(X1),X1))).
% 10.41/1.75 cnf(i_0_114, plain, (element(esk20_1(X1),powerset(X1)))).
% 10.41/1.75 cnf(i_0_132, plain, (set_union2(X1,empty_set)=X1)).
% 10.41/1.75 cnf(i_0_156, plain, (set_difference(X1,empty_set)=X1)).
% 10.41/1.75 cnf(i_0_89, plain, (set_union2(X1,X1)=X1)).
% 10.41/1.75 cnf(i_0_129, lemma, (in(X1,esk22_1(X1)))).
% 10.41/1.75 cnf(i_0_192, plain, (in(X1,esk29_1(X1)))).
% 10.41/1.75 cnf(i_0_180, lemma, (subset(X1,set_union2(X1,X2)))).
% 10.41/1.75 cnf(i_0_144, lemma, (subset(set_difference(X1,X2),X1))).
% 10.41/1.75 cnf(i_0_137, plain, (set_difference(X1,X1)=empty_set)).
% 10.41/1.75 cnf(i_0_152, lemma, (set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2))).
% 10.41/1.75 cnf(i_0_161, lemma, (set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2))).
% 10.41/1.75 cnf(i_0_26, plain, (in(X1,unordered_pair(X2,X1)))).
% 10.41/1.75 cnf(i_0_27, plain, (in(X1,unordered_pair(X1,X2)))).
% 10.41/1.75 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 10.41/1.75 cnf(i_0_4, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 10.41/1.75 cnf(i_0_5, plain, (set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1)))).
% 10.41/1.75 cnf(i_0_115, plain, (~empty(esk21_0))).
% 10.41/1.75 cnf(i_0_84, plain, (~empty(powerset(X1)))).
% 10.41/1.75 cnf(i_0_92, plain, (~proper_subset(X1,X1))).
% 10.41/1.75 cnf(i_0_93, lemma, (unordered_pair(X1,X1)!=empty_set)).
% 10.41/1.75 cnf(i_0_86, plain, (~empty(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))))).
% 10.41/1.75 cnf(i_0_14, plain, (~in(X1,empty_set))).
% 10.41/1.75 cnf(i_0_163, negated_conjecture, (~disjoint(esk26_0,esk27_0)|~subset(esk26_0,subset_complement(esk25_0,esk27_0)))).
% 10.41/1.75 cnf(i_0_162, negated_conjecture, (disjoint(esk26_0,esk27_0)|subset(esk26_0,subset_complement(esk25_0,esk27_0)))).
% 10.41/1.75 cnf(i_0_177, plain, (X1=empty_set|~empty(X1))).
% 10.41/1.75 cnf(i_0_160, lemma, (X1=empty_set|~subset(X1,empty_set))).
% 10.41/1.75 cnf(i_0_179, plain, (~empty(X1)|~in(X2,X1))).
% 10.41/1.75 cnf(i_0_172, lemma, (~subset(X1,X2)|~proper_subset(X2,X1))).
% 10.41/1.75 cnf(i_0_110, plain, (empty(X1)|~empty(esk18_1(X1)))).
% 10.41/1.75 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 10.41/1.75 cnf(i_0_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))).
% 10.41/1.75 cnf(i_0_88, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 10.41/1.75 cnf(i_0_87, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 10.41/1.75 cnf(i_0_70, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
% 10.41/1.75 cnf(i_0_117, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 10.41/1.75 cnf(i_0_20, plain, (empty(X1)|~element(X1,X2)|~empty(X2))).
% 10.41/1.75 cnf(i_0_181, lemma, (disjoint(X1,X2)|set_difference(X1,X2)!=X1)).
% 10.41/1.75 cnf(i_0_183, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 10.41/1.75 cnf(i_0_95, lemma, (~disjoint(unordered_pair(X1,X1),X2)|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_100, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)).
% 10.41/1.75 cnf(i_0_182, lemma, (set_difference(X1,X2)=X1|~disjoint(X1,X2))).
% 10.41/1.75 cnf(i_0_19, plain, (element(X1,X2)|~empty(X2)|~empty(X1))).
% 10.41/1.75 cnf(i_0_6, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_13, plain, (X1=empty_set|in(esk2_1(X1),X1))).
% 10.41/1.75 cnf(i_0_99, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_175, lemma, (set_difference(X1,unordered_pair(X2,X2))!=X1|~in(X2,X1))).
% 10.41/1.75 cnf(i_0_157, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))).
% 10.41/1.75 cnf(i_0_150, lemma, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))).
% 10.41/1.75 cnf(i_0_64, plain, (subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1)))).
% 10.41/1.75 cnf(i_0_77, plain, (element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1)))).
% 10.41/1.75 cnf(i_0_106, lemma, (subset(X1,union(X2))|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_125, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_151, lemma, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))).
% 10.41/1.75 cnf(i_0_43, plain, (subset(X1,X2)|~in(esk11_2(X1,X2),X2))).
% 10.41/1.75 cnf(i_0_111, plain, (element(esk18_1(X1),powerset(X1))|empty(X1))).
% 10.41/1.75 cnf(i_0_22, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 10.41/1.75 cnf(i_0_91, plain, (subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1)))).
% 10.41/1.75 cnf(i_0_21, plain, (element(X1,X2)|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_170, lemma, (~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2))))).
% 10.41/1.75 cnf(i_0_193, lemma, (X1=X2|unordered_pair(X3,X3)!=unordered_pair(X1,X2))).
% 10.41/1.75 cnf(i_0_185, lemma, (X1=X2|unordered_pair(X1,X1)!=unordered_pair(X2,X3))).
% 10.41/1.75 cnf(i_0_178, lemma, (X1=X2|~subset(unordered_pair(X1,X1),unordered_pair(X2,X2)))).
% 10.41/1.75 cnf(i_0_133, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 10.41/1.75 cnf(i_0_173, lemma, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))).
% 10.41/1.75 cnf(i_0_68, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_45, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 10.41/1.75 cnf(i_0_97, lemma, (subset(unordered_pair(X1,X1),X2)|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_66, plain, (disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set)).
% 10.41/1.75 cnf(i_0_127, lemma, (in(powerset(X1),esk22_1(X2))|~in(X1,esk22_1(X2)))).
% 10.41/1.75 cnf(i_0_96, lemma, (disjoint(unordered_pair(X1,X1),X2)|in(X1,X2))).
% 10.41/1.75 cnf(i_0_184, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))).
% 10.41/1.75 cnf(i_0_44, plain, (subset(X1,X2)|in(esk11_2(X1,X2),X1))).
% 10.41/1.75 cnf(i_0_158, lemma, (disjoint(X1,X2)|in(esk24_2(X1,X2),X2))).
% 10.41/1.75 cnf(i_0_159, lemma, (disjoint(X1,X2)|in(esk24_2(X1,X2),X1))).
% 10.41/1.75 cnf(i_0_121, lemma, (X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X2,X3))).
% 10.41/1.75 cnf(i_0_101, lemma, (in(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 10.41/1.75 cnf(i_0_139, plain, (X1=X2|~in(esk23_2(X1,X2),X2)|~in(esk23_2(X1,X2),X1))).
% 10.41/1.75 cnf(i_0_136, lemma, (set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_105, lemma, (X1=unordered_pair(X2,X2)|X1=empty_set|~subset(X1,unordered_pair(X2,X2)))).
% 10.41/1.75 cnf(i_0_149, lemma, (subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3))).
% 10.41/1.75 cnf(i_0_94, lemma, (set_union2(unordered_pair(X1,X1),X2)=X2|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_174, lemma, (set_difference(X1,unordered_pair(X2,X2))=X1|in(X2,X1))).
% 10.41/1.75 cnf(i_0_190, plain, (in(esk30_2(X1,X2),esk29_1(X1))|~in(X2,esk29_1(X1)))).
% 10.41/1.75 cnf(i_0_189, plain, (in(X1,esk30_2(X2,X3))|~subset(X1,X3)|~in(X3,esk29_1(X2)))).
% 10.41/1.75 cnf(i_0_67, plain, (set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2))).
% 10.41/1.75 cnf(i_0_123, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))|~subset(X1,X3))).
% 10.41/1.75 cnf(i_0_122, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))|~subset(X2,X3))).
% 10.41/1.75 cnf(i_0_141, lemma, (subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3))).
% 10.41/1.75 cnf(i_0_16, plain, (X1=powerset(X2)|~subset(esk3_2(X2,X1),X2)|~in(esk3_2(X2,X1),X1))).
% 10.41/1.75 cnf(i_0_126, lemma, (are_equipotent(X1,esk22_1(X2))|in(X1,esk22_1(X2))|~subset(X1,esk22_1(X2)))).
% 10.41/1.75 cnf(i_0_128, lemma, (in(X1,esk22_1(X2))|~subset(X1,X3)|~in(X3,esk22_1(X2)))).
% 10.41/1.75 cnf(i_0_191, plain, (in(X1,esk29_1(X2))|~subset(X1,X3)|~in(X3,esk29_1(X2)))).
% 10.41/1.75 cnf(i_0_108, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),cartesian_product2(X4,X2)))).
% 10.41/1.75 cnf(i_0_188, plain, (are_equipotent(X1,esk29_1(X2))|in(X1,esk29_1(X2))|~subset(X1,esk29_1(X2)))).
% 10.41/1.75 cnf(i_0_124, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~subset(X2,X4)|~subset(X1,X3))).
% 10.41/1.75 cnf(i_0_131, lemma, (subset(X1,set_difference(X2,set_difference(X2,X3)))|~subset(X1,X3)|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_9, plain, (esk1_2(X1,X2)=X1|X2=unordered_pair(X1,X1)|in(esk1_2(X1,X2),X2))).
% 10.41/1.75 cnf(i_0_109, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),cartesian_product2(X2,X4)))).
% 10.41/1.75 cnf(i_0_24, plain, (X1=unordered_pair(X2,X3)|esk4_3(X2,X3,X1)!=X3|~in(esk4_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_25, plain, (X1=unordered_pair(X2,X3)|esk4_3(X2,X3,X1)!=X2|~in(esk4_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_102, lemma, (subset(X1,set_difference(X2,unordered_pair(X3,X3)))|in(X3,X1)|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_10, plain, (X1=unordered_pair(X2,X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))).
% 10.41/1.75 cnf(i_0_54, plain, (X1=union(X2)|~in(esk14_2(X2,X1),X3)|~in(esk14_2(X2,X1),X1)|~in(X3,X2))).
% 10.41/1.75 cnf(i_0_171, lemma, (disjoint(X1,X2)|in(esk28_2(X1,X2),set_difference(X1,set_difference(X1,X2))))).
% 10.41/1.75 cnf(i_0_142, lemma, (X1=X2|unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3))!=unordered_pair(unordered_pair(X4,X2),unordered_pair(X4,X4)))).
% 10.41/1.75 cnf(i_0_143, lemma, (X1=X2|unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1))!=unordered_pair(unordered_pair(X2,X4),unordered_pair(X2,X2)))).
% 10.41/1.75 cnf(i_0_30, plain, (X1=set_union2(X2,X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X3))).
% 10.41/1.75 cnf(i_0_31, plain, (X1=set_union2(X2,X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X2))).
% 10.41/1.75 cnf(i_0_15, plain, (X1=powerset(X2)|subset(esk3_2(X2,X1),X2)|in(esk3_2(X2,X1),X1))).
% 10.41/1.75 cnf(i_0_135, lemma, (subset(set_difference(X1,set_difference(X1,X2)),set_difference(X3,set_difference(X3,X2)))|~subset(X1,X3))).
% 10.41/1.75 cnf(i_0_138, plain, (X1=X2|in(esk23_2(X1,X2),X1)|in(esk23_2(X1,X2),X2))).
% 10.41/1.75 cnf(i_0_52, plain, (X1=union(X2)|in(esk15_2(X2,X1),X2)|in(esk14_2(X2,X1),X1))).
% 10.41/1.75 cnf(i_0_58, plain, (X1=set_difference(X2,X3)|in(esk16_3(X2,X3,X1),X1)|~in(esk16_3(X2,X3,X1),X3))).
% 10.41/1.75 cnf(i_0_53, plain, (X1=union(X2)|in(esk14_2(X2,X1),esk15_2(X2,X1))|in(esk14_2(X2,X1),X1))).
% 10.41/1.75 cnf(i_0_23, plain, (esk4_3(X1,X2,X3)=X1|esk4_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk4_3(X1,X2,X3),X3))).
% 10.41/1.75 cnf(i_0_107, lemma, (in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 10.41/1.75 cnf(i_0_37, plain, (X1=cartesian_product2(X2,X3)|in(esk9_3(X2,X3,X1),X2)|in(esk8_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_36, plain, (X1=cartesian_product2(X2,X3)|in(esk10_3(X2,X3,X1),X3)|in(esk8_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_59, plain, (X1=set_difference(X2,X3)|in(esk16_3(X2,X3,X1),X2)|in(esk16_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_47, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk12_3(X2,X3,X1),X2)|in(esk12_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_48, plain, (X1=set_difference(X2,set_difference(X2,X3))|~in(esk12_3(X2,X3,X1),X1)|~in(esk12_3(X2,X3,X1),X3)|~in(esk12_3(X2,X3,X1),X2))).
% 10.41/1.75 cnf(i_0_38, plain, (X1=cartesian_product2(X2,X3)|esk8_3(X2,X3,X1)!=unordered_pair(unordered_pair(X4,X5),unordered_pair(X4,X4))|~in(esk8_3(X2,X3,X1),X1)|~in(X5,X3)|~in(X4,X2))).
% 10.41/1.75 cnf(i_0_60, plain, (X1=set_difference(X2,X3)|in(esk16_3(X2,X3,X1),X3)|~in(esk16_3(X2,X3,X1),X1)|~in(esk16_3(X2,X3,X1),X2))).
% 10.41/1.75 cnf(i_0_46, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk12_3(X2,X3,X1),X3)|in(esk12_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_29, plain, (X1=set_union2(X2,X3)|in(esk5_3(X2,X3,X1),X2)|in(esk5_3(X2,X3,X1),X3)|in(esk5_3(X2,X3,X1),X1))).
% 10.41/1.75 cnf(i_0_35, plain, (unordered_pair(unordered_pair(esk9_3(X1,X2,X3),esk9_3(X1,X2,X3)),unordered_pair(esk9_3(X1,X2,X3),esk10_3(X1,X2,X3)))=esk8_3(X1,X2,X3)|X3=cartesian_product2(X1,X2)|in(esk8_3(X1,X2,X3),X3))).
% 10.41/1.75 cnf(i_0_62, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
% 10.41/1.75 cnf(i_0_18, plain, (subset(X1,X2)|~in(X1,powerset(X2)))).
% 10.41/1.75 cnf(i_0_12, plain, (X1=X2|~in(X1,unordered_pair(X2,X2)))).
% 10.41/1.75 cnf(i_0_63, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
% 10.41/1.75 cnf(i_0_17, plain, (in(X1,powerset(X2))|~subset(X1,X2))).
% 10.41/1.75 cnf(i_0_28, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 10.41/1.75 cnf(i_0_32, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 10.41/1.75 cnf(i_0_33, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_55, plain, (in(X1,union(X2))|~in(X3,X2)|~in(X1,X3))).
% 10.41/1.75 cnf(i_0_50, plain, (in(X1,X2)|~in(X1,set_difference(X3,set_difference(X3,X2))))).
% 10.41/1.75 cnf(i_0_34, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 10.41/1.75 cnf(i_0_61, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_57, plain, (in(X1,esk13_3(X2,union(X2),X1))|~in(X1,union(X2)))).
% 10.41/1.75 cnf(i_0_56, plain, (in(esk13_3(X1,union(X1),X2),X1)|~in(X2,union(X1)))).
% 10.41/1.75 cnf(i_0_49, plain, (in(X1,set_difference(X2,set_difference(X2,X3)))|~in(X1,X3)|~in(X1,X2))).
% 10.41/1.75 cnf(i_0_42, plain, (in(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))).
% 10.41/1.75 cnf(i_0_41, plain, (in(esk7_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))).
% 10.41/1.75 cnf(i_0_40, plain, (unordered_pair(unordered_pair(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),esk6_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),esk7_4(X1,X2,cartesian_product2(X1,X2),X3)))=X3|~in(X3,cartesian_product2(X1,X2)))).
% 10.41/1.75 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 10.41/1.75 # Begin printing tableau
% 10.41/1.75 # Found 5 steps
% 10.41/1.75 cnf(i_0_162, negated_conjecture, (disjoint(esk26_0,esk27_0)|subset(esk26_0,subset_complement(esk25_0,esk27_0))), inference(start_rule)).
% 10.41/1.75 cnf(i_0_230, plain, (subset(esk26_0,subset_complement(esk25_0,esk27_0))), inference(extension_rule, [i_0_135])).
% 10.41/1.75 cnf(i_0_744, plain, (subset(set_difference(esk26_0,set_difference(esk26_0,X6)),set_difference(subset_complement(esk25_0,esk27_0),set_difference(subset_complement(esk25_0,esk27_0),X6)))), inference(extension_rule, [i_0_172])).
% 10.41/1.75 cnf(i_0_229, plain, (disjoint(esk26_0,esk27_0)), inference(etableau_closure_rule, [i_0_229, ...])).
% 10.41/1.75 cnf(i_0_852, plain, (~proper_subset(set_difference(subset_complement(esk25_0,esk27_0),set_difference(subset_complement(esk25_0,esk27_0),X6)),set_difference(esk26_0,set_difference(esk26_0,X6)))), inference(etableau_closure_rule, [i_0_852, ...])).
% 10.41/1.75 # End printing tableau
% 10.41/1.75 # SZS output end
% 10.41/1.75 # Branches closed with saturation will be marked with an "s"
% 10.41/1.76 # Child (5977) has found a proof.
% 10.41/1.76
% 10.41/1.76 # Proof search is over...
% 10.41/1.76 # Freeing feature tree
%------------------------------------------------------------------------------