%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU174+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 : n012.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:29 EDT 2022 % Result : Theorem 0.20s 0.43s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SEU174+2 : TPTP v8.1.0. Released v3.3.0. % 0.10/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.33 % Computer : n012.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jun 20 00:48:37 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 197 Number of unprocessed: 171 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 171 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 3 conjectures. % 0.13/0.39 # There are 3 start rule candidates: % 0.13/0.39 # Found 34 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 3 start rule tableaux created. % 0.13/0.39 # 137 extension rule candidate clauses % 0.13/0.39 # 34 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.39 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 22 tableaux to operate on % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_178, negated_conjecture, (complements_of_subsets(esk27_0,esk28_0)=empty_set)). % 0.20/0.43 cnf(i_0_180, negated_conjecture, (element(esk28_0,powerset(powerset(esk27_0))))). % 0.20/0.43 cnf(i_0_91, plain, (empty(empty_set))). % 0.20/0.43 cnf(i_0_144, lemma, (unordered_pair(empty_set,empty_set)=powerset(empty_set))). % 0.20/0.43 cnf(i_0_121, plain, (empty(esk21_0))). % 0.20/0.43 cnf(i_0_183, plain, (set_difference(empty_set,X1)=empty_set)). % 0.20/0.43 cnf(i_0_151, lemma, (subset(empty_set,X1))). % 0.20/0.43 cnf(i_0_122, plain, (empty(esk22_1(X1)))). % 0.20/0.43 cnf(i_0_205, lemma, (union(powerset(X1))=X1)). % 0.20/0.43 cnf(i_0_141, plain, (set_union2(X1,empty_set)=X1)). % 0.20/0.43 cnf(i_0_167, plain, (set_difference(X1,empty_set)=X1)). % 0.20/0.43 cnf(i_0_125, plain, (subset(X1,X1))). % 0.20/0.43 cnf(i_0_89, plain, (element(esk18_1(X1),X1))). % 0.20/0.43 cnf(i_0_123, plain, (element(esk22_1(X1),powerset(X1)))). % 0.20/0.43 cnf(i_0_95, plain, (set_union2(X1,X1)=X1)). % 0.20/0.43 cnf(i_0_138, lemma, (in(X1,esk24_1(X1)))). % 0.20/0.43 cnf(i_0_210, plain, (in(X1,esk30_1(X1)))). % 0.20/0.43 cnf(i_0_147, plain, (set_difference(X1,X1)=empty_set)). % 0.20/0.43 cnf(i_0_198, lemma, (subset(X1,set_union2(X1,X2)))). % 0.20/0.43 cnf(i_0_155, lemma, (subset(set_difference(X1,X2),X1))). % 0.20/0.43 cnf(i_0_163, lemma, (set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2))). % 0.20/0.43 cnf(i_0_26, plain, (in(X1,unordered_pair(X2,X1)))). % 0.20/0.43 cnf(i_0_27, plain, (in(X1,unordered_pair(X1,X2)))). % 0.20/0.43 cnf(i_0_174, lemma, (set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2))). % 0.20/0.43 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.20/0.43 cnf(i_0_4, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.20/0.43 cnf(i_0_5, plain, (set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1)))). % 0.20/0.43 cnf(i_0_179, negated_conjecture, (esk28_0!=empty_set)). % 0.20/0.43 cnf(i_0_124, plain, (~empty(esk23_0))). % 0.20/0.43 cnf(i_0_99, plain, (~proper_subset(X1,X1))). % 0.20/0.43 cnf(i_0_90, plain, (~empty(powerset(X1)))). % 0.20/0.43 cnf(i_0_100, lemma, (unordered_pair(X1,X1)!=empty_set)). % 0.20/0.43 cnf(i_0_14, plain, (~in(X1,empty_set))). % 0.20/0.43 cnf(i_0_92, plain, (~empty(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))))). % 0.20/0.43 cnf(i_0_195, plain, (X1=empty_set|~empty(X1))). % 0.20/0.43 cnf(i_0_173, lemma, (X1=empty_set|~subset(X1,empty_set))). % 0.20/0.43 cnf(i_0_190, lemma, (~subset(X1,X2)|~proper_subset(X2,X1))). % 0.20/0.43 cnf(i_0_197, plain, (~empty(X1)|~in(X2,X1))). % 0.20/0.43 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.43 cnf(i_0_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))). % 0.20/0.43 cnf(i_0_119, plain, (empty(X1)|~empty(esk20_1(X1)))). % 0.20/0.43 cnf(i_0_75, plain, (subset(X1,X2)|~proper_subset(X1,X2))). % 0.20/0.43 cnf(i_0_142, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.43 cnf(i_0_169, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.43 cnf(i_0_168, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_201, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.43 cnf(i_0_94, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.20/0.43 cnf(i_0_93, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.20/0.43 cnf(i_0_102, lemma, (~disjoint(unordered_pair(X1,X1),X2)|~in(X1,X2))). % 0.20/0.43 cnf(i_0_193, lemma, (set_difference(X1,unordered_pair(X2,X2))!=X1|~in(X2,X1))). % 0.20/0.43 cnf(i_0_107, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.20/0.43 cnf(i_0_106, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_13, plain, (X1=empty_set|in(esk2_1(X1),X1))). % 0.20/0.43 cnf(i_0_200, lemma, (set_difference(X1,X2)=X1|~disjoint(X1,X2))). % 0.20/0.43 cnf(i_0_199, lemma, (disjoint(X1,X2)|set_difference(X1,X2)!=X1)). % 0.20/0.43 cnf(i_0_126, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.20/0.43 cnf(i_0_87, plain, (element(complements_of_subsets(X1,X2),powerset(powerset(X1)))|~element(X2,powerset(powerset(X1))))). % 0.20/0.43 cnf(i_0_120, plain, (element(esk20_1(X1),powerset(X1))|empty(X1))). % 0.20/0.43 cnf(i_0_20, plain, (empty(X1)|~element(X1,X2)|~empty(X2))). % 0.20/0.43 cnf(i_0_117, lemma, (element(X1,powerset(X2))|~in(esk19_2(X1,X2),X2))). % 0.20/0.43 cnf(i_0_170, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.20/0.43 cnf(i_0_6, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_161, lemma, (in(X1,X2)|~subset(unordered_pair(X3,X1),X2))). % 0.20/0.43 cnf(i_0_162, lemma, (in(X1,X2)|~subset(unordered_pair(X1,X3),X2))). % 0.20/0.43 cnf(i_0_134, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_98, plain, (complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2|~element(X2,powerset(powerset(X1))))). % 0.20/0.43 cnf(i_0_19, plain, (element(X1,X2)|~empty(X2)|~empty(X1))). % 0.20/0.43 cnf(i_0_189, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 0.20/0.43 cnf(i_0_82, plain, (element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1)))). % 0.20/0.43 cnf(i_0_43, plain, (subset(X1,X2)|~in(esk11_2(X1,X2),X2))). % 0.20/0.43 cnf(i_0_185, lemma, (~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2))))). % 0.20/0.43 cnf(i_0_211, lemma, (X1=X2|unordered_pair(X3,X3)!=unordered_pair(X1,X2))). % 0.20/0.43 cnf(i_0_203, lemma, (X1=X2|unordered_pair(X1,X1)!=unordered_pair(X2,X3))). % 0.20/0.43 cnf(i_0_66, plain, (disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set)). % 0.20/0.43 cnf(i_0_113, lemma, (subset(X1,union(X2))|~in(X1,X2))). % 0.20/0.43 cnf(i_0_73, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_188, lemma, (~element(X1,powerset(X2))|~in(X3,subset_complement(X2,X1))|~in(X3,X1))). % 0.20/0.43 cnf(i_0_196, lemma, (X1=X2|~subset(unordered_pair(X1,X1),unordered_pair(X2,X2)))). % 0.20/0.43 cnf(i_0_62, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))). % 0.20/0.43 cnf(i_0_22, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.20/0.43 cnf(i_0_184, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.20/0.43 cnf(i_0_45, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.20/0.43 cnf(i_0_143, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))). % 0.20/0.43 cnf(i_0_191, lemma, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))). % 0.20/0.43 cnf(i_0_12, plain, (X1=X2|~in(X1,unordered_pair(X2,X2)))). % 0.20/0.43 cnf(i_0_136, lemma, (in(powerset(X1),esk24_1(X2))|~in(X1,esk24_1(X2)))). % 0.20/0.43 cnf(i_0_64, plain, (subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1)))). % 0.20/0.43 cnf(i_0_67, plain, (set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2))). % 0.20/0.43 cnf(i_0_104, lemma, (subset(unordered_pair(X1,X1),X2)|~in(X1,X2))). % 0.20/0.43 cnf(i_0_17, plain, (in(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_18, plain, (subset(X1,X2)|~in(X1,powerset(X2)))). % 0.20/0.43 cnf(i_0_118, lemma, (element(X1,powerset(X2))|in(esk19_2(X1,X2),X1))). % 0.20/0.43 cnf(i_0_108, lemma, (in(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.20/0.43 cnf(i_0_130, lemma, (X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X2,X3))). % 0.20/0.43 cnf(i_0_97, plain, (subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1)))). % 0.20/0.43 cnf(i_0_150, plain, (X1=X2|~in(esk25_2(X1,X2),X2)|~in(esk25_2(X1,X2),X1))). % 0.20/0.43 cnf(i_0_32, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))). % 0.20/0.43 cnf(i_0_112, lemma, (X1=unordered_pair(X2,X2)|X1=empty_set|~subset(X1,unordered_pair(X2,X2)))). % 0.20/0.43 cnf(i_0_103, lemma, (disjoint(unordered_pair(X1,X1),X2)|in(X1,X2))). % 0.20/0.43 cnf(i_0_28, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))). % 0.20/0.43 cnf(i_0_33, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))). % 0.20/0.43 cnf(i_0_44, plain, (subset(X1,X2)|in(esk11_2(X1,X2),X1))). % 0.20/0.43 cnf(i_0_63, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))). % 0.20/0.43 cnf(i_0_146, lemma, (set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_101, lemma, (set_union2(unordered_pair(X1,X1),X2)=X2|~in(X1,X2))). % 0.20/0.43 cnf(i_0_171, lemma, (disjoint(X1,X2)|in(esk26_2(X1,X2),X2))). % 0.20/0.43 cnf(i_0_172, lemma, (disjoint(X1,X2)|in(esk26_2(X1,X2),X1))). % 0.20/0.43 cnf(i_0_160, lemma, (subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3))). % 0.20/0.43 cnf(i_0_202, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))). % 0.20/0.43 cnf(i_0_175, lemma, (disjoint(X1,X2)|~element(X2,powerset(X3))|~element(X1,powerset(X3))|~subset(X1,subset_complement(X3,X2)))). % 0.20/0.43 cnf(i_0_207, plain, (in(X1,esk31_2(X2,X3))|~subset(X1,X3)|~in(X3,esk30_1(X2)))). % 0.20/0.43 cnf(i_0_192, lemma, (set_difference(X1,unordered_pair(X2,X2))=X1|in(X2,X1))). % 0.20/0.43 cnf(i_0_208, plain, (in(esk31_2(X1,X2),esk30_1(X1))|~in(X2,esk30_1(X1)))). % 0.20/0.43 cnf(i_0_16, plain, (X1=powerset(X2)|~subset(esk3_2(X2,X1),X2)|~in(esk3_2(X2,X1),X1))). % 0.20/0.43 cnf(i_0_132, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))|~subset(X1,X3))). % 0.20/0.43 cnf(i_0_131, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))|~subset(X2,X3))). % 0.20/0.43 cnf(i_0_152, lemma, (subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3))). % 0.20/0.43 cnf(i_0_55, plain, (in(X1,union(X2))|~in(X3,X2)|~in(X1,X3))). % 0.20/0.43 cnf(i_0_24, plain, (X1=unordered_pair(X2,X3)|esk4_3(X2,X3,X1)!=X3|~in(esk4_3(X2,X3,X1),X1))). % 0.20/0.43 cnf(i_0_25, plain, (X1=unordered_pair(X2,X3)|esk4_3(X2,X3,X1)!=X2|~in(esk4_3(X2,X3,X1),X1))). % 0.20/0.43 cnf(i_0_115, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),cartesian_product2(X4,X2)))). % 0.20/0.43 cnf(i_0_176, lemma, (subset(X1,subset_complement(X2,X3))|~disjoint(X1,X3)|~element(X3,powerset(X2))|~element(X1,powerset(X2)))). % 0.20/0.43 cnf(i_0_135, lemma, (are_equipotent(X1,esk24_1(X2))|in(X1,esk24_1(X2))|~subset(X1,esk24_1(X2)))). % 0.20/0.43 cnf(i_0_206, plain, (are_equipotent(X1,esk30_1(X2))|in(X1,esk30_1(X2))|~subset(X1,esk30_1(X2)))). % 0.20/0.43 cnf(i_0_57, plain, (in(X1,esk13_3(X2,union(X2),X1))|~in(X1,union(X2)))). % 0.20/0.43 cnf(i_0_116, lemma, (in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),cartesian_product2(X2,X4)))). % 0.20/0.43 cnf(i_0_50, plain, (in(X1,X2)|~in(X1,set_difference(X3,set_difference(X3,X2))))). % 0.20/0.43 cnf(i_0_137, lemma, (in(X1,esk24_1(X2))|~subset(X1,X3)|~in(X3,esk24_1(X2)))). % 0.20/0.43 cnf(i_0_209, plain, (in(X1,esk30_1(X2))|~subset(X1,X3)|~in(X3,esk30_1(X2)))). % 0.20/0.43 cnf(i_0_56, plain, (in(esk13_3(X1,union(X1),X2),X1)|~in(X2,union(X1)))). % 0.20/0.43 cnf(i_0_10, plain, (X1=unordered_pair(X2,X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.20/0.43 cnf(i_0_9, plain, (esk1_2(X1,X2)=X1|X2=unordered_pair(X1,X1)|in(esk1_2(X1,X2),X2))). % 0.20/0.43 cnf(i_0_186, lemma, (disjoint(X1,X2)|in(esk29_2(X1,X2),set_difference(X1,set_difference(X1,X2))))). % 0.20/0.43 cnf(i_0_54, plain, (X1=union(X2)|~in(esk14_2(X2,X1),X3)|~in(esk14_2(X2,X1),X1)|~in(X3,X2))). % 0.20/0.43 cnf(i_0_30, plain, (X1=set_union2(X2,X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X3))). % 0.20/0.43 cnf(i_0_133, lemma, (subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~subset(X2,X4)|~subset(X1,X3))). % 0.20/0.43 cnf(i_0_70, plain, (X1=complements_of_subsets(X2,X3)|element(esk17_3(X2,X3,X1),powerset(X2))|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2))))). % 0.20/0.43 cnf(i_0_140, lemma, (subset(X1,set_difference(X2,set_difference(X2,X3)))|~subset(X1,X3)|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_187, lemma, (X1=empty_set|in(X2,subset_complement(X1,X3))|in(X2,X3)|~element(X3,powerset(X1))|~element(X2,X1))). % 0.20/0.43 cnf(i_0_42, plain, (in(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.43 cnf(i_0_109, lemma, (subset(X1,set_difference(X2,unordered_pair(X3,X3)))|in(X3,X1)|~subset(X1,X2))). % 0.20/0.43 cnf(i_0_31, plain, (X1=set_union2(X2,X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X2))). % 0.20/0.43 cnf(i_0_153, lemma, (X1=X2|unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3))!=unordered_pair(unordered_pair(X4,X2),unordered_pair(X4,X4)))). % 0.20/0.43 cnf(i_0_154, lemma, (X1=X2|unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1))!=unordered_pair(unordered_pair(X2,X4),unordered_pair(X2,X2)))). % 0.20/0.43 cnf(i_0_49, plain, (in(X1,set_difference(X2,set_difference(X2,X3)))|~in(X1,X3)|~in(X1,X2))). % 0.20/0.43 cnf(i_0_61, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))). % 0.20/0.43 cnf(i_0_41, plain, (in(esk7_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))). % 0.20/0.43 cnf(i_0_34, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))). % 0.20/0.43 cnf(i_0_149, plain, (X1=X2|in(esk25_2(X1,X2),X1)|in(esk25_2(X1,X2),X2))). % 0.20/0.43 cnf(i_0_58, plain, (X1=set_difference(X2,X3)|in(esk16_3(X2,X3,X1),X1)|~in(esk16_3(X2,X3,X1),X3))). % 0.20/0.43 cnf(i_0_145, lemma, (subset(set_difference(X1,set_difference(X1,X2)),set_difference(X3,set_difference(X3,X2)))|~subset(X1,X3))). % 0.20/0.43 cnf(i_0_15, plain, (X1=powerset(X2)|subset(esk3_2(X2,X1),X2)|in(esk3_2(X2,X1),X1))). % 0.20/0.43 cnf(i_0_52, plain, (X1=union(X2)|in(esk15_2(X2,X1),X2)|in(esk14_2(X2,X1),X1))). % 0.20/0.43 cnf(i_0_71, plain, (in(X1,complements_of_subsets(X2,X3))|~element(X3,powerset(powerset(X2)))|~element(X1,powerset(X2))|~in(subset_complement(X2,X1),X3))). % 0.20/0.43 cnf(i_0_53, plain, (X1=union(X2)|in(esk14_2(X2,X1),esk15_2(X2,X1))|in(esk14_2(X2,X1),X1))). % 0.20/0.43 cnf(i_0_39, plain, (in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 0.20/0.43 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))). % 0.20/0.43 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))). % 0.20/0.44 cnf(i_0_69, plain, (X1=complements_of_subsets(X2,X3)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2)))|~in(subset_complement(X2,esk17_3(X2,X3,X1)),X3)|~in(esk17_3(X2,X3,X1),X1))). % 0.20/0.44 cnf(i_0_37, plain, (X1=cartesian_product2(X2,X3)|in(esk9_3(X2,X3,X1),X2)|in(esk8_3(X2,X3,X1),X1))). % 0.20/0.44 cnf(i_0_72, plain, (in(subset_complement(X1,X2),X3)|~element(X3,powerset(powerset(X1)))|~in(X2,complements_of_subsets(X1,X3)))). % 0.20/0.44 cnf(i_0_36, plain, (X1=cartesian_product2(X2,X3)|in(esk10_3(X2,X3,X1),X3)|in(esk8_3(X2,X3,X1),X1))). % 0.20/0.44 cnf(i_0_59, plain, (X1=set_difference(X2,X3)|in(esk16_3(X2,X3,X1),X2)|in(esk16_3(X2,X3,X1),X1))). % 0.20/0.44 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))). % 0.20/0.44 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))). % 0.20/0.44 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))). % 0.20/0.44 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))). % 0.20/0.44 cnf(i_0_68, plain, (X1=complements_of_subsets(X2,X3)|in(subset_complement(X2,esk17_3(X2,X3,X1)),X3)|in(esk17_3(X2,X3,X1),X1)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2))))). % 0.20/0.44 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))). % 0.20/0.44 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))). % 0.20/0.44 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)))). % 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 5 steps % 0.20/0.44 cnf(i_0_179, negated_conjecture, (esk28_0!=empty_set), inference(start_rule)). % 0.20/0.44 cnf(i_0_249, plain, (esk28_0!=empty_set), inference(extension_rule, [i_0_149])). % 0.20/0.44 cnf(i_0_532, plain, (in(esk25_2(esk28_0,empty_set),empty_set)), inference(closure_rule, [i_0_14])). % 0.20/0.44 cnf(i_0_531, plain, (in(esk25_2(esk28_0,empty_set),esk28_0)), inference(extension_rule, [i_0_197])). % 0.20/0.44 cnf(i_0_614, plain, (~empty(esk28_0)), inference(etableau_closure_rule, [i_0_614, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # There were 1 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 1 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 1 successful branch saturations after the branch. % 0.20/0.44 # Child (29361) has found a proof. % 0.20/0.44 % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------