TSTP Solution File: SET685+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET685+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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 : Unknown 64.06s 64.25s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET685+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.12 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 10:41:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.12/2.32 ----- Otter 3.3f, August 2004 -----
% 2.12/2.32 The process was started by sandbox2 on n015.cluster.edu,
% 2.12/2.32 Wed Jul 27 10:41:57 2022
% 2.12/2.32 The command was "./otter". The process ID is 3813.
% 2.12/2.32
% 2.12/2.32 set(prolog_style_variables).
% 2.12/2.32 set(auto).
% 2.12/2.32 dependent: set(auto1).
% 2.12/2.32 dependent: set(process_input).
% 2.12/2.32 dependent: clear(print_kept).
% 2.12/2.32 dependent: clear(print_new_demod).
% 2.12/2.32 dependent: clear(print_back_demod).
% 2.12/2.32 dependent: clear(print_back_sub).
% 2.12/2.32 dependent: set(control_memory).
% 2.12/2.32 dependent: assign(max_mem, 12000).
% 2.12/2.32 dependent: assign(pick_given_ratio, 4).
% 2.12/2.32 dependent: assign(stats_level, 1).
% 2.12/2.32 dependent: assign(max_seconds, 10800).
% 2.12/2.32 clear(print_given).
% 2.12/2.32
% 2.12/2.32 formula_list(usable).
% 2.12/2.32 all A (A=A).
% 2.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,binary_relation_type)-> (member(C,image(D,B))<-> (exists E (ilf_type(E,set_type)&member(ordered_pair(E,C),D)&member(E,B))))))))).
% 2.12/2.32 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.12/2.32 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.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(ordered_pair(B,C),set_type)))).
% 2.12/2.32 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.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (exists D ilf_type(D,relation_type(C,B)))))).
% 2.12/2.32 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.12/2.32 all B (-empty(B)&ilf_type(B,set_type)-> (exists C ilf_type(C,member_type(B)))).
% 2.12/2.32 all B (ilf_type(B,set_type)-> (empty(B)<-> (all C (ilf_type(C,set_type)-> -member(C,B))))).
% 2.12/2.32 all B (ilf_type(B,set_type)->ilf_type(singleton(B),set_type)).
% 2.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),set_type)))).
% 2.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(unordered_pair(B,C),set_type)))).
% 2.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->unordered_pair(B,C)=unordered_pair(C,B)))).
% 2.12/2.32 all B (ilf_type(B,binary_relation_type)-> (all C (ilf_type(C,set_type)->ilf_type(image(B,C),set_type)))).
% 2.12/2.32 all B (ilf_type(B,set_type)-> (ilf_type(B,binary_relation_type)<->relation_like(B)&ilf_type(B,set_type))).
% 2.12/2.32 exists B ilf_type(B,binary_relation_type).
% 2.12/2.32 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.12/2.32 all B (ilf_type(B,set_type)-> (exists C ilf_type(C,subset_type(B)))).
% 2.12/2.32 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.12/2.32 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.12/2.32 all B (ilf_type(B,set_type)-> -empty(power_set(B))&ilf_type(power_set(B),set_type)).
% 2.12/2.32 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.12/2.32 all B (empty(B)&ilf_type(B,set_type)->relation_like(B)).
% 2.12/2.32 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.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,relation_type(B,C))-> (all E (ilf_type(E,set_type)->image4(B,C,D,E)=image(D,E)))))))).
% 2.12/2.32 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,relation_type(B,C))-> (all E (ilf_type(E,set_type)->ilf_type(image4(B,C,D,E),subset_type(C))))))))).
% 2.12/2.32 all B ilf_type(B,set_type).
% 2.12/2.32 -(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(D,B))-> (all F (ilf_type(F,member_type(B))-> (member(F,image4(D,B,E,C))<-> (exists G (ilf_type(G,member_type(D))&member(ordered_pair(G,F),E)&member(G,C)))))))))))))).
% 2.12/2.32 end_of_list.
% 2.12/2.32
% 2.12/2.32 -------> usable clausifies to:
% 2.12/2.32
% 2.12/2.32 list(usable).
% 2.12/2.32 0 [] A=A.
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)| -member(C,image(D,B))|ilf_type($f1(B,C,D),set_type).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)| -member(C,image(D,B))|member(ordered_pair($f1(B,C,D),C),D).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)| -member(C,image(D,B))|member($f1(B,C,D),B).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,binary_relation_type)|member(C,image(D,B))| -ilf_type(E,set_type)| -member(ordered_pair(E,C),D)| -member(E,B).
% 2.12/2.32 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.12/2.32 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.12/2.32 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.12/2.32 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.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(ordered_pair(B,C),set_type).
% 2.12/2.32 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.12/2.32 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.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type($f2(B,C),relation_type(C,B)).
% 2.12/2.32 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)| -ilf_type(B,member_type(C))|member(B,C).
% 2.12/2.32 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)|ilf_type(B,member_type(C))| -member(B,C).
% 2.12/2.32 0 [] empty(B)| -ilf_type(B,set_type)|ilf_type($f3(B),member_type(B)).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -empty(B)| -ilf_type(C,set_type)| -member(C,B).
% 2.12/2.32 0 [] -ilf_type(B,set_type)|empty(B)|ilf_type($f4(B),set_type).
% 2.12/2.32 0 [] -ilf_type(B,set_type)|empty(B)|member($f4(B),B).
% 2.12/2.32 0 [] -ilf_type(B,set_type)|ilf_type(singleton(B),set_type).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),set_type).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(unordered_pair(B,C),set_type).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|unordered_pair(B,C)=unordered_pair(C,B).
% 2.12/2.32 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,set_type)|ilf_type(image(B,C),set_type).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(B,binary_relation_type)|relation_like(B).
% 2.12/2.32 0 [] -ilf_type(B,set_type)|ilf_type(B,binary_relation_type)| -relation_like(B).
% 2.12/2.32 0 [] ilf_type($c1,binary_relation_type).
% 2.12/2.32 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.12/2.32 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.12/2.32 0 [] -ilf_type(B,set_type)|ilf_type($f5(B),subset_type(B)).
% 2.12/2.32 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.12/2.32 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.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B=C|ilf_type($f6(B,C),set_type).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B=C|member($f6(B,C),B)|member($f6(B,C),C).
% 2.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|B=C| -member($f6(B,C),B)| -member($f6(B,C),C).
% 2.12/2.32 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.12/2.32 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|ilf_type($f7(B,C),set_type).
% 2.12/2.33 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|member($f7(B,C),B).
% 2.12/2.33 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))| -member($f7(B,C),C).
% 2.12/2.33 0 [] -ilf_type(B,set_type)| -empty(power_set(B)).
% 2.12/2.33 0 [] -ilf_type(B,set_type)|ilf_type(power_set(B),set_type).
% 2.12/2.33 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.12/2.33 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.12/2.33 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.12/2.33 0 [] -ilf_type(B,set_type)|relation_like(B)|ilf_type($f10(B),set_type).
% 2.12/2.33 0 [] -ilf_type(B,set_type)|relation_like(B)|member($f10(B),B).
% 2.12/2.33 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.12/2.33 0 [] -empty(B)| -ilf_type(B,set_type)|relation_like(B).
% 2.12/2.33 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|relation_like(D).
% 2.12/2.33 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(B,C))| -ilf_type(E,set_type)|image4(B,C,D,E)=image(D,E).
% 2.12/2.33 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(B,C))| -ilf_type(E,set_type)|ilf_type(image4(B,C,D,E),subset_type(C)).
% 2.12/2.33 0 [] ilf_type(B,set_type).
% 2.12/2.33 0 [] -empty($c7).
% 2.12/2.33 0 [] ilf_type($c7,set_type).
% 2.12/2.33 0 [] -empty($c6).
% 2.12/2.33 0 [] ilf_type($c6,set_type).
% 2.12/2.33 0 [] -empty($c5).
% 2.12/2.33 0 [] ilf_type($c5,set_type).
% 2.12/2.33 0 [] ilf_type($c4,relation_type($c5,$c7)).
% 2.12/2.33 0 [] ilf_type($c3,member_type($c7)).
% 2.12/2.33 0 [] member($c3,image4($c5,$c7,$c4,$c6))|ilf_type($c2,member_type($c5)).
% 2.12/2.33 0 [] member($c3,image4($c5,$c7,$c4,$c6))|member(ordered_pair($c2,$c3),$c4).
% 2.12/2.33 0 [] member($c3,image4($c5,$c7,$c4,$c6))|member($c2,$c6).
% 2.12/2.33 0 [] -member($c3,image4($c5,$c7,$c4,$c6))| -ilf_type(G,member_type($c5))| -member(ordered_pair(G,$c3),$c4)| -member(G,$c6).
% 2.12/2.33 end_of_list.
% 2.12/2.33
% 2.12/2.33 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.12/2.33
% 2.12/2.33 This ia a non-Horn set with equality. The strategy will be
% 2.12/2.33 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.12/2.33 deletion, with positive clauses in sos and nonpositive
% 2.12/2.33 clauses in usable.
% 2.12/2.33
% 2.12/2.33 dependent: set(knuth_bendix).
% 2.12/2.33 dependent: set(anl_eq).
% 2.12/2.33 dependent: set(para_from).
% 2.12/2.33 dependent: set(para_into).
% 2.12/2.33 dependent: clear(para_from_right).
% 2.12/2.33 dependent: clear(para_into_right).
% 2.12/2.33 dependent: set(para_from_vars).
% 2.12/2.33 dependent: set(eq_units_both_ways).
% 2.12/2.33 dependent: set(dynamic_demod_all).
% 2.12/2.33 dependent: set(dynamic_demod).
% 2.12/2.33 dependent: set(order_eq).
% 2.12/2.33 dependent: set(back_demod).
% 2.12/2.33 dependent: set(lrpo).
% 2.12/2.33 dependent: set(hyper_res).
% 2.12/2.33 dependent: set(unit_deletion).
% 2.12/2.33 dependent: set(factor).
% 2.12/2.33
% 2.12/2.33 ------------> process usable:
% 2.12/2.33 ** KEPT (pick-wt=20): 1 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -member(B,image(C,A))|ilf_type($f1(A,B,C),set_type).
% 2.12/2.33 ** KEPT (pick-wt=22): 2 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -member(B,image(C,A))|member(ordered_pair($f1(A,B,C),B),C).
% 2.12/2.33 ** KEPT (pick-wt=20): 3 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -member(B,image(C,A))|member($f1(A,B,C),A).
% 2.12/2.33 ** KEPT (pick-wt=25): 4 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)|member(B,image(C,A))| -ilf_type(D,set_type)| -member(ordered_pair(D,B),C)| -member(D,A).
% 2.12/2.33 ** 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.12/2.33 ** 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.12/2.33 ** 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.19/2.35 ** 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.19/2.35 ** KEPT (pick-wt=11): 11 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(ordered_pair(A,B),set_type).
% 2.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** KEPT (pick-wt=10): 17 [] empty(A)| -ilf_type(A,set_type)|ilf_type($f3(A),member_type(A)).
% 2.19/2.35 ** KEPT (pick-wt=11): 18 [] -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 2.19/2.35 ** KEPT (pick-wt=9): 19 [] -ilf_type(A,set_type)|empty(A)|ilf_type($f4(A),set_type).
% 2.19/2.35 ** KEPT (pick-wt=9): 20 [] -ilf_type(A,set_type)|empty(A)|member($f4(A),A).
% 2.19/2.35 ** KEPT (pick-wt=7): 21 [] -ilf_type(A,set_type)|ilf_type(singleton(A),set_type).
% 2.19/2.35 ** KEPT (pick-wt=11): 22 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),set_type).
% 2.19/2.35 ** KEPT (pick-wt=11): 23 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(unordered_pair(A,B),set_type).
% 2.19/2.35 ** KEPT (pick-wt=13): 24 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|unordered_pair(A,B)=unordered_pair(B,A).
% 2.19/2.35 ** KEPT (pick-wt=11): 25 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,set_type)|ilf_type(image(A,B),set_type).
% 2.19/2.35 ** KEPT (pick-wt=8): 26 [] -ilf_type(A,set_type)| -ilf_type(A,binary_relation_type)|relation_like(A).
% 2.19/2.35 ** KEPT (pick-wt=8): 27 [] -ilf_type(A,set_type)|ilf_type(A,binary_relation_type)| -relation_like(A).
% 2.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** KEPT (pick-wt=8): 30 [] -ilf_type(A,set_type)|ilf_type($f5(A),subset_type(A)).
% 2.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** 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.19/2.35 ** KEPT (pick-wt=19): 36 [] -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.19/2.35 ** KEPT (pick-wt=15): 37 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|ilf_type($f7(A,B),set_type).
% 2.19/2.35 ** KEPT (pick-wt=15): 38 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f7(A,B),A).
% 2.19/2.35 ** KEPT (pick-wt=15): 39 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))| -member($f7(A,B),B).
% 2.19/2.35 ** KEPT (pick-wt=6): 40 [] -ilf_type(A,set_type)| -empty(power_set(A)).
% 2.19/2.35 ** KEPT (pick-wt=7): 41 [] -ilf_type(A,set_type)|ilf_type(power_set(A),set_type).
% 2.19/2.35 ** KEPT (pick-wt=16): 42 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f9(A,B),set_type).
% 2.19/2.35 ** KEPT (pick-wt=16): 43 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f8(A,B),set_type).
% 2.19/2.35 ** KEPT (pick-wt=20): 45 [copy,44,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.
% 64.06/64.25 ** KEPT (pick-wt=9): 46 [] -ilf_type(A,set_type)|relation_like(A)|ilf_type($f10(A),set_type).
% 64.06/64.25 ** KEPT (pick-wt=9): 47 [] -ilf_type(A,set_type)|relation_like(A)|member($f10(A),A).
% 64.06/64.25 ** KEPT (pick-wt=17): 48 [] -ilf_type(A,set_type)|relation_like(A)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|$f10(A)!=ordered_pair(B,C).
% 64.06/64.25 ** KEPT (pick-wt=7): 49 [] -empty(A)| -ilf_type(A,set_type)|relation_like(A).
% 64.06/64.25 ** KEPT (pick-wt=14): 50 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|relation_like(C).
% 64.06/64.25 ** KEPT (pick-wt=23): 51 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))| -ilf_type(D,set_type)|image4(A,B,C,D)=image(C,D).
% 64.06/64.25 ** KEPT (pick-wt=22): 52 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))| -ilf_type(D,set_type)|ilf_type(image4(A,B,C,D),subset_type(B)).
% 64.06/64.25 ** KEPT (pick-wt=2): 53 [] -empty($c7).
% 64.06/64.25 ** KEPT (pick-wt=2): 54 [] -empty($c6).
% 64.06/64.25 ** KEPT (pick-wt=2): 55 [] -empty($c5).
% 64.06/64.25 ** KEPT (pick-wt=19): 56 [] -member($c3,image4($c5,$c7,$c4,$c6))| -ilf_type(A,member_type($c5))| -member(ordered_pair(A,$c3),$c4)| -member(A,$c6).
% 64.06/64.25
% 64.06/64.25 ------------> process sos:
% 64.06/64.25 ** KEPT (pick-wt=3): 139 [] A=A.
% 64.06/64.25 ** KEPT (pick-wt=3): 140 [] ilf_type($c1,binary_relation_type).
% 64.06/64.25 ** KEPT (pick-wt=3): 141 [] ilf_type(A,set_type).
% 64.06/64.25 Following clause subsumed by 141 during input processing: 0 [] ilf_type($c7,set_type).
% 64.06/64.25 Following clause subsumed by 141 during input processing: 0 [] ilf_type($c6,set_type).
% 64.06/64.25 Following clause subsumed by 141 during input processing: 0 [] ilf_type($c5,set_type).
% 64.06/64.25 ** KEPT (pick-wt=5): 142 [] ilf_type($c4,relation_type($c5,$c7)).
% 64.06/64.25 ** KEPT (pick-wt=4): 143 [] ilf_type($c3,member_type($c7)).
% 64.06/64.25 ** KEPT (pick-wt=11): 144 [] member($c3,image4($c5,$c7,$c4,$c6))|ilf_type($c2,member_type($c5)).
% 64.06/64.25 ** KEPT (pick-wt=12): 145 [] member($c3,image4($c5,$c7,$c4,$c6))|member(ordered_pair($c2,$c3),$c4).
% 64.06/64.25 ** KEPT (pick-wt=10): 146 [] member($c3,image4($c5,$c7,$c4,$c6))|member($c2,$c6).
% 64.06/64.25 Following clause subsumed by 139 during input processing: 0 [copy,139,flip.1] A=A.
% 64.06/64.25 139 back subsumes 99.
% 64.06/64.25 139 back subsumes 98.
% 64.06/64.25 139 back subsumes 97.
% 64.06/64.25 139 back subsumes 90.
% 64.06/64.25 141 back subsumes 107.
% 64.06/64.25 141 back subsumes 106.
% 64.06/64.25 141 back subsumes 103.
% 64.06/64.25 141 back subsumes 89.
% 64.06/64.25 141 back subsumes 88.
% 64.06/64.25 141 back subsumes 81.
% 64.06/64.25 141 back subsumes 57.
% 64.06/64.25 141 back subsumes 46.
% 64.06/64.25 141 back subsumes 43.
% 64.06/64.25 141 back subsumes 42.
% 64.06/64.25 141 back subsumes 41.
% 64.06/64.25 141 back subsumes 37.
% 64.06/64.25 141 back subsumes 33.
% 64.06/64.25 141 back subsumes 25.
% 64.06/64.25 141 back subsumes 23.
% 64.06/64.25 141 back subsumes 22.
% 64.06/64.25 141 back subsumes 21.
% 64.06/64.25 141 back subsumes 19.
% 64.06/64.25 141 back subsumes 11.
% 64.06/64.25 141 back subsumes 1.
% 64.06/64.25
% 64.06/64.25 ======= end of input processing =======
% 64.06/64.25
% 64.06/64.25 =========== start of search ===========
% 64.06/64.25
% 64.06/64.25
% 64.06/64.25 Resetting weight limit to 9.
% 64.06/64.25
% 64.06/64.25
% 64.06/64.25 Resetting weight limit to 9.
% 64.06/64.25
% 64.06/64.25 sos_size=274
% 64.06/64.25
% 64.06/64.25 Search stopped because sos empty.
% 64.06/64.25
% 64.06/64.25
% 64.06/64.25 Search stopped because sos empty.
% 64.06/64.25
% 64.06/64.25 ============ end of search ============
% 64.06/64.25
% 64.06/64.25 -------------- statistics -------------
% 64.06/64.25 clauses given 367
% 64.06/64.25 clauses generated 2251171
% 64.06/64.25 clauses kept 617
% 64.06/64.25 clauses forward subsumed 1187
% 64.06/64.25 clauses back subsumed 153
% 64.06/64.25 Kbytes malloced 6835
% 64.06/64.25
% 64.06/64.25 ----------- times (seconds) -----------
% 64.06/64.25 user CPU time 61.91 (0 hr, 1 min, 1 sec)
% 64.06/64.25 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 64.06/64.25 wall-clock time 64 (0 hr, 1 min, 4 sec)
% 64.06/64.25
% 64.06/64.25 Process 3813 finished Wed Jul 27 10:43:01 2022
% 64.06/64.25 Otter interrupted
% 64.06/64.25 PROOF NOT FOUND
%------------------------------------------------------------------------------