TSTP Solution File: SET025-9 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET025-9 : TPTP v8.1.0. Released v1.0.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 : n023.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 00:56:34 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET025-9 : TPTP v8.1.0. Released v1.0.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.12/0.33 % Computer : n023.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 : Sun Jul 10 17:30:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.12/0.35 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.35 #
% 0.12/0.35 # Number of axioms: 137 Number of unprocessed: 137
% 0.12/0.35 # Tableaux proof search.
% 0.12/0.35 # APR header successfully linked.
% 0.12/0.35 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 137 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 7 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 130 extension rule candidate clauses
% 0.12/0.37 # 7 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_203, plain, (little_set(infinity))).
% 0.12/0.37 cnf(i_0_285, hypothesis, (ordered_pair_predicate(a))).
% 0.12/0.37 cnf(i_0_243, plain, (function(f25))).
% 0.12/0.37 cnf(i_0_286, negated_conjecture, (~little_set(a))).
% 0.12/0.37 cnf(i_0_204, plain, (member(empty_set,infinity))).
% 0.12/0.37 cnf(i_0_229, plain, (relation(X1)|~function(X1))).
% 0.12/0.37 cnf(i_0_230, plain, (single_valued_set(X1)|~function(X1))).
% 0.12/0.37 cnf(i_0_254, plain, (function(X1)|~one_to_one_function(X1))).
% 0.12/0.37 cnf(i_0_223, plain, (single_valued_set(X1)|little_set(f19(X1)))).
% 0.12/0.37 cnf(i_0_224, plain, (single_valued_set(X1)|little_set(f20(X1)))).
% 0.12/0.37 cnf(i_0_225, plain, (single_valued_set(X1)|little_set(f21(X1)))).
% 0.12/0.37 cnf(i_0_228, plain, (single_valued_set(X1)|f21(X1)!=f20(X1))).
% 0.12/0.37 cnf(i_0_154, plain, (little_set(f2(X1))|~ordered_pair_predicate(X1))).
% 0.12/0.37 cnf(i_0_155, plain, (little_set(f3(X1))|~ordered_pair_predicate(X1))).
% 0.12/0.37 cnf(i_0_209, plain, (little_set(sigma(X1))|~little_set(X1))).
% 0.12/0.37 cnf(i_0_218, plain, (little_set(powerset(X1))|~little_set(X1))).
% 0.12/0.37 cnf(i_0_255, plain, (function(converse(X1))|~one_to_one_function(X1))).
% 0.12/0.37 cnf(i_0_231, plain, (function(X1)|~relation(X1)|~single_valued_set(X1))).
% 0.12/0.37 cnf(i_0_202, plain, (member(X1,universal_set)|~little_set(X1))).
% 0.12/0.37 cnf(i_0_201, plain, (~member(X1,empty_set))).
% 0.12/0.37 cnf(i_0_221, plain, (relation(X1)|~ordered_pair_predicate(f18(X1)))).
% 0.12/0.37 cnf(i_0_241, plain, (X1=empty_set|member(f24(X1),X1))).
% 0.12/0.37 cnf(i_0_242, plain, (X1=empty_set|disjoint(f24(X1),X1))).
% 0.12/0.37 cnf(i_0_168, plain, (ordered_pair_predicate(X1)|~member(X1,estin))).
% 0.12/0.37 cnf(i_0_250, plain, (ordered_pair_predicate(X1)|~member(X1,identity_relation))).
% 0.12/0.37 cnf(i_0_220, plain, (relation(X1)|member(f18(X1),X1))).
% 0.12/0.37 cnf(i_0_214, plain, (X1!=X2|~proper_subset(X1,X2))).
% 0.12/0.37 cnf(i_0_268, plain, (little_set(X2)|~closed(X1,X2))).
% 0.12/0.37 cnf(i_0_144, plain, (little_set(X1)|~member(X1,X2))).
% 0.12/0.37 cnf(i_0_267, plain, (little_set(X1)|~closed(X1,X2))).
% 0.12/0.37 cnf(i_0_256, plain, (one_to_one_function(X1)|~function(X1)|~function(converse(X1)))).
% 0.12/0.37 cnf(i_0_251, plain, (first(X1)=second(X1)|~member(X1,identity_relation))).
% 0.12/0.37 cnf(i_0_244, plain, (X1=empty_set|member(f26(X1),X1)|~little_set(X1))).
% 0.12/0.37 cnf(i_0_151, plain, (little_set(non_ordered_pair(X1,X2)))).
% 0.12/0.37 cnf(i_0_145, plain, (X1=X2|little_set(f1(X1,X2)))).
% 0.12/0.37 cnf(i_0_219, plain, (ordered_pair_predicate(X2)|~relation(X1)|~member(X2,X1))).
% 0.12/0.37 cnf(i_0_185, plain, (ordered_pair_predicate(X1)|~member(X1,converse(X2)))).
% 0.12/0.37 cnf(i_0_213, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
% 0.12/0.37 cnf(i_0_215, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_252, plain, (member(X1,identity_relation)|first(X1)!=second(X1)|~little_set(X1)|~ordered_pair_predicate(X1))).
% 0.12/0.37 cnf(i_0_175, plain, (member(X1,X2)|member(X1,complement(X2))|~little_set(X1))).
% 0.12/0.37 cnf(i_0_237, plain, (little_set(image(X1,X2))|~little_set(X1)|~function(X2))).
% 0.12/0.37 cnf(i_0_216, plain, (subset(X1,X2)|~member(X1,powerset(X2)))).
% 0.12/0.37 cnf(i_0_169, plain, (member(first(X1),second(X1))|~member(X1,estin))).
% 0.12/0.37 cnf(i_0_217, plain, (member(X1,powerset(X2))|~little_set(X1)|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_150, plain, (member(X1,non_ordered_pair(X2,X3))|X1!=X3|~little_set(X1))).
% 0.12/0.37 cnf(i_0_149, plain, (member(X1,non_ordered_pair(X2,X3))|X1!=X2|~little_set(X1))).
% 0.12/0.37 cnf(i_0_211, plain, (subset(X1,X2)|member(f17(X1,X2),X1))).
% 0.12/0.37 cnf(i_0_240, plain, (disjoint(X1,X2)|member(f23(X1,X2),X2))).
% 0.12/0.37 cnf(i_0_239, plain, (disjoint(X1,X2)|member(f23(X1,X2),X1))).
% 0.12/0.37 cnf(i_0_174, plain, (~member(X1,X2)|~member(X1,complement(X2)))).
% 0.12/0.37 cnf(i_0_210, plain, (member(X3,X2)|~member(X3,X1)|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_158, plain, (little_set(f4(X1,X2))|~member(X1,first(X2)))).
% 0.12/0.37 cnf(i_0_159, plain, (little_set(f5(X1,X2))|~member(X1,first(X2)))).
% 0.12/0.37 cnf(i_0_163, plain, (little_set(f6(X1,X2))|~member(X1,second(X2)))).
% 0.12/0.37 cnf(i_0_164, plain, (little_set(f7(X1,X2))|~member(X1,second(X2)))).
% 0.12/0.37 cnf(i_0_188, plain, (little_set(f9(X1,X2))|~member(X1,rotate_right(X2)))).
% 0.12/0.37 cnf(i_0_189, plain, (little_set(f10(X1,X2))|~member(X1,rotate_right(X2)))).
% 0.12/0.37 cnf(i_0_190, plain, (little_set(f11(X1,X2))|~member(X1,rotate_right(X2)))).
% 0.12/0.37 cnf(i_0_194, plain, (little_set(f12(X1,X2))|~member(X1,flip_range_of(X2)))).
% 0.12/0.37 cnf(i_0_195, plain, (little_set(f13(X1,X2))|~member(X1,flip_range_of(X2)))).
% 0.12/0.37 cnf(i_0_196, plain, (little_set(f14(X1,X2))|~member(X1,flip_range_of(X2)))).
% 0.12/0.37 cnf(i_0_177, plain, (ordered_pair_predicate(f8(X1,X2))|~member(X1,domain_of(X2)))).
% 0.12/0.37 cnf(i_0_246, plain, (ordered_pair_predicate(f27(X1,X2))|~member(X1,range_of(X2)))).
% 0.12/0.37 cnf(i_0_179, plain, (first(f8(X1,X2))=X1|~member(X1,domain_of(X2)))).
% 0.12/0.37 cnf(i_0_248, plain, (second(f27(X1,X2))=X1|~member(X1,range_of(X2)))).
% 0.12/0.37 cnf(i_0_208, plain, (member(X1,sigma(X2))|~member(X3,X2)|~member(X1,X3))).
% 0.12/0.37 cnf(i_0_180, plain, (member(X1,domain_of(X2))|X1!=first(X3)|~little_set(X1)|~ordered_pair_predicate(X3)|~member(X3,X2))).
% 0.12/0.37 cnf(i_0_249, plain, (member(X1,range_of(X2))|X1!=second(X3)|~little_set(X1)|~ordered_pair_predicate(X3)|~member(X3,X2))).
% 0.12/0.37 cnf(i_0_181, plain, (ordered_pair_predicate(X1)|~member(X1,cross_product(X2,X3)))).
% 0.12/0.37 cnf(i_0_148, plain, (X1=X3|X1=X2|~member(X1,non_ordered_pair(X2,X3)))).
% 0.12/0.37 cnf(i_0_238, plain, (~member(X3,X2)|~member(X3,X1)|~disjoint(X1,X2))).
% 0.12/0.37 cnf(i_0_170, plain, (member(X1,estin)|~little_set(X1)|~ordered_pair_predicate(X1)|~member(first(X1),second(X1)))).
% 0.12/0.37 cnf(i_0_161, plain, (member(X1,f4(X1,X2))|~member(X1,first(X2)))).
% 0.12/0.37 cnf(i_0_166, plain, (member(X1,f7(X1,X2))|~member(X1,second(X2)))).
% 0.12/0.37 cnf(i_0_207, plain, (member(X1,f16(X1,X2))|~member(X1,sigma(X2)))).
% 0.12/0.37 cnf(i_0_178, plain, (member(f8(X1,X2),X2)|~member(X1,domain_of(X2)))).
% 0.12/0.37 cnf(i_0_206, plain, (member(f16(X1,X2),X2)|~member(X1,sigma(X2)))).
% 0.12/0.37 cnf(i_0_247, plain, (member(f27(X1,X2),X2)|~member(X1,range_of(X2)))).
% 0.12/0.37 cnf(i_0_172, plain, (member(X1,X3)|~member(X1,intersection(X2,X3)))).
% 0.12/0.37 cnf(i_0_171, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 0.12/0.37 cnf(i_0_212, plain, (subset(X1,X2)|~member(f17(X1,X2),X2))).
% 0.12/0.37 cnf(i_0_146, plain, (X1=X2|member(f1(X1,X2),X2)|member(f1(X1,X2),X1))).
% 0.12/0.37 cnf(i_0_182, plain, (member(first(X1),X2)|~member(X1,cross_product(X2,X3)))).
% 0.12/0.37 cnf(i_0_183, plain, (member(second(X1),X3)|~member(X1,cross_product(X2,X3)))).
% 0.12/0.37 cnf(i_0_173, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 0.12/0.37 cnf(i_0_263, plain, (function(X1)|~maps(X1,X2,X3))).
% 0.12/0.37 cnf(i_0_264, plain, (domain_of(X1)=X2|~maps(X1,X2,X3))).
% 0.12/0.37 cnf(i_0_266, plain, (maps(X1,X2,X3)|domain_of(X1)!=X2|~function(X1)|~subset(range_of(X1),X3))).
% 0.12/0.37 cnf(i_0_269, plain, (maps(X2,cross_product(X1,X1),X1)|~closed(X1,X2))).
% 0.12/0.37 cnf(i_0_265, plain, (subset(range_of(X1),X3)|~maps(X1,X2,X3))).
% 0.12/0.37 cnf(i_0_261, plain, (member(X1,apply(X2,X3))|first(X4)!=X3|~ordered_pair_predicate(X4)|~member(X4,X2)|~member(X1,second(X4)))).
% 0.12/0.37 cnf(i_0_236, plain, (member(X1,image(X2,X3))|second(X4)!=X1|~little_set(X1)|~ordered_pair_predicate(X4)|~member(X4,X3)|~member(first(X4),X2))).
% 0.12/0.37 cnf(i_0_184, plain, (member(X1,cross_product(X2,X3))|~little_set(X1)|~ordered_pair_predicate(X1)|~member(first(X1),X2)|~member(second(X1),X3))).
% 0.12/0.37 cnf(i_0_156, plain, (non_ordered_pair(non_ordered_pair(f2(X1),f2(X1)),non_ordered_pair(f2(X1),f3(X1)))=X1|~ordered_pair_predicate(X1))).
% 0.12/0.37 cnf(i_0_157, plain, (ordered_pair_predicate(X1)|X1!=non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3))|~little_set(X3)|~little_set(X2))).
% 0.12/0.37 cnf(i_0_147, plain, (X1=X2|~member(f1(X1,X2),X2)|~member(f1(X1,X2),X1))).
% 0.12/0.37 cnf(i_0_270, plain, (closed(X1,X2)|~little_set(X2)|~little_set(X1)|~maps(X2,cross_product(X1,X1),X1))).
% 0.12/0.37 cnf(i_0_162, plain, (member(X1,first(X2))|X2!=non_ordered_pair(non_ordered_pair(X3,X3),non_ordered_pair(X3,X4))|~little_set(X4)|~little_set(X3)|~member(X1,X3))).
% 0.12/0.37 cnf(i_0_167, plain, (member(X1,second(X2))|X2!=non_ordered_pair(non_ordered_pair(X3,X3),non_ordered_pair(X3,X4))|~little_set(X4)|~little_set(X3)|~member(X1,X4))).
% 0.12/0.37 cnf(i_0_271, plain, (little_set(f29(X1,X2,X3))|~member(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_272, plain, (little_set(f30(X1,X2,X3))|~member(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_273, plain, (little_set(f31(X1,X2,X3))|~member(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_232, plain, (ordered_pair_predicate(f22(X1,X2,X3))|~member(X1,image(X2,X3)))).
% 0.12/0.37 cnf(i_0_257, plain, (ordered_pair_predicate(f28(X1,X2,X3))|~member(X1,apply(X2,X3)))).
% 0.12/0.37 cnf(i_0_259, plain, (first(f28(X1,X2,X3))=X3|~member(X1,apply(X2,X3)))).
% 0.12/0.37 cnf(i_0_235, plain, (second(f22(X1,X2,X3))=X1|~member(X1,image(X2,X3)))).
% 0.12/0.37 cnf(i_0_245, plain, (X1=empty_set|member(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,f26(X1))),f25)|~little_set(X1))).
% 0.12/0.37 cnf(i_0_233, plain, (member(f22(X1,X2,X3),X3)|~member(X1,image(X2,X3)))).
% 0.12/0.37 cnf(i_0_258, plain, (member(f28(X1,X2,X3),X2)|~member(X1,apply(X2,X3)))).
% 0.12/0.37 cnf(i_0_226, plain, (single_valued_set(X1)|member(non_ordered_pair(non_ordered_pair(f19(X1),f19(X1)),non_ordered_pair(f19(X1),f20(X1))),X1))).
% 0.12/0.37 cnf(i_0_227, plain, (single_valued_set(X1)|member(non_ordered_pair(non_ordered_pair(f19(X1),f19(X1)),non_ordered_pair(f19(X1),f21(X1))),X1))).
% 0.12/0.37 cnf(i_0_186, plain, (member(non_ordered_pair(non_ordered_pair(second(X1),second(X1)),non_ordered_pair(second(X1),first(X1))),X2)|~member(X1,converse(X2)))).
% 0.12/0.37 cnf(i_0_260, plain, (member(X1,second(f28(X1,X2,X3)))|~member(X1,apply(X2,X3)))).
% 0.12/0.37 cnf(i_0_234, plain, (member(first(f22(X1,X2,X3)),X2)|~member(X1,image(X2,X3)))).
% 0.12/0.37 cnf(i_0_160, plain, (non_ordered_pair(non_ordered_pair(f4(X1,X2),f4(X1,X2)),non_ordered_pair(f4(X1,X2),f5(X1,X2)))=X2|~member(X1,first(X2)))).
% 0.12/0.37 cnf(i_0_165, plain, (non_ordered_pair(non_ordered_pair(f6(X1,X2),f6(X1,X2)),non_ordered_pair(f6(X1,X2),f7(X1,X2)))=X2|~member(X1,second(X2)))).
% 0.12/0.37 cnf(i_0_205, plain, (member(complement(intersection(complement(X1),complement(non_ordered_pair(X1,X1)))),infinity)|~member(X1,infinity))).
% 0.12/0.37 cnf(i_0_187, plain, (member(X1,converse(X2))|~little_set(X1)|~ordered_pair_predicate(X1)|~member(non_ordered_pair(non_ordered_pair(second(X1),second(X1)),non_ordered_pair(second(X1),first(X1))),X2))).
% 0.12/0.37 cnf(i_0_222, plain, (X3=X4|~little_set(X4)|~little_set(X3)|~little_set(X2)|~single_valued_set(X1)|~member(non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X4)),X1)|~member(non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3)),X1))).
% 0.12/0.37 cnf(i_0_277, plain, (member(X1,compose(X2,X3))|X1!=non_ordered_pair(non_ordered_pair(X4,X4),non_ordered_pair(X4,X5))|~little_set(X6)|~little_set(X5)|~little_set(X4)|~little_set(X1)|~member(non_ordered_pair(non_ordered_pair(X6,X6),non_ordered_pair(X6,X5)),X3)|~member(non_ordered_pair(non_ordered_pair(X4,X4),non_ordered_pair(X4,X6)),X2))).
% 0.12/0.37 cnf(i_0_274, plain, (non_ordered_pair(non_ordered_pair(f29(X1,X2,X3),f29(X1,X2,X3)),non_ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3)))=X1|~member(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_191, plain, (non_ordered_pair(non_ordered_pair(f9(X1,X2),f9(X1,X2)),non_ordered_pair(f9(X1,X2),non_ordered_pair(non_ordered_pair(f10(X1,X2),f10(X1,X2)),non_ordered_pair(f10(X1,X2),f11(X1,X2)))))=X1|~member(X1,rotate_right(X2)))).
% 0.12/0.37 cnf(i_0_197, plain, (non_ordered_pair(non_ordered_pair(f12(X1,X2),f12(X1,X2)),non_ordered_pair(f12(X1,X2),non_ordered_pair(non_ordered_pair(f13(X1,X2),f13(X1,X2)),non_ordered_pair(f13(X1,X2),f14(X1,X2)))))=X1|~member(X1,flip_range_of(X2)))).
% 0.12/0.37 cnf(i_0_193, plain, (member(X1,rotate_right(X2))|X1!=non_ordered_pair(non_ordered_pair(X3,X3),non_ordered_pair(X3,non_ordered_pair(non_ordered_pair(X4,X4),non_ordered_pair(X4,X5))))|~little_set(X5)|~little_set(X4)|~little_set(X3)|~little_set(X1)|~member(non_ordered_pair(non_ordered_pair(X4,X4),non_ordered_pair(X4,non_ordered_pair(non_ordered_pair(X5,X5),non_ordered_pair(X5,X3)))),X2))).
% 0.12/0.37 cnf(i_0_199, plain, (member(X1,flip_range_of(X2))|X1!=non_ordered_pair(non_ordered_pair(X3,X3),non_ordered_pair(X3,non_ordered_pair(non_ordered_pair(X4,X4),non_ordered_pair(X4,X5))))|~little_set(X5)|~little_set(X4)|~little_set(X3)|~little_set(X1)|~member(non_ordered_pair(non_ordered_pair(X3,X3),non_ordered_pair(X3,non_ordered_pair(non_ordered_pair(X5,X5),non_ordered_pair(X5,X4)))),X2))).
% 0.12/0.37 cnf(i_0_279, plain, (closed(X4,X5)|~homomorphism(X1,X2,X3,X4,X5))).
% 0.12/0.37 cnf(i_0_278, plain, (closed(X2,X3)|~homomorphism(X1,X2,X3,X4,X5))).
% 0.12/0.37 cnf(i_0_275, plain, (member(non_ordered_pair(non_ordered_pair(f29(X1,X2,X3),f29(X1,X2,X3)),non_ordered_pair(f29(X1,X2,X3),f31(X1,X2,X3))),X2)|~member(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_276, plain, (member(non_ordered_pair(non_ordered_pair(f31(X1,X2,X3),f31(X1,X2,X3)),non_ordered_pair(f31(X1,X2,X3),f30(X1,X2,X3))),X3)|~member(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_280, plain, (maps(X1,X2,X4)|~homomorphism(X1,X2,X3,X4,X5))).
% 0.12/0.37 cnf(i_0_192, plain, (member(non_ordered_pair(non_ordered_pair(f10(X1,X2),f10(X1,X2)),non_ordered_pair(f10(X1,X2),non_ordered_pair(non_ordered_pair(f11(X1,X2),f11(X1,X2)),non_ordered_pair(f11(X1,X2),f9(X1,X2))))),X2)|~member(X1,rotate_right(X2)))).
% 0.12/0.37 cnf(i_0_198, plain, (member(non_ordered_pair(non_ordered_pair(f12(X1,X2),f12(X1,X2)),non_ordered_pair(f12(X1,X2),non_ordered_pair(non_ordered_pair(f14(X1,X2),f14(X1,X2)),non_ordered_pair(f14(X1,X2),f13(X1,X2))))),X2)|~member(X1,flip_range_of(X2)))).
% 0.12/0.37 cnf(i_0_281, plain, (apply(X1,apply(X3,non_ordered_pair(non_ordered_pair(X6,X6),non_ordered_pair(X6,X7))))=apply(X5,non_ordered_pair(non_ordered_pair(apply(X1,X6),apply(X1,X6)),non_ordered_pair(apply(X1,X6),apply(X1,X7))))|~member(X7,X2)|~member(X6,X2)|~homomorphism(X1,X2,X3,X4,X5))).
% 0.12/0.37 cnf(i_0_282, plain, (homomorphism(X1,X2,X3,X4,X5)|member(f32(X1,X2,X3,X4,X5),X2)|~closed(X4,X5)|~closed(X2,X3)|~maps(X1,X2,X4))).
% 0.12/0.37 cnf(i_0_283, plain, (homomorphism(X1,X2,X3,X4,X5)|member(f33(X1,X2,X3,X4,X5),X2)|~closed(X4,X5)|~closed(X2,X3)|~maps(X1,X2,X4))).
% 0.12/0.37 cnf(i_0_284, plain, (homomorphism(X1,X2,X3,X4,X5)|apply(X1,apply(X3,non_ordered_pair(non_ordered_pair(f32(X1,X2,X3,X4,X5),f32(X1,X2,X3,X4,X5)),non_ordered_pair(f32(X1,X2,X3,X4,X5),f33(X1,X2,X3,X4,X5)))))!=apply(X5,non_ordered_pair(non_ordered_pair(apply(X1,f32(X1,X2,X3,X4,X5)),apply(X1,f32(X1,X2,X3,X4,X5))),non_ordered_pair(apply(X1,f32(X1,X2,X3,X4,X5)),apply(X1,f33(X1,X2,X3,X4,X5)))))|~closed(X4,X5)|~closed(X2,X3)|~maps(X1,X2,X4))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 4 steps
% 0.12/0.37 cnf(i_0_286, negated_conjecture, (~little_set(a)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_287, plain, (~little_set(a)), inference(extension_rule, [i_0_267])).
% 0.12/0.37 cnf(i_0_336, plain, (~closed(a,X10)), inference(extension_rule, [i_0_279])).
% 0.12/0.37 cnf(i_0_944, plain, (~homomorphism(X6,X7,X8,a,X10)), inference(etableau_closure_rule, [i_0_944, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 3 tableaux to operate on
% 0.12/0.37 # Found closed tableau during pool population.
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------