TSTP Solution File: SET708+4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET708+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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:07 EDT 2022
% Result : Timeout 299.86s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET708+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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:00:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.87/2.07 ----- Otter 3.3f, August 2004 -----
% 1.87/2.07 The process was started by sandbox2 on n017.cluster.edu,
% 1.87/2.07 Wed Jul 27 10:00:18 2022
% 1.87/2.07 The command was "./otter". The process ID is 5681.
% 1.87/2.07
% 1.87/2.07 set(prolog_style_variables).
% 1.87/2.07 set(auto).
% 1.87/2.07 dependent: set(auto1).
% 1.87/2.07 dependent: set(process_input).
% 1.87/2.07 dependent: clear(print_kept).
% 1.87/2.07 dependent: clear(print_new_demod).
% 1.87/2.07 dependent: clear(print_back_demod).
% 1.87/2.07 dependent: clear(print_back_sub).
% 1.87/2.07 dependent: set(control_memory).
% 1.87/2.07 dependent: assign(max_mem, 12000).
% 1.87/2.07 dependent: assign(pick_given_ratio, 4).
% 1.87/2.07 dependent: assign(stats_level, 1).
% 1.87/2.07 dependent: assign(max_seconds, 10800).
% 1.87/2.07 clear(print_given).
% 1.87/2.07
% 1.87/2.07 formula_list(usable).
% 1.87/2.07 all A (A=A).
% 1.87/2.07 all A B (subset(A,B)<-> (all X (member(X,A)->member(X,B)))).
% 1.87/2.07 all A B (e_qual_set(A,B)<->subset(A,B)&subset(B,A)).
% 1.87/2.07 all X A (member(X,power_set(A))<->subset(X,A)).
% 1.87/2.07 all X A B (member(X,intersection(A,B))<->member(X,A)&member(X,B)).
% 1.87/2.07 all X A B (member(X,union(A,B))<->member(X,A)|member(X,B)).
% 1.87/2.07 all X (-member(X,empty_set)).
% 1.87/2.07 all B A E (member(B,difference(E,A))<->member(B,E)& -member(B,A)).
% 1.87/2.07 all X A (member(X,singleton(A))<->X=A).
% 1.87/2.07 all X A B (member(X,unordered_pair(A,B))<->X=A|X=B).
% 1.87/2.07 all X A (member(X,sum(A))<-> (exists Y (member(Y,A)&member(X,Y)))).
% 1.87/2.07 all X A (member(X,product(A))<-> (all Y (member(Y,A)->member(X,Y)))).
% 1.87/2.07 all F A B (maps(F,A,B)<-> (all X (member(X,A)-> (exists Y (member(Y,B)&apply(F,X,Y)))))& (all X Y1 Y2 (member(X,A)&member(Y1,B)&member(Y2,B)-> (apply(F,X,Y1)&apply(F,X,Y2)->Y1=Y2)))).
% 1.87/2.07 all H G F A B C (compose_predicate(H,G,F,A,B,C)<-> (all X Z (member(X,A)&member(Z,C)-> (apply(H,X,Z)<-> (exists Y (member(Y,B)&apply(F,X,Y)&apply(G,Y,Z))))))).
% 1.87/2.07 all G F A B C X Z (member(X,A)&member(Z,C)-> (apply(compose_function(G,F,A,B,C),X,Z)<-> (exists Y (member(Y,B)&apply(F,X,Y)&apply(G,Y,Z))))).
% 1.87/2.07 all F G A B (e_qual_maps(F,G,A,B)<-> (all X Y1 Y2 (member(X,A)&member(Y1,B)&member(Y2,B)-> (apply(F,X,Y1)&apply(G,X,Y2)->Y1=Y2)))).
% 1.87/2.07 all F A (identity(F,A)<-> (all X (member(X,A)->apply(F,X,X)))).
% 1.87/2.07 all F A B (injective(F,A,B)<-> (all X1 X2 Y (member(X1,A)&member(X2,A)&member(Y,B)-> (apply(F,X1,Y)&apply(F,X2,Y)->X1=X2)))).
% 1.87/2.07 all F A B (surjective(F,A,B)<-> (all Y (member(Y,B)-> (exists E (member(E,A)&apply(F,E,Y)))))).
% 1.87/2.07 all F A B (one_to_one(F,A,B)<->injective(F,A,B)&surjective(F,A,B)).
% 1.87/2.07 all G F A B (inverse_predicate(G,F,A,B)<-> (all X Y (member(X,A)&member(Y,B)-> (apply(F,X,Y)<->apply(G,Y,X))))).
% 1.87/2.07 all F A B X Y (member(X,A)&member(Y,B)-> (apply(F,X,Y)<->apply(inverse_function(F,A,B),Y,X))).
% 1.87/2.07 all F A Y (member(Y,image2(F,A))<-> (exists X (member(X,A)&apply(F,X,Y)))).
% 1.87/2.07 all F A B Y (member(Y,image3(F,A,B))<->member(Y,B)& (exists X (member(X,A)&apply(F,X,Y)))).
% 1.87/2.07 all F B X (member(X,inverse_image2(F,B))<-> (exists Y (member(Y,B)&apply(F,X,Y)))).
% 1.87/2.07 all F B A X (member(X,inverse_image3(F,B,A))<->member(X,A)& (exists Y (member(Y,B)&apply(F,X,Y)))).
% 1.87/2.07 all F A R B S (increasing(F,A,R,B,S)<-> (all X1 Y1 X2 Y2 (member(X1,A)&member(Y1,B)&member(X2,A)&member(Y2,B)&apply(R,X1,X2)&apply(F,X1,Y1)&apply(F,X2,Y2)->apply(S,Y1,Y2)))).
% 1.87/2.07 all F A R B S (decreasing(F,A,R,B,S)<-> (all X1 Y1 X2 Y2 (member(X1,A)&member(Y1,B)&member(X2,A)&member(Y2,B)&apply(R,X1,X2)&apply(F,X1,Y1)&apply(F,X2,Y2)->apply(S,Y2,Y1)))).
% 1.87/2.07 all F A R B S (isomorphism(F,A,R,B,S)<->maps(F,A,B)&one_to_one(F,A,B)& (all X1 Y1 X2 Y2 (member(X1,A)&member(Y1,B)&member(X2,A)&member(Y2,B)&apply(F,X1,Y1)&apply(F,X2,Y2)-> (apply(R,X1,X2)<->apply(S,Y1,Y2))))).
% 1.87/2.07 -(all F G H1 H2 A B C (maps(F,A,B)&maps(G,B,C)&compose_predicate(H1,G,F,A,B,C)&compose_predicate(H2,G,F,A,B,C)->e_qual_maps(H1,H2,A,C))).
% 1.87/2.07 end_of_list.
% 1.87/2.07
% 1.87/2.07 -------> usable clausifies to:
% 1.87/2.07
% 1.87/2.07 list(usable).
% 1.87/2.07 0 [] A=A.
% 1.87/2.07 0 [] -subset(A,B)| -member(X,A)|member(X,B).
% 1.87/2.07 0 [] subset(A,B)|member($f1(A,B),A).
% 1.87/2.07 0 [] subset(A,B)| -member($f1(A,B),B).
% 1.87/2.07 0 [] -e_qual_set(A,B)|subset(A,B).
% 1.87/2.07 0 [] -e_qual_set(A,B)|subset(B,A).
% 1.87/2.07 0 [] e_qual_set(A,B)| -subset(A,B)| -subset(B,A).
% 1.87/2.07 0 [] -member(X,power_set(A))|subset(X,A).
% 1.87/2.07 0 [] member(X,power_set(A))| -subset(X,A).
% 1.87/2.07 0 [] -member(X,intersection(A,B))|member(X,A).
% 1.87/2.07 0 [] -member(X,intersection(A,B))|member(X,B).
% 1.87/2.07 0 [] member(X,intersection(A,B))| -member(X,A)| -member(X,B).
% 1.87/2.07 0 [] -member(X,union(A,B))|member(X,A)|member(X,B).
% 1.87/2.07 0 [] member(X,union(A,B))| -member(X,A).
% 1.87/2.07 0 [] member(X,union(A,B))| -member(X,B).
% 1.87/2.07 0 [] -member(X,empty_set).
% 1.87/2.07 0 [] -member(B,difference(E,A))|member(B,E).
% 1.87/2.07 0 [] -member(B,difference(E,A))| -member(B,A).
% 1.87/2.07 0 [] member(B,difference(E,A))| -member(B,E)|member(B,A).
% 1.87/2.07 0 [] -member(X,singleton(A))|X=A.
% 1.87/2.07 0 [] member(X,singleton(A))|X!=A.
% 1.87/2.07 0 [] -member(X,unordered_pair(A,B))|X=A|X=B.
% 1.87/2.07 0 [] member(X,unordered_pair(A,B))|X!=A.
% 1.87/2.07 0 [] member(X,unordered_pair(A,B))|X!=B.
% 1.87/2.07 0 [] -member(X,sum(A))|member($f2(X,A),A).
% 1.87/2.07 0 [] -member(X,sum(A))|member(X,$f2(X,A)).
% 1.87/2.07 0 [] member(X,sum(A))| -member(Y,A)| -member(X,Y).
% 1.87/2.07 0 [] -member(X,product(A))| -member(Y,A)|member(X,Y).
% 1.87/2.07 0 [] member(X,product(A))|member($f3(X,A),A).
% 1.87/2.07 0 [] member(X,product(A))| -member(X,$f3(X,A)).
% 1.87/2.07 0 [] -maps(F,A,B)| -member(X,A)|member($f4(F,A,B,X),B).
% 1.87/2.07 0 [] -maps(F,A,B)| -member(X,A)|apply(F,X,$f4(F,A,B,X)).
% 1.87/2.07 0 [] -maps(F,A,B)| -member(X3,A)| -member(Y1,B)| -member(Y2,B)| -apply(F,X3,Y1)| -apply(F,X3,Y2)|Y1=Y2.
% 1.87/2.07 0 [] maps(F,A,B)|member($f5(F,A,B),A)|member($f8(F,A,B),A).
% 1.87/2.07 0 [] maps(F,A,B)|member($f5(F,A,B),A)|member($f7(F,A,B),B).
% 1.87/2.07 0 [] maps(F,A,B)|member($f5(F,A,B),A)|member($f6(F,A,B),B).
% 1.87/2.07 0 [] maps(F,A,B)|member($f5(F,A,B),A)|apply(F,$f8(F,A,B),$f7(F,A,B)).
% 1.87/2.07 0 [] maps(F,A,B)|member($f5(F,A,B),A)|apply(F,$f8(F,A,B),$f6(F,A,B)).
% 1.87/2.07 0 [] maps(F,A,B)|member($f5(F,A,B),A)|$f7(F,A,B)!=$f6(F,A,B).
% 1.87/2.07 0 [] maps(F,A,B)| -member(Y,B)| -apply(F,$f5(F,A,B),Y)|member($f8(F,A,B),A).
% 1.87/2.07 0 [] maps(F,A,B)| -member(Y,B)| -apply(F,$f5(F,A,B),Y)|member($f7(F,A,B),B).
% 1.87/2.07 0 [] maps(F,A,B)| -member(Y,B)| -apply(F,$f5(F,A,B),Y)|member($f6(F,A,B),B).
% 1.87/2.07 0 [] maps(F,A,B)| -member(Y,B)| -apply(F,$f5(F,A,B),Y)|apply(F,$f8(F,A,B),$f7(F,A,B)).
% 1.87/2.07 0 [] maps(F,A,B)| -member(Y,B)| -apply(F,$f5(F,A,B),Y)|apply(F,$f8(F,A,B),$f6(F,A,B)).
% 1.87/2.07 0 [] maps(F,A,B)| -member(Y,B)| -apply(F,$f5(F,A,B),Y)|$f7(F,A,B)!=$f6(F,A,B).
% 1.87/2.07 0 [] -compose_predicate(H,G,F,A,B,C)| -member(X,A)| -member(Z,C)| -apply(H,X,Z)|member($f9(H,G,F,A,B,C,X,Z),B).
% 1.87/2.07 0 [] -compose_predicate(H,G,F,A,B,C)| -member(X,A)| -member(Z,C)| -apply(H,X,Z)|apply(F,X,$f9(H,G,F,A,B,C,X,Z)).
% 1.87/2.07 0 [] -compose_predicate(H,G,F,A,B,C)| -member(X,A)| -member(Z,C)| -apply(H,X,Z)|apply(G,$f9(H,G,F,A,B,C,X,Z),Z).
% 1.87/2.07 0 [] -compose_predicate(H,G,F,A,B,C)| -member(X,A)| -member(Z,C)|apply(H,X,Z)| -member(Y,B)| -apply(F,X,Y)| -apply(G,Y,Z).
% 1.87/2.07 0 [] compose_predicate(H,G,F,A,B,C)|member($f12(H,G,F,A,B,C),A).
% 1.87/2.07 0 [] compose_predicate(H,G,F,A,B,C)|member($f11(H,G,F,A,B,C),C).
% 1.87/2.07 0 [] compose_predicate(H,G,F,A,B,C)|apply(H,$f12(H,G,F,A,B,C),$f11(H,G,F,A,B,C))|member($f10(H,G,F,A,B,C),B).
% 1.87/2.07 0 [] compose_predicate(H,G,F,A,B,C)|apply(H,$f12(H,G,F,A,B,C),$f11(H,G,F,A,B,C))|apply(F,$f12(H,G,F,A,B,C),$f10(H,G,F,A,B,C)).
% 1.87/2.07 0 [] compose_predicate(H,G,F,A,B,C)|apply(H,$f12(H,G,F,A,B,C),$f11(H,G,F,A,B,C))|apply(G,$f10(H,G,F,A,B,C),$f11(H,G,F,A,B,C)).
% 1.87/2.07 0 [] compose_predicate(H,G,F,A,B,C)| -apply(H,$f12(H,G,F,A,B,C),$f11(H,G,F,A,B,C))| -member(X4,B)| -apply(F,$f12(H,G,F,A,B,C),X4)| -apply(G,X4,$f11(H,G,F,A,B,C)).
% 1.87/2.07 0 [] -member(X,A)| -member(Z,C)| -apply(compose_function(G,F,A,B,C),X,Z)|member($f13(G,F,A,B,C,X,Z),B).
% 1.87/2.07 0 [] -member(X,A)| -member(Z,C)| -apply(compose_function(G,F,A,B,C),X,Z)|apply(F,X,$f13(G,F,A,B,C,X,Z)).
% 1.87/2.07 0 [] -member(X,A)| -member(Z,C)| -apply(compose_function(G,F,A,B,C),X,Z)|apply(G,$f13(G,F,A,B,C,X,Z),Z).
% 1.87/2.07 0 [] -member(X,A)| -member(Z,C)|apply(compose_function(G,F,A,B,C),X,Z)| -member(Y,B)| -apply(F,X,Y)| -apply(G,Y,Z).
% 1.87/2.07 0 [] -e_qual_maps(F,G,A,B)| -member(X,A)| -member(Y1,B)| -member(Y2,B)| -apply(F,X,Y1)| -apply(G,X,Y2)|Y1=Y2.
% 1.87/2.07 0 [] e_qual_maps(F,G,A,B)|member($f16(F,G,A,B),A).
% 1.87/2.07 0 [] e_qual_maps(F,G,A,B)|member($f15(F,G,A,B),B).
% 1.87/2.07 0 [] e_qual_maps(F,G,A,B)|member($f14(F,G,A,B),B).
% 1.87/2.07 0 [] e_qual_maps(F,G,A,B)|apply(F,$f16(F,G,A,B),$f15(F,G,A,B)).
% 1.87/2.07 0 [] e_qual_maps(F,G,A,B)|apply(G,$f16(F,G,A,B),$f14(F,G,A,B)).
% 1.87/2.07 0 [] e_qual_maps(F,G,A,B)|$f15(F,G,A,B)!=$f14(F,G,A,B).
% 1.87/2.07 0 [] -identity(F,A)| -member(X,A)|apply(F,X,X).
% 1.87/2.07 0 [] identity(F,A)|member($f17(F,A),A).
% 1.87/2.07 0 [] identity(F,A)| -apply(F,$f17(F,A),$f17(F,A)).
% 1.87/2.07 0 [] -injective(F,A,B)| -member(X1,A)| -member(X2,A)| -member(Y,B)| -apply(F,X1,Y)| -apply(F,X2,Y)|X1=X2.
% 1.87/2.07 0 [] injective(F,A,B)|member($f20(F,A,B),A).
% 1.92/2.07 0 [] injective(F,A,B)|member($f19(F,A,B),A).
% 1.92/2.07 0 [] injective(F,A,B)|member($f18(F,A,B),B).
% 1.92/2.07 0 [] injective(F,A,B)|apply(F,$f20(F,A,B),$f18(F,A,B)).
% 1.92/2.07 0 [] injective(F,A,B)|apply(F,$f19(F,A,B),$f18(F,A,B)).
% 1.92/2.07 0 [] injective(F,A,B)|$f20(F,A,B)!=$f19(F,A,B).
% 1.92/2.07 0 [] -surjective(F,A,B)| -member(Y,B)|member($f21(F,A,B,Y),A).
% 1.92/2.07 0 [] -surjective(F,A,B)| -member(Y,B)|apply(F,$f21(F,A,B,Y),Y).
% 1.92/2.07 0 [] surjective(F,A,B)|member($f22(F,A,B),B).
% 1.92/2.07 0 [] surjective(F,A,B)| -member(E,A)| -apply(F,E,$f22(F,A,B)).
% 1.92/2.07 0 [] -one_to_one(F,A,B)|injective(F,A,B).
% 1.92/2.07 0 [] -one_to_one(F,A,B)|surjective(F,A,B).
% 1.92/2.07 0 [] one_to_one(F,A,B)| -injective(F,A,B)| -surjective(F,A,B).
% 1.92/2.07 0 [] -inverse_predicate(G,F,A,B)| -member(X,A)| -member(Y,B)| -apply(F,X,Y)|apply(G,Y,X).
% 1.92/2.07 0 [] -inverse_predicate(G,F,A,B)| -member(X,A)| -member(Y,B)|apply(F,X,Y)| -apply(G,Y,X).
% 1.92/2.07 0 [] inverse_predicate(G,F,A,B)|member($f24(G,F,A,B),A).
% 1.92/2.07 0 [] inverse_predicate(G,F,A,B)|member($f23(G,F,A,B),B).
% 1.92/2.07 0 [] inverse_predicate(G,F,A,B)|apply(F,$f24(G,F,A,B),$f23(G,F,A,B))|apply(G,$f23(G,F,A,B),$f24(G,F,A,B)).
% 1.92/2.07 0 [] inverse_predicate(G,F,A,B)| -apply(F,$f24(G,F,A,B),$f23(G,F,A,B))| -apply(G,$f23(G,F,A,B),$f24(G,F,A,B)).
% 1.92/2.07 0 [] -member(X,A)| -member(Y,B)| -apply(F,X,Y)|apply(inverse_function(F,A,B),Y,X).
% 1.92/2.07 0 [] -member(X,A)| -member(Y,B)|apply(F,X,Y)| -apply(inverse_function(F,A,B),Y,X).
% 1.92/2.07 0 [] -member(Y,image2(F,A))|member($f25(F,A,Y),A).
% 1.92/2.07 0 [] -member(Y,image2(F,A))|apply(F,$f25(F,A,Y),Y).
% 1.92/2.07 0 [] member(Y,image2(F,A))| -member(X,A)| -apply(F,X,Y).
% 1.92/2.07 0 [] -member(Y,image3(F,A,B))|member(Y,B).
% 1.92/2.07 0 [] -member(Y,image3(F,A,B))|member($f26(F,A,B,Y),A).
% 1.92/2.07 0 [] -member(Y,image3(F,A,B))|apply(F,$f26(F,A,B,Y),Y).
% 1.92/2.07 0 [] member(Y,image3(F,A,B))| -member(Y,B)| -member(X,A)| -apply(F,X,Y).
% 1.92/2.07 0 [] -member(X,inverse_image2(F,B))|member($f27(F,B,X),B).
% 1.92/2.07 0 [] -member(X,inverse_image2(F,B))|apply(F,X,$f27(F,B,X)).
% 1.92/2.07 0 [] member(X,inverse_image2(F,B))| -member(Y,B)| -apply(F,X,Y).
% 1.92/2.07 0 [] -member(X,inverse_image3(F,B,A))|member(X,A).
% 1.92/2.07 0 [] -member(X,inverse_image3(F,B,A))|member($f28(F,B,A,X),B).
% 1.92/2.07 0 [] -member(X,inverse_image3(F,B,A))|apply(F,X,$f28(F,B,A,X)).
% 1.92/2.07 0 [] member(X,inverse_image3(F,B,A))| -member(X,A)| -member(Y,B)| -apply(F,X,Y).
% 1.92/2.07 0 [] -increasing(F,A,R,B,S)| -member(X1,A)| -member(Y1,B)| -member(X2,A)| -member(Y2,B)| -apply(R,X1,X2)| -apply(F,X1,Y1)| -apply(F,X2,Y2)|apply(S,Y1,Y2).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)|member($f32(F,A,R,B,S),A).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)|member($f31(F,A,R,B,S),B).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)|member($f30(F,A,R,B,S),A).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)|member($f29(F,A,R,B,S),B).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)|apply(R,$f32(F,A,R,B,S),$f30(F,A,R,B,S)).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)|apply(F,$f32(F,A,R,B,S),$f31(F,A,R,B,S)).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)|apply(F,$f30(F,A,R,B,S),$f29(F,A,R,B,S)).
% 1.92/2.07 0 [] increasing(F,A,R,B,S)| -apply(S,$f31(F,A,R,B,S),$f29(F,A,R,B,S)).
% 1.92/2.07 0 [] -decreasing(F,A,R,B,S)| -member(X1,A)| -member(Y1,B)| -member(X2,A)| -member(Y2,B)| -apply(R,X1,X2)| -apply(F,X1,Y1)| -apply(F,X2,Y2)|apply(S,Y2,Y1).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)|member($f36(F,A,R,B,S),A).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)|member($f35(F,A,R,B,S),B).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)|member($f34(F,A,R,B,S),A).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)|member($f33(F,A,R,B,S),B).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)|apply(R,$f36(F,A,R,B,S),$f34(F,A,R,B,S)).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)|apply(F,$f36(F,A,R,B,S),$f35(F,A,R,B,S)).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)|apply(F,$f34(F,A,R,B,S),$f33(F,A,R,B,S)).
% 1.92/2.07 0 [] decreasing(F,A,R,B,S)| -apply(S,$f33(F,A,R,B,S),$f35(F,A,R,B,S)).
% 1.92/2.07 0 [] -isomorphism(F,A,R,B,S)|maps(F,A,B).
% 1.92/2.07 0 [] -isomorphism(F,A,R,B,S)|one_to_one(F,A,B).
% 1.92/2.07 0 [] -isomorphism(F,A,R,B,S)| -member(X1,A)| -member(Y1,B)| -member(X2,A)| -member(Y2,B)| -apply(F,X1,Y1)| -apply(F,X2,Y2)| -apply(R,X1,X2)|apply(S,Y1,Y2).
% 1.92/2.07 0 [] -isomorphism(F,A,R,B,S)| -member(X1,A)| -member(Y1,B)| -member(X2,A)| -member(Y2,B)| -apply(F,X1,Y1)| -apply(F,X2,Y2)|apply(R,X1,X2)| -apply(S,Y1,Y2).
% 1.92/2.07 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)|member($f40(F,A,R,B,S),A).
% 1.92/2.07 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)|member($f39(F,A,R,B,S),B).
% 1.92/2.07 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)|member($f38(F,A,R,B,S),A).
% 1.92/2.08 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)|member($f37(F,A,R,B,S),B).
% 1.92/2.08 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)|apply(F,$f40(F,A,R,B,S),$f39(F,A,R,B,S)).
% 1.92/2.08 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)|apply(F,$f38(F,A,R,B,S),$f37(F,A,R,B,S)).
% 1.92/2.08 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)|apply(R,$f40(F,A,R,B,S),$f38(F,A,R,B,S))|apply(S,$f39(F,A,R,B,S),$f37(F,A,R,B,S)).
% 1.92/2.08 0 [] isomorphism(F,A,R,B,S)| -maps(F,A,B)| -one_to_one(F,A,B)| -apply(R,$f40(F,A,R,B,S),$f38(F,A,R,B,S))| -apply(S,$f39(F,A,R,B,S),$f37(F,A,R,B,S)).
% 1.92/2.08 0 [] maps($c7,$c3,$c2).
% 1.92/2.08 0 [] maps($c6,$c2,$c1).
% 1.92/2.08 0 [] compose_predicate($c5,$c6,$c7,$c3,$c2,$c1).
% 1.92/2.08 0 [] compose_predicate($c4,$c6,$c7,$c3,$c2,$c1).
% 1.92/2.08 0 [] -e_qual_maps($c5,$c4,$c3,$c1).
% 1.92/2.08 end_of_list.
% 1.92/2.08
% 1.92/2.08 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.92/2.08
% 1.92/2.08 This ia a non-Horn set with equality. The strategy will be
% 1.92/2.08 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.92/2.08 deletion, with positive clauses in sos and nonpositive
% 1.92/2.08 clauses in usable.
% 1.92/2.08
% 1.92/2.08 dependent: set(knuth_bendix).
% 1.92/2.08 dependent: set(anl_eq).
% 1.92/2.08 dependent: set(para_from).
% 1.92/2.08 dependent: set(para_into).
% 1.92/2.08 dependent: clear(para_from_right).
% 1.92/2.08 dependent: clear(para_into_right).
% 1.92/2.08 dependent: set(para_from_vars).
% 1.92/2.08 dependent: set(eq_units_both_ways).
% 1.92/2.08 dependent: set(dynamic_demod_all).
% 1.92/2.08 dependent: set(dynamic_demod).
% 1.92/2.08 dependent: set(order_eq).
% 1.92/2.08 dependent: set(back_demod).
% 1.92/2.08 dependent: set(lrpo).
% 1.92/2.08 dependent: set(hyper_res).
% 1.92/2.08 dependent: set(unit_deletion).
% 1.92/2.08 dependent: set(factor).
% 1.92/2.08
% 1.92/2.08 ------------> process usable:
% 1.92/2.08 ** KEPT (pick-wt=9): 1 [] -subset(A,B)| -member(C,A)|member(C,B).
% 1.92/2.08 ** KEPT (pick-wt=8): 2 [] subset(A,B)| -member($f1(A,B),B).
% 1.92/2.08 ** KEPT (pick-wt=6): 3 [] -e_qual_set(A,B)|subset(A,B).
% 1.92/2.08 ** KEPT (pick-wt=6): 4 [] -e_qual_set(A,B)|subset(B,A).
% 1.92/2.08 ** KEPT (pick-wt=9): 5 [] e_qual_set(A,B)| -subset(A,B)| -subset(B,A).
% 1.92/2.08 ** KEPT (pick-wt=7): 6 [] -member(A,power_set(B))|subset(A,B).
% 1.92/2.08 ** KEPT (pick-wt=7): 7 [] member(A,power_set(B))| -subset(A,B).
% 1.92/2.08 ** KEPT (pick-wt=8): 8 [] -member(A,intersection(B,C))|member(A,B).
% 1.92/2.08 ** KEPT (pick-wt=8): 9 [] -member(A,intersection(B,C))|member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=11): 10 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=11): 11 [] -member(A,union(B,C))|member(A,B)|member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=8): 12 [] member(A,union(B,C))| -member(A,B).
% 1.92/2.08 ** KEPT (pick-wt=8): 13 [] member(A,union(B,C))| -member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=3): 14 [] -member(A,empty_set).
% 1.92/2.08 ** KEPT (pick-wt=8): 15 [] -member(A,difference(B,C))|member(A,B).
% 1.92/2.08 ** KEPT (pick-wt=8): 16 [] -member(A,difference(B,C))| -member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=11): 17 [] member(A,difference(B,C))| -member(A,B)|member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=7): 18 [] -member(A,singleton(B))|A=B.
% 1.92/2.08 ** KEPT (pick-wt=7): 19 [] member(A,singleton(B))|A!=B.
% 1.92/2.08 ** KEPT (pick-wt=11): 20 [] -member(A,unordered_pair(B,C))|A=B|A=C.
% 1.92/2.08 ** KEPT (pick-wt=8): 21 [] member(A,unordered_pair(B,C))|A!=B.
% 1.92/2.08 ** KEPT (pick-wt=8): 22 [] member(A,unordered_pair(B,C))|A!=C.
% 1.92/2.08 ** KEPT (pick-wt=9): 23 [] -member(A,sum(B))|member($f2(A,B),B).
% 1.92/2.08 ** KEPT (pick-wt=9): 24 [] -member(A,sum(B))|member(A,$f2(A,B)).
% 1.92/2.08 ** KEPT (pick-wt=10): 25 [] member(A,sum(B))| -member(C,B)| -member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=10): 26 [] -member(A,product(B))| -member(C,B)|member(A,C).
% 1.92/2.08 ** KEPT (pick-wt=9): 27 [] member(A,product(B))| -member(A,$f3(A,B)).
% 1.92/2.08 ** KEPT (pick-wt=14): 28 [] -maps(A,B,C)| -member(D,B)|member($f4(A,B,C,D),C).
% 1.92/2.08 ** KEPT (pick-wt=15): 29 [] -maps(A,B,C)| -member(D,B)|apply(A,D,$f4(A,B,C,D)).
% 1.92/2.08 ** KEPT (pick-wt=24): 30 [] -maps(A,B,C)| -member(D,B)| -member(E,C)| -member(F,C)| -apply(A,D,E)| -apply(A,D,F)|E=F.
% 1.92/2.08 ** KEPT (pick-wt=19): 31 [] maps(A,B,C)|member($f5(A,B,C),B)|$f7(A,B,C)!=$f6(A,B,C).
% 1.92/2.08 ** KEPT (pick-wt=20): 32 [] maps(A,B,C)| -member(D,C)| -apply(A,$f5(A,B,C),D)|member($f8(A,B,C),B).
% 1.92/2.08 ** KEPT (pick-wt=20): 33 [] maps(A,B,C)| -member(D,C)| -apply(A,$f5(A,B,C),D)|member($f7(A,B,C),C).
% 1.92/2.08 ** KEPT (pick-wt=20): 34 [] maps(A,B,C)| -member(D,C)| -apply(A,$f5(A,B,C),D)|member($f6(A,B,C),C).
% 1.92/2.08 ** KEPT (pick-wt=24): 35 [] maps(A,B,C)| -member(D,C)| -apply(A,$f5(A,B,C),D)|apply(A,$f8(A,B,C),$f7(A,B,C)).
% 1.98/2.15 ** KEPT (pick-wt=24): 36 [] maps(A,B,C)| -member(D,C)| -apply(A,$f5(A,B,C),D)|apply(A,$f8(A,B,C),$f6(A,B,C)).
% 1.98/2.15 ** KEPT (pick-wt=23): 37 [] maps(A,B,C)| -member(D,C)| -apply(A,$f5(A,B,C),D)|$f7(A,B,C)!=$f6(A,B,C).
% 1.98/2.15 ** KEPT (pick-wt=28): 38 [] -compose_predicate(A,B,C,D,E,F)| -member(G,D)| -member(H,F)| -apply(A,G,H)|member($f9(A,B,C,D,E,F,G,H),E).
% 1.98/2.15 ** KEPT (pick-wt=29): 39 [] -compose_predicate(A,B,C,D,E,F)| -member(G,D)| -member(H,F)| -apply(A,G,H)|apply(C,G,$f9(A,B,C,D,E,F,G,H)).
% 1.98/2.15 ** KEPT (pick-wt=29): 40 [] -compose_predicate(A,B,C,D,E,F)| -member(G,D)| -member(H,F)| -apply(A,G,H)|apply(B,$f9(A,B,C,D,E,F,G,H),H).
% 1.98/2.15 ** KEPT (pick-wt=28): 41 [] -compose_predicate(A,B,C,D,E,F)| -member(G,D)| -member(H,F)|apply(A,G,H)| -member(I,E)| -apply(C,G,I)| -apply(B,I,H).
% 1.98/2.15 ** KEPT (pick-wt=46): 42 [] compose_predicate(A,B,C,D,E,F)| -apply(A,$f12(A,B,C,D,E,F),$f11(A,B,C,D,E,F))| -member(G,E)| -apply(C,$f12(A,B,C,D,E,F),G)| -apply(B,G,$f11(A,B,C,D,E,F)).
% 1.98/2.15 ** KEPT (pick-wt=25): 43 [] -member(A,B)| -member(C,D)| -apply(compose_function(E,F,B,G,D),A,C)|member($f13(E,F,B,G,D,A,C),G).
% 1.98/2.15 ** KEPT (pick-wt=26): 44 [] -member(A,B)| -member(C,D)| -apply(compose_function(E,F,B,G,D),A,C)|apply(F,A,$f13(E,F,B,G,D,A,C)).
% 1.98/2.15 ** KEPT (pick-wt=26): 45 [] -member(A,B)| -member(C,D)| -apply(compose_function(E,F,B,G,D),A,C)|apply(E,$f13(E,F,B,G,D,A,C),C).
% 1.98/2.15 ** KEPT (pick-wt=26): 46 [] -member(A,B)| -member(C,D)|apply(compose_function(E,F,B,G,D),A,C)| -member(H,G)| -apply(F,A,H)| -apply(E,H,C).
% 1.98/2.15 ** KEPT (pick-wt=25): 47 [] -e_qual_maps(A,B,C,D)| -member(E,C)| -member(F,D)| -member(G,D)| -apply(A,E,F)| -apply(B,E,G)|F=G.
% 1.98/2.15 ** KEPT (pick-wt=16): 48 [] e_qual_maps(A,B,C,D)|$f15(A,B,C,D)!=$f14(A,B,C,D).
% 1.98/2.15 ** KEPT (pick-wt=10): 49 [] -identity(A,B)| -member(C,B)|apply(A,C,C).
% 1.98/2.15 ** KEPT (pick-wt=11): 50 [] identity(A,B)| -apply(A,$f17(A,B),$f17(A,B)).
% 1.98/2.15 ** KEPT (pick-wt=24): 51 [] -injective(A,B,C)| -member(D,B)| -member(E,B)| -member(F,C)| -apply(A,D,F)| -apply(A,E,F)|D=E.
% 1.98/2.15 ** KEPT (pick-wt=13): 52 [] injective(A,B,C)|$f20(A,B,C)!=$f19(A,B,C).
% 1.98/2.15 ** KEPT (pick-wt=14): 53 [] -surjective(A,B,C)| -member(D,C)|member($f21(A,B,C,D),B).
% 1.98/2.15 ** KEPT (pick-wt=15): 54 [] -surjective(A,B,C)| -member(D,C)|apply(A,$f21(A,B,C,D),D).
% 1.98/2.15 ** KEPT (pick-wt=14): 55 [] surjective(A,B,C)| -member(D,B)| -apply(A,D,$f22(A,B,C)).
% 1.98/2.15 ** KEPT (pick-wt=8): 56 [] -one_to_one(A,B,C)|injective(A,B,C).
% 1.98/2.15 ** KEPT (pick-wt=8): 57 [] -one_to_one(A,B,C)|surjective(A,B,C).
% 1.98/2.15 ** KEPT (pick-wt=12): 58 [] one_to_one(A,B,C)| -injective(A,B,C)| -surjective(A,B,C).
% 1.98/2.15 ** KEPT (pick-wt=19): 59 [] -inverse_predicate(A,B,C,D)| -member(E,C)| -member(F,D)| -apply(B,E,F)|apply(A,F,E).
% 1.98/2.15 ** KEPT (pick-wt=19): 60 [] -inverse_predicate(A,B,C,D)| -member(E,C)| -member(F,D)|apply(B,E,F)| -apply(A,F,E).
% 1.98/2.15 ** KEPT (pick-wt=29): 61 [] inverse_predicate(A,B,C,D)| -apply(B,$f24(A,B,C,D),$f23(A,B,C,D))| -apply(A,$f23(A,B,C,D),$f24(A,B,C,D)).
% 1.98/2.15 ** KEPT (pick-wt=17): 62 [] -member(A,B)| -member(C,D)| -apply(E,A,C)|apply(inverse_function(E,B,D),C,A).
% 1.98/2.15 ** KEPT (pick-wt=17): 63 [] -member(A,B)| -member(C,D)|apply(E,A,C)| -apply(inverse_function(E,B,D),C,A).
% 1.98/2.15 ** KEPT (pick-wt=11): 64 [] -member(A,image2(B,C))|member($f25(B,C,A),C).
% 1.98/2.15 ** KEPT (pick-wt=12): 65 [] -member(A,image2(B,C))|apply(B,$f25(B,C,A),A).
% 1.98/2.15 ** KEPT (pick-wt=12): 66 [] member(A,image2(B,C))| -member(D,C)| -apply(B,D,A).
% 1.98/2.15 ** KEPT (pick-wt=9): 67 [] -member(A,image3(B,C,D))|member(A,D).
% 1.98/2.15 ** KEPT (pick-wt=13): 68 [] -member(A,image3(B,C,D))|member($f26(B,C,D,A),C).
% 1.98/2.15 ** KEPT (pick-wt=14): 69 [] -member(A,image3(B,C,D))|apply(B,$f26(B,C,D,A),A).
% 1.98/2.15 ** KEPT (pick-wt=16): 70 [] member(A,image3(B,C,D))| -member(A,D)| -member(E,C)| -apply(B,E,A).
% 1.98/2.15 ** KEPT (pick-wt=11): 71 [] -member(A,inverse_image2(B,C))|member($f27(B,C,A),C).
% 1.98/2.15 ** KEPT (pick-wt=12): 72 [] -member(A,inverse_image2(B,C))|apply(B,A,$f27(B,C,A)).
% 1.98/2.15 ** KEPT (pick-wt=12): 73 [] member(A,inverse_image2(B,C))| -member(D,C)| -apply(B,A,D).
% 1.98/2.15 ** KEPT (pick-wt=9): 74 [] -member(A,inverse_image3(B,C,D))|member(A,D).
% 1.98/2.15 ** KEPT (pick-wt=13): 75 [] -member(A,inverse_image3(B,C,D))|member($f28(B,C,D,A),C).
% 1.98/2.15 ** KEPT (pick-wt=14): 76 [] -member(A,inverse_image3(B,C,D))|apply(B,A,$f28(B,C,D,A)).
% 1.98/2.15 ** KEPT (pick-wt=16): 77 [] member(A,inverse_image3(B,C,D))| -member(A,D)| -member(E,C)| -apply(B,A,E).
% 1.98/2.15 ** KEPT (pick-wt=34): 78 [] -increasing(A,B,C,D,E)| -member(F,B)| -member(G,D)| -member(H,B)| -member(I,D)| -apply(C,F,H)| -apply(A,F,G)| -apply(A,H,I)|apply(E,G,I).
% 1.98/2.15 ** KEPT (pick-wt=20): 79 [] increasing(A,B,C,D,E)| -apply(E,$f31(A,B,C,D,E),$f29(A,B,C,D,E)).
% 1.98/2.15 ** KEPT (pick-wt=34): 80 [] -decreasing(A,B,C,D,E)| -member(F,B)| -member(G,D)| -member(H,B)| -member(I,D)| -apply(C,F,H)| -apply(A,F,G)| -apply(A,H,I)|apply(E,I,G).
% 1.98/2.15 ** KEPT (pick-wt=20): 81 [] decreasing(A,B,C,D,E)| -apply(E,$f33(A,B,C,D,E),$f35(A,B,C,D,E)).
% 1.98/2.15 ** KEPT (pick-wt=10): 82 [] -isomorphism(A,B,C,D,E)|maps(A,B,D).
% 1.98/2.15 ** KEPT (pick-wt=10): 83 [] -isomorphism(A,B,C,D,E)|one_to_one(A,B,D).
% 1.98/2.15 ** KEPT (pick-wt=34): 84 [] -isomorphism(A,B,C,D,E)| -member(F,B)| -member(G,D)| -member(H,B)| -member(I,D)| -apply(A,F,G)| -apply(A,H,I)| -apply(C,F,H)|apply(E,G,I).
% 1.98/2.15 ** KEPT (pick-wt=34): 85 [] -isomorphism(A,B,C,D,E)| -member(F,B)| -member(G,D)| -member(H,B)| -member(I,D)| -apply(A,F,G)| -apply(A,H,I)|apply(C,F,H)| -apply(E,G,I).
% 1.98/2.15 ** KEPT (pick-wt=22): 86 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)|member($f40(A,B,C,D,E),B).
% 1.98/2.15 ** KEPT (pick-wt=22): 87 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)|member($f39(A,B,C,D,E),D).
% 1.98/2.15 ** KEPT (pick-wt=22): 88 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)|member($f38(A,B,C,D,E),B).
% 1.98/2.15 ** KEPT (pick-wt=22): 89 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)|member($f37(A,B,C,D,E),D).
% 1.98/2.15 ** KEPT (pick-wt=28): 90 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)|apply(A,$f40(A,B,C,D,E),$f39(A,B,C,D,E)).
% 1.98/2.15 ** KEPT (pick-wt=28): 91 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)|apply(A,$f38(A,B,C,D,E),$f37(A,B,C,D,E)).
% 1.98/2.15 ** KEPT (pick-wt=42): 92 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)|apply(C,$f40(A,B,C,D,E),$f38(A,B,C,D,E))|apply(E,$f39(A,B,C,D,E),$f37(A,B,C,D,E)).
% 1.98/2.15 ** KEPT (pick-wt=42): 93 [] isomorphism(A,B,C,D,E)| -maps(A,B,D)| -one_to_one(A,B,D)| -apply(C,$f40(A,B,C,D,E),$f38(A,B,C,D,E))| -apply(E,$f39(A,B,C,D,E),$f37(A,B,C,D,E)).
% 1.98/2.15 ** KEPT (pick-wt=5): 94 [] -e_qual_maps($c5,$c4,$c3,$c1).
% 1.98/2.15
% 1.98/2.15 ------------> process sos:
% 1.98/2.15 ** KEPT (pick-wt=3): 238 [] A=A.
% 1.98/2.15 ** KEPT (pick-wt=8): 239 [] subset(A,B)|member($f1(A,B),A).
% 1.98/2.15 ** KEPT (pick-wt=9): 240 [] member(A,product(B))|member($f3(A,B),B).
% 1.98/2.15 ** KEPT (pick-wt=16): 241 [] maps(A,B,C)|member($f5(A,B,C),B)|member($f8(A,B,C),B).
% 1.98/2.15 ** KEPT (pick-wt=16): 242 [] maps(A,B,C)|member($f5(A,B,C),B)|member($f7(A,B,C),C).
% 1.98/2.15 ** KEPT (pick-wt=16): 243 [] maps(A,B,C)|member($f5(A,B,C),B)|member($f6(A,B,C),C).
% 1.98/2.15 ** KEPT (pick-wt=20): 244 [] maps(A,B,C)|member($f5(A,B,C),B)|apply(A,$f8(A,B,C),$f7(A,B,C)).
% 1.98/2.15 ** KEPT (pick-wt=20): 245 [] maps(A,B,C)|member($f5(A,B,C),B)|apply(A,$f8(A,B,C),$f6(A,B,C)).
% 1.98/2.15 ** KEPT (pick-wt=16): 246 [] compose_predicate(A,B,C,D,E,F)|member($f12(A,B,C,D,E,F),D).
% 1.98/2.15 ** KEPT (pick-wt=16): 247 [] compose_predicate(A,B,C,D,E,F)|member($f11(A,B,C,D,E,F),F).
% 1.98/2.15 ** KEPT (pick-wt=32): 248 [] compose_predicate(A,B,C,D,E,F)|apply(A,$f12(A,B,C,D,E,F),$f11(A,B,C,D,E,F))|member($f10(A,B,C,D,E,F),E).
% 1.98/2.15 ** KEPT (pick-wt=39): 249 [] compose_predicate(A,B,C,D,E,F)|apply(A,$f12(A,B,C,D,E,F),$f11(A,B,C,D,E,F))|apply(C,$f12(A,B,C,D,E,F),$f10(A,B,C,D,E,F)).
% 1.98/2.15 ** KEPT (pick-wt=39): 250 [] compose_predicate(A,B,C,D,E,F)|apply(A,$f12(A,B,C,D,E,F),$f11(A,B,C,D,E,F))|apply(B,$f10(A,B,C,D,E,F),$f11(A,B,C,D,E,F)).
% 1.98/2.15 ** KEPT (pick-wt=12): 251 [] e_qual_maps(A,B,C,D)|member($f16(A,B,C,D),C).
% 1.98/2.15 ** KEPT (pick-wt=12): 252 [] e_qual_maps(A,B,C,D)|member($f15(A,B,C,D),D).
% 1.98/2.15 ** KEPT (pick-wt=12): 253 [] e_qual_maps(A,B,C,D)|member($f14(A,B,C,D),D).
% 1.98/2.15 ** KEPT (pick-wt=17): 254 [] e_qual_maps(A,B,C,D)|apply(A,$f16(A,B,C,D),$f15(A,B,C,D)).
% 1.98/2.15 ** KEPT (pick-wt=17): 255 [] e_qual_maps(A,B,C,D)|apply(B,$f16(A,B,C,D),$f14(A,B,C,D)).
% 1.98/2.15 ** KEPT (pick-wt=8): 256 [] identity(A,B)|member($f17(A,B),B).
% 1.98/2.15 ** KEPT (pick-wt=10): 257 [] injective(A,B,C)|member($f20(A,B,C),B).
% 1.98/2.15 ** KEPT (pick-wt=1Alarm clock
% 299.86/300.02 Otter interrupted
% 299.86/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------