TSTP Solution File: SET684+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET684+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 : 300s
% DateTime : Wed Jul 27 13:14:04 EDT 2022
% Result : Timeout 299.89s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET684+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 10:56:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.18/2.37 ----- Otter 3.3f, August 2004 -----
% 2.18/2.37 The process was started by sandbox on n020.cluster.edu,
% 2.18/2.37 Wed Jul 27 10:56:53 2022
% 2.18/2.37 The command was "./otter". The process ID is 5544.
% 2.18/2.37
% 2.18/2.37 set(prolog_style_variables).
% 2.18/2.37 set(auto).
% 2.18/2.37 dependent: set(auto1).
% 2.18/2.37 dependent: set(process_input).
% 2.18/2.37 dependent: clear(print_kept).
% 2.18/2.37 dependent: clear(print_new_demod).
% 2.18/2.37 dependent: clear(print_back_demod).
% 2.18/2.37 dependent: clear(print_back_sub).
% 2.18/2.37 dependent: set(control_memory).
% 2.18/2.37 dependent: assign(max_mem, 12000).
% 2.18/2.37 dependent: assign(pick_given_ratio, 4).
% 2.18/2.37 dependent: assign(stats_level, 1).
% 2.18/2.37 dependent: assign(max_seconds, 10800).
% 2.18/2.37 clear(print_given).
% 2.18/2.37
% 2.18/2.37 formula_list(usable).
% 2.18/2.37 all A (A=A).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,binary_relation_type)-> (all E (ilf_type(E,binary_relation_type)-> (member(ordered_pair(B,C),compose(D,E))<-> (exists F (ilf_type(F,set_type)&member(ordered_pair(B,F),D)&member(ordered_pair(F,C),E))))))))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (all E (ilf_type(E,set_type)-> (all F (ilf_type(F,relation_type(B,C))-> (member(ordered_pair(D,E),F)->member(D,B)&member(E,C))))))))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (all E (ilf_type(E,set_type)-> (all F (ilf_type(F,set_type)-> (F=ordered_pair(D,E)<->F=unordered_pair(unordered_pair(D,E),singleton(D)))))))))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(ordered_pair(B,C),set_type)))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,subset_type(cross_product(B,C)))->ilf_type(D,relation_type(B,C))))& (all E (ilf_type(E,relation_type(B,C))->ilf_type(E,subset_type(cross_product(B,C)))))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (exists D ilf_type(D,relation_type(C,B)))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (-empty(C)&ilf_type(C,set_type)-> (ilf_type(B,member_type(C))<->member(B,C))))).
% 2.18/2.37 all B (-empty(B)&ilf_type(B,set_type)-> (exists C ilf_type(C,member_type(B)))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (empty(B)<-> (all C (ilf_type(C,set_type)-> -member(C,B))))).
% 2.18/2.37 all B (ilf_type(B,set_type)->ilf_type(singleton(B),set_type)).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),set_type)))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(unordered_pair(B,C),set_type)))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->unordered_pair(B,C)=unordered_pair(C,B)))).
% 2.18/2.37 all B (ilf_type(B,binary_relation_type)-> (all C (ilf_type(C,binary_relation_type)->ilf_type(compose(B,C),binary_relation_type)))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (ilf_type(B,binary_relation_type)<->relation_like(B)&ilf_type(B,set_type))).
% 2.18/2.37 exists B ilf_type(B,binary_relation_type).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (ilf_type(C,subset_type(B))<->ilf_type(C,member_type(power_set(B))))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (exists C ilf_type(C,subset_type(B)))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (B=C<-> (all D (ilf_type(D,set_type)-> (member(D,B)<->member(D,C)))))))).
% 2.18/2.37 all B (ilf_type(B,binary_relation_type)-> (all C (ilf_type(C,binary_relation_type)-> (B=C->C=B)))).
% 2.18/2.37 all B (ilf_type(B,binary_relation_type)->B=B).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (member(B,power_set(C))<-> (all D (ilf_type(D,set_type)-> (member(D,B)->member(D,C)))))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> -empty(power_set(B))&ilf_type(power_set(B),set_type)).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (relation_like(B)<-> (all C (ilf_type(C,set_type)-> (member(C,B)-> (exists D (ilf_type(D,set_type)& (exists E (ilf_type(E,set_type)&C=ordered_pair(D,E)))))))))).
% 2.18/2.37 all B (empty(B)&ilf_type(B,set_type)->relation_like(B)).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,subset_type(cross_product(B,C)))->relation_like(D)))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (all E (ilf_type(E,relation_type(B,C))-> (all F (ilf_type(F,relation_type(C,D))->compose5(B,C,D,E,F)=compose(E,F)))))))))).
% 2.18/2.37 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (all E (ilf_type(E,relation_type(B,C))-> (all F (ilf_type(F,relation_type(C,D))->ilf_type(compose5(B,C,D,E,F),relation_type(B,D))))))))))).
% 2.18/2.37 all B ilf_type(B,set_type).
% 2.18/2.37 -(all B (-empty(B)&ilf_type(B,set_type)-> (all C (-empty(C)&ilf_type(C,set_type)-> (all D (-empty(D)&ilf_type(D,set_type)-> (all E (ilf_type(E,relation_type(B,C))-> (all F (ilf_type(F,relation_type(C,D))-> (all G (ilf_type(G,member_type(B))-> (all H (ilf_type(H,member_type(D))-> (member(ordered_pair(G,H),compose5(B,C,D,E,F))<-> (exists I (ilf_type(I,member_type(C))&member(ordered_pair(G,I),E)&member(ordered_pair(I,H),F)))))))))))))))))).
% 2.18/2.37 end_of_list.
% 2.18/2.37
% 2.18/2.37 -------> usable clausifies to:
% 2.18/2.37
% 2.18/2.37 list(usable).
% 2.18/2.37 0 [] A=A.
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)| -ilf_type(E,binary_relation_type)| -member(ordered_pair(B,C),compose(D,E))|ilf_type($f1(B,C,D,E),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)| -ilf_type(E,binary_relation_type)| -member(ordered_pair(B,C),compose(D,E))|member(ordered_pair(B,$f1(B,C,D,E)),D).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)| -ilf_type(E,binary_relation_type)| -member(ordered_pair(B,C),compose(D,E))|member(ordered_pair($f1(B,C,D,E),C),E).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)| -ilf_type(E,binary_relation_type)|member(ordered_pair(B,C),compose(D,E))| -ilf_type(F,set_type)| -member(ordered_pair(B,F),D)| -member(ordered_pair(F,C),E).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,set_type)| -ilf_type(F,relation_type(B,C))| -member(ordered_pair(D,E),F)|member(D,B).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,set_type)| -ilf_type(F,relation_type(B,C))| -member(ordered_pair(D,E),F)|member(E,C).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,set_type)| -ilf_type(F,set_type)|F!=ordered_pair(D,E)|F=unordered_pair(unordered_pair(D,E),singleton(D)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,set_type)| -ilf_type(F,set_type)|F=ordered_pair(D,E)|F!=unordered_pair(unordered_pair(D,E),singleton(D)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(ordered_pair(B,C),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|ilf_type(D,relation_type(B,C)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(E,relation_type(B,C))|ilf_type(E,subset_type(cross_product(B,C))).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type($f2(B,C),relation_type(C,B)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)| -ilf_type(B,member_type(C))|member(B,C).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)|ilf_type(B,member_type(C))| -member(B,C).
% 2.18/2.37 0 [] empty(B)| -ilf_type(B,set_type)|ilf_type($f3(B),member_type(B)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -empty(B)| -ilf_type(C,set_type)| -member(C,B).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|empty(B)|ilf_type($f4(B),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|empty(B)|member($f4(B),B).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|ilf_type(singleton(B),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(unordered_pair(B,C),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|unordered_pair(B,C)=unordered_pair(C,B).
% 2.18/2.37 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,binary_relation_type)|ilf_type(compose(B,C),binary_relation_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(B,binary_relation_type)|relation_like(B).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|ilf_type(B,binary_relation_type)| -relation_like(B).
% 2.18/2.37 0 [] ilf_type($c1,binary_relation_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(C,subset_type(B))|ilf_type(C,member_type(power_set(B))).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(C,subset_type(B))| -ilf_type(C,member_type(power_set(B))).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|ilf_type($f5(B),subset_type(B)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B!=C| -ilf_type(D,set_type)| -member(D,B)|member(D,C).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B!=C| -ilf_type(D,set_type)|member(D,B)| -member(D,C).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B=C|ilf_type($f6(B,C),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B=C|member($f6(B,C),B)|member($f6(B,C),C).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B=C| -member($f6(B,C),B)| -member($f6(B,C),C).
% 2.18/2.37 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,binary_relation_type)|B!=C|C=B.
% 2.18/2.37 0 [] -ilf_type(B,binary_relation_type)|B=B.
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(B,power_set(C))| -ilf_type(D,set_type)| -member(D,B)|member(D,C).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|ilf_type($f7(B,C),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|member($f7(B,C),B).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))| -member($f7(B,C),C).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -empty(power_set(B)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|ilf_type(power_set(B),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f9(B,C),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f8(B,C),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|C=ordered_pair($f9(B,C),$f8(B,C)).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|relation_like(B)|ilf_type($f10(B),set_type).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|relation_like(B)|member($f10(B),B).
% 2.18/2.37 0 [] -ilf_type(B,set_type)|relation_like(B)| -ilf_type(D,set_type)| -ilf_type(E,set_type)|$f10(B)!=ordered_pair(D,E).
% 2.18/2.37 0 [] -empty(B)| -ilf_type(B,set_type)|relation_like(B).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|relation_like(D).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,relation_type(B,C))| -ilf_type(F,relation_type(C,D))|compose5(B,C,D,E,F)=compose(E,F).
% 2.18/2.37 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,relation_type(B,C))| -ilf_type(F,relation_type(C,D))|ilf_type(compose5(B,C,D,E,F),relation_type(B,D)).
% 2.18/2.37 0 [] ilf_type(B,set_type).
% 2.18/2.37 0 [] -empty($c9).
% 2.18/2.37 0 [] ilf_type($c9,set_type).
% 2.18/2.37 0 [] -empty($c8).
% 2.18/2.37 0 [] ilf_type($c8,set_type).
% 2.18/2.37 0 [] -empty($c7).
% 2.18/2.37 0 [] ilf_type($c7,set_type).
% 2.18/2.37 0 [] ilf_type($c6,relation_type($c9,$c8)).
% 2.18/2.37 0 [] ilf_type($c5,relation_type($c8,$c7)).
% 2.18/2.37 0 [] ilf_type($c4,member_type($c9)).
% 2.18/2.37 0 [] ilf_type($c3,member_type($c7)).
% 2.18/2.37 0 [] member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))|ilf_type($c2,member_type($c8)).
% 2.18/2.37 0 [] member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))|member(ordered_pair($c4,$c2),$c6).
% 2.18/2.37 0 [] member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))|member(ordered_pair($c2,$c3),$c5).
% 2.18/2.37 0 [] -member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))| -ilf_type(I,member_type($c8))| -member(ordered_pair($c4,I),$c6)| -member(ordered_pair(I,$c3),$c5).
% 2.18/2.37 end_of_list.
% 2.18/2.37
% 2.18/2.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 2.18/2.37
% 2.18/2.37 This ia a non-Horn set with equality. The strategy will be
% 2.18/2.37 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.18/2.37 deletion, with positive clauses in sos and nonpositive
% 2.18/2.37 clauses in usable.
% 2.18/2.37
% 2.18/2.37 dependent: set(knuth_bendix).
% 2.18/2.37 dependent: set(anl_eq).
% 2.18/2.37 dependent: set(para_from).
% 2.18/2.37 dependent: set(para_into).
% 2.18/2.37 dependent: clear(para_from_right).
% 2.18/2.37 dependent: clear(para_into_right).
% 2.18/2.37 dependent: set(para_from_vars).
% 2.18/2.37 dependent: set(eq_units_both_ways).
% 2.18/2.37 dependent: set(dynamic_demod_all).
% 2.18/2.37 dependent: set(dynamic_demod).
% 2.18/2.37 dependent: set(order_eq).
% 2.18/2.37 dependent: set(back_demod).
% 2.18/2.37 dependent: set(lrpo).
% 2.18/2.37 dependent: set(hyper_res).
% 2.18/2.37 dependent: set(unit_deletion).
% 2.18/2.37 dependent: set(factor).
% 2.18/2.37
% 2.18/2.37 ------------> process usable:
% 2.18/2.37 ** KEPT (pick-wt=26): 1 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -ilf_type(D,binary_relation_type)| -member(ordered_pair(A,B),compose(C,D))|ilf_type($f1(A,B,C,D),set_type).
% 2.27/2.41 ** KEPT (pick-wt=28): 2 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -ilf_type(D,binary_relation_type)| -member(ordered_pair(A,B),compose(C,D))|member(ordered_pair(A,$f1(A,B,C,D)),C).
% 2.27/2.41 ** KEPT (pick-wt=28): 3 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -ilf_type(D,binary_relation_type)| -member(ordered_pair(A,B),compose(C,D))|member(ordered_pair($f1(A,B,C,D),B),D).
% 2.27/2.41 ** KEPT (pick-wt=32): 4 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -ilf_type(D,binary_relation_type)|member(ordered_pair(A,B),compose(C,D))| -ilf_type(E,set_type)| -member(ordered_pair(A,E),C)| -member(ordered_pair(E,B),D).
% 2.27/2.41 ** KEPT (pick-wt=25): 5 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,relation_type(A,B))| -member(ordered_pair(C,D),E)|member(C,A).
% 2.27/2.41 ** KEPT (pick-wt=25): 6 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -ilf_type(E,relation_type(A,B))| -member(ordered_pair(C,D),E)|member(D,B).
% 2.27/2.41 ** KEPT (pick-wt=22): 8 [copy,7,factor_simp,factor_simp] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|C!=ordered_pair(A,B)|C=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.27/2.41 ** KEPT (pick-wt=22): 10 [copy,9,factor_simp,factor_simp] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|C=ordered_pair(A,B)|C!=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.27/2.41 ** KEPT (pick-wt=11): 11 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(ordered_pair(A,B),set_type).
% 2.27/2.41 ** KEPT (pick-wt=17): 12 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|ilf_type(C,relation_type(A,B)).
% 2.27/2.41 ** KEPT (pick-wt=17): 13 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))|ilf_type(C,subset_type(cross_product(A,B))).
% 2.27/2.41 ** KEPT (pick-wt=13): 14 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type($f2(A,B),relation_type(B,A)).
% 2.27/2.41 ** KEPT (pick-wt=15): 15 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)| -ilf_type(A,member_type(B))|member(A,B).
% 2.27/2.41 ** KEPT (pick-wt=15): 16 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)|ilf_type(A,member_type(B))| -member(A,B).
% 2.27/2.41 ** KEPT (pick-wt=10): 17 [] empty(A)| -ilf_type(A,set_type)|ilf_type($f3(A),member_type(A)).
% 2.27/2.41 ** KEPT (pick-wt=11): 18 [] -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 2.27/2.41 ** KEPT (pick-wt=9): 19 [] -ilf_type(A,set_type)|empty(A)|ilf_type($f4(A),set_type).
% 2.27/2.41 ** KEPT (pick-wt=9): 20 [] -ilf_type(A,set_type)|empty(A)|member($f4(A),A).
% 2.27/2.41 ** KEPT (pick-wt=7): 21 [] -ilf_type(A,set_type)|ilf_type(singleton(A),set_type).
% 2.27/2.41 ** KEPT (pick-wt=11): 22 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),set_type).
% 2.27/2.41 ** KEPT (pick-wt=11): 23 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(unordered_pair(A,B),set_type).
% 2.27/2.41 ** KEPT (pick-wt=13): 24 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|unordered_pair(A,B)=unordered_pair(B,A).
% 2.27/2.41 ** KEPT (pick-wt=11): 25 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,binary_relation_type)|ilf_type(compose(A,B),binary_relation_type).
% 2.27/2.41 ** KEPT (pick-wt=8): 26 [] -ilf_type(A,set_type)| -ilf_type(A,binary_relation_type)|relation_like(A).
% 2.27/2.41 ** KEPT (pick-wt=8): 27 [] -ilf_type(A,set_type)|ilf_type(A,binary_relation_type)| -relation_like(A).
% 2.27/2.41 ** KEPT (pick-wt=15): 28 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(B,subset_type(A))|ilf_type(B,member_type(power_set(A))).
% 2.27/2.41 ** KEPT (pick-wt=15): 29 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(B,subset_type(A))| -ilf_type(B,member_type(power_set(A))).
% 2.27/2.41 ** KEPT (pick-wt=8): 30 [] -ilf_type(A,set_type)|ilf_type($f5(A),subset_type(A)).
% 2.27/2.41 ** KEPT (pick-wt=18): 31 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|A!=B| -ilf_type(C,set_type)| -member(C,A)|member(C,B).
% 2.27/2.41 ** KEPT (pick-wt=18): 32 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|A!=B| -ilf_type(C,set_type)|member(C,A)| -member(C,B).
% 2.27/2.41 ** KEPT (pick-wt=14): 33 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|A=B|ilf_type($f6(A,B),set_type).
% 2.27/2.41 ** KEPT (pick-wt=19): 34 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|A=B|member($f6(A,B),A)|member($f6(A,B),B).
% 2.27/2.41 ** KEPT (pick-wt=19): 35 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|A=B| -member($f6(A,B),A)| -member($f6(A,B),B).
% 2.27/2.41 ** KEPT (pick-wt=12): 36 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,binary_relation_type)|A!=B|B=A.
% 2.27/2.41 ** KEPT (pick-wt=6): 37 [] -ilf_type(A,binary_relation_type)|A=A.
% 2.27/2.41 ** KEPT (pick-wt=19): 38 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -member(A,power_set(B))| -ilf_type(C,set_type)| -member(C,A)|member(C,B).
% 2.27/2.41 ** KEPT (pick-wt=15): 39 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|ilf_type($f7(A,B),set_type).
% 2.27/2.41 ** KEPT (pick-wt=15): 40 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f7(A,B),A).
% 2.27/2.41 ** KEPT (pick-wt=15): 41 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))| -member($f7(A,B),B).
% 2.27/2.41 ** KEPT (pick-wt=6): 42 [] -ilf_type(A,set_type)| -empty(power_set(A)).
% 2.27/2.41 ** KEPT (pick-wt=7): 43 [] -ilf_type(A,set_type)|ilf_type(power_set(A),set_type).
% 2.27/2.41 ** KEPT (pick-wt=16): 44 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f9(A,B),set_type).
% 2.27/2.41 ** KEPT (pick-wt=16): 45 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f8(A,B),set_type).
% 2.27/2.41 ** KEPT (pick-wt=20): 47 [copy,46,flip.5] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ordered_pair($f9(A,B),$f8(A,B))=B.
% 2.27/2.41 ** KEPT (pick-wt=9): 48 [] -ilf_type(A,set_type)|relation_like(A)|ilf_type($f10(A),set_type).
% 2.27/2.41 ** KEPT (pick-wt=9): 49 [] -ilf_type(A,set_type)|relation_like(A)|member($f10(A),A).
% 2.27/2.41 ** KEPT (pick-wt=17): 50 [] -ilf_type(A,set_type)|relation_like(A)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|$f10(A)!=ordered_pair(B,C).
% 2.27/2.41 ** KEPT (pick-wt=7): 51 [] -empty(A)| -ilf_type(A,set_type)|relation_like(A).
% 2.27/2.41 ** KEPT (pick-wt=14): 52 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|relation_like(C).
% 2.27/2.41 ** KEPT (pick-wt=29): 53 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(A,B))| -ilf_type(E,relation_type(B,C))|compose5(A,B,C,D,E)=compose(D,E).
% 2.27/2.41 ** KEPT (pick-wt=29): 54 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(A,B))| -ilf_type(E,relation_type(B,C))|ilf_type(compose5(A,B,C,D,E),relation_type(A,C)).
% 2.27/2.41 ** KEPT (pick-wt=2): 55 [] -empty($c9).
% 2.27/2.41 ** KEPT (pick-wt=2): 56 [] -empty($c8).
% 2.27/2.41 ** KEPT (pick-wt=2): 57 [] -empty($c7).
% 2.27/2.41 ** KEPT (pick-wt=24): 58 [] -member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))| -ilf_type(A,member_type($c8))| -member(ordered_pair($c4,A),$c6)| -member(ordered_pair(A,$c3),$c5).
% 2.27/2.41
% 2.27/2.41 ------------> process sos:
% 2.27/2.41 ** KEPT (pick-wt=3): 155 [] A=A.
% 2.27/2.41 ** KEPT (pick-wt=3): 156 [] ilf_type($c1,binary_relation_type).
% 2.27/2.41 ** KEPT (pick-wt=3): 157 [] ilf_type(A,set_type).
% 2.27/2.41 Following clause subsumed by 157 during input processing: 0 [] ilf_type($c9,set_type).
% 2.27/2.41 Following clause subsumed by 157 during input processing: 0 [] ilf_type($c8,set_type).
% 2.27/2.41 Following clause subsumed by 157 during input processing: 0 [] ilf_type($c7,set_type).
% 2.27/2.41 ** KEPT (pick-wt=5): 158 [] ilf_type($c6,relation_type($c9,$c8)).
% 2.27/2.41 ** KEPT (pick-wt=5): 159 [] ilf_type($c5,relation_type($c8,$c7)).
% 2.27/2.41 ** KEPT (pick-wt=4): 160 [] ilf_type($c4,member_type($c9)).
% 2.27/2.41 ** KEPT (pick-wt=4): 161 [] ilf_type($c3,member_type($c7)).
% 2.27/2.41 ** KEPT (pick-wt=14): 162 [] member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))|ilf_type($c2,member_type($c8)).
% 2.27/2.41 ** KEPT (pick-wt=15): 163 [] member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))|member(ordered_pair($c4,$c2),$c6).
% 2.27/2.41 ** KEPT (pick-wt=15): 164 [] member(ordered_pair($c4,$c3),compose5($c9,$c8,$c7,$c6,$c5))|member(ordered_pair($c2,$c3),$c5).
% 2.27/2.41 Following clause subsumed by 155 during input processing: 0 [copy,155,flip.1] A=A.
% 2.27/2.41 155 back subsumes 107.
% 2.27/2.41 155 back subsumes 106.
% 2.27/2.41 155 back subsAlarm clock
% 299.89/300.02 Otter interrupted
% 299.89/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------