TSTP Solution File: SET037-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET037-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:12:53 EDT 2022
% Result : Timeout 299.99s 300.11s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET037-4 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 10:50:51 EDT 2022
% 0.14/0.35 % CPUTime :
% 4.20/4.38 ----- Otter 3.3f, August 2004 -----
% 4.20/4.38 The process was started by sandbox on n009.cluster.edu,
% 4.20/4.38 Wed Jul 27 10:50:51 2022
% 4.20/4.38 The command was "./otter". The process ID is 25422.
% 4.20/4.38
% 4.20/4.38 set(prolog_style_variables).
% 4.20/4.38 set(auto).
% 4.20/4.38 dependent: set(auto1).
% 4.20/4.38 dependent: set(process_input).
% 4.20/4.38 dependent: clear(print_kept).
% 4.20/4.38 dependent: clear(print_new_demod).
% 4.20/4.38 dependent: clear(print_back_demod).
% 4.20/4.38 dependent: clear(print_back_sub).
% 4.20/4.38 dependent: set(control_memory).
% 4.20/4.38 dependent: assign(max_mem, 12000).
% 4.20/4.38 dependent: assign(pick_given_ratio, 4).
% 4.20/4.38 dependent: assign(stats_level, 1).
% 4.20/4.38 dependent: assign(max_seconds, 10800).
% 4.20/4.38 clear(print_given).
% 4.20/4.38
% 4.20/4.38 list(usable).
% 4.20/4.38 0 [] A=A.
% 4.20/4.38 0 [] -member(X,Y)|little_set(X).
% 4.20/4.38 0 [] little_set(f1(X,Y))|X=Y.
% 4.20/4.38 0 [] member(f1(X,Y),X)|member(f1(X,Y),Y)|X=Y.
% 4.20/4.38 0 [] -member(f1(X,Y),X)| -member(f1(X,Y),Y)|X=Y.
% 4.20/4.38 0 [] -member(U,non_ordered_pair(X,Y))|U=X|U=Y.
% 4.20/4.38 0 [] member(U,non_ordered_pair(X,Y))| -little_set(U)|U!=X.
% 4.20/4.38 0 [] member(U,non_ordered_pair(X,Y))| -little_set(U)|U!=Y.
% 4.20/4.38 0 [] little_set(non_ordered_pair(X,Y)).
% 4.20/4.38 0 [] singleton_set(X)=non_ordered_pair(X,X).
% 4.20/4.38 0 [] ordered_pair(X,Y)=non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)).
% 4.20/4.38 0 [] -ordered_pair_predicate(X)|little_set(f2(X)).
% 4.20/4.38 0 [] -ordered_pair_predicate(X)|little_set(f3(X)).
% 4.20/4.38 0 [] -ordered_pair_predicate(X)|X=ordered_pair(f2(X),f3(X)).
% 4.20/4.38 0 [] ordered_pair_predicate(X)| -little_set(Y)| -little_set(Z)|X!=ordered_pair(Y,Z).
% 4.20/4.38 0 [] -member(Z,first(X))|little_set(f4(Z,X)).
% 4.20/4.38 0 [] -member(Z,first(X))|little_set(f5(Z,X)).
% 4.20/4.38 0 [] -member(Z,first(X))|X=ordered_pair(f4(Z,X),f5(Z,X)).
% 4.20/4.38 0 [] -member(Z,first(X))|member(Z,f4(Z,X)).
% 4.20/4.38 0 [] member(Z,first(X))| -little_set(U)| -little_set(V)|X!=ordered_pair(U,V)| -member(Z,U).
% 4.20/4.38 0 [] -member(Z,second(X))|little_set(f6(Z,X)).
% 4.20/4.38 0 [] -member(Z,second(X))|little_set(f7(Z,X)).
% 4.20/4.38 0 [] -member(Z,second(X))|X=ordered_pair(f6(Z,X),f7(Z,X)).
% 4.20/4.38 0 [] -member(Z,second(X))|member(Z,f7(Z,X)).
% 4.20/4.38 0 [] member(Z,second(X))| -little_set(U)| -little_set(V)|X!=ordered_pair(U,V)| -member(Z,V).
% 4.20/4.38 0 [] -member(Z,estin)|ordered_pair_predicate(Z).
% 4.20/4.38 0 [] -member(Z,estin)|member(first(Z),second(Z)).
% 4.20/4.38 0 [] member(Z,estin)| -little_set(Z)| -ordered_pair_predicate(Z)| -member(first(Z),second(Z)).
% 4.20/4.38 0 [] -member(Z,intersection(X,Y))|member(Z,X).
% 4.20/4.38 0 [] -member(Z,intersection(X,Y))|member(Z,Y).
% 4.20/4.38 0 [] member(Z,intersection(X,Y))| -member(Z,X)| -member(Z,Y).
% 4.20/4.38 0 [] -member(Z,complement(X))| -member(Z,X).
% 4.20/4.38 0 [] member(Z,complement(X))| -little_set(Z)|member(Z,X).
% 4.20/4.38 0 [] union(X,Y)=complement(intersection(complement(X),complement(Y))).
% 4.20/4.38 0 [] -member(Z,domain_of(X))|ordered_pair_predicate(f8(Z,X)).
% 4.20/4.38 0 [] -member(Z,domain_of(X))|member(f8(Z,X),X).
% 4.20/4.38 0 [] -member(Z,domain_of(X))|Z=first(f8(Z,X)).
% 4.20/4.38 0 [] member(Z,domain_of(X))| -little_set(Z)| -ordered_pair_predicate(Xp)| -member(Xp,X)|Z!=first(Xp).
% 4.20/4.38 0 [] -member(Z,cross_product(X,Y))|ordered_pair_predicate(Z).
% 4.20/4.38 0 [] -member(Z,cross_product(X,Y))|member(first(Z),X).
% 4.20/4.38 0 [] -member(Z,cross_product(X,Y))|member(second(Z),Y).
% 4.20/4.38 0 [] member(Z,cross_product(X,Y))| -little_set(Z)| -ordered_pair_predicate(Z)| -member(first(Z),X)| -member(second(Z),Y).
% 4.20/4.38 0 [] -member(Z,converse(X))|ordered_pair_predicate(Z).
% 4.20/4.38 0 [] -member(Z,converse(X))|member(ordered_pair(second(Z),first(Z)),X).
% 4.20/4.38 0 [] member(Z,converse(X))| -little_set(Z)| -ordered_pair_predicate(Z)| -member(ordered_pair(second(Z),first(Z)),X).
% 4.20/4.38 0 [] -member(Z,rotate_right(X))|little_set(f9(Z,X)).
% 4.20/4.38 0 [] -member(Z,rotate_right(X))|little_set(f10(Z,X)).
% 4.20/4.38 0 [] -member(Z,rotate_right(X))|little_set(f11(Z,X)).
% 4.20/4.38 0 [] -member(Z,rotate_right(X))|Z=ordered_pair(f9(Z,X),ordered_pair(f10(Z,X),f11(Z,X))).
% 4.20/4.38 0 [] -member(Z,rotate_right(X))|member(ordered_pair(f10(Z,X),ordered_pair(f11(Z,X),f9(Z,X))),X).
% 4.20/4.38 0 [] member(Z,rotate_right(X))| -little_set(Z)| -little_set(U)| -little_set(V)| -little_set(W)|Z!=ordered_pair(U,ordered_pair(V,W))| -member(ordered_pair(V,ordered_pair(W,U)),X).
% 4.20/4.38 0 [] -member(Z,flip_range_of(X))|little_set(f12(Z,X)).
% 4.20/4.38 0 [] -member(Z,flip_range_of(X))|little_set(f13(Z,X)).
% 4.20/4.38 0 [] -member(Z,flip_range_of(X))|little_set(f14(Z,X)).
% 4.20/4.38 0 [] -member(Z,flip_range_of(X))|Z=ordered_pair(f12(Z,X),ordered_pair(f13(Z,X),f14(Z,X))).
% 4.20/4.38 0 [] -member(Z,flip_range_of(X))|member(ordered_pair(f12(Z,X),ordered_pair(f14(Z,X),f13(Z,X))),X).
% 4.20/4.38 0 [] member(Z,flip_range_of(X))| -little_set(Z)| -little_set(U)| -little_set(V)| -little_set(W)|Z!=ordered_pair(U,ordered_pair(V,W))| -member(ordered_pair(U,ordered_pair(W,V)),X).
% 4.20/4.38 0 [] successor(X)=union(X,singleton_set(X)).
% 4.20/4.38 0 [] -member(Z,empty_set).
% 4.20/4.38 0 [] member(Z,universal_set)| -little_set(Z).
% 4.20/4.38 0 [] little_set(infinity).
% 4.20/4.38 0 [] member(empty_set,infinity).
% 4.20/4.38 0 [] -member(X,infinity)|member(successor(X),infinity).
% 4.20/4.38 0 [] -member(Z,sigma(X))|member(f16(Z,X),X).
% 4.20/4.38 0 [] -member(Z,sigma(X))|member(Z,f16(Z,X)).
% 4.20/4.38 0 [] member(Z,sigma(X))| -member(Y,X)| -member(Z,Y).
% 4.20/4.38 0 [] -little_set(U)|little_set(sigma(U)).
% 4.20/4.38 0 [] -subset(X,Y)| -member(U,X)|member(U,Y).
% 4.20/4.38 0 [] subset(X,Y)|member(f17(X,Y),X).
% 4.20/4.38 0 [] subset(X,Y)| -member(f17(X,Y),Y).
% 4.20/4.38 0 [] -proper_subset(X,Y)|subset(X,Y).
% 4.20/4.38 0 [] -proper_subset(X,Y)|X!=Y.
% 4.20/4.38 0 [] proper_subset(X,Y)| -subset(X,Y)|X=Y.
% 4.20/4.38 0 [] -member(Z,powerset(X))|subset(Z,X).
% 4.20/4.38 0 [] member(Z,powerset(X))| -little_set(Z)| -subset(Z,X).
% 4.20/4.38 0 [] -little_set(U)|little_set(powerset(U)).
% 4.20/4.38 0 [] -relation(Z)| -member(X,Z)|ordered_pair_predicate(X).
% 4.20/4.38 0 [] relation(Z)|member(f18(Z),Z).
% 4.20/4.38 0 [] relation(Z)| -ordered_pair_predicate(f18(Z)).
% 4.20/4.38 0 [] -single_valued_set(X)| -little_set(U)| -little_set(V)| -little_set(W)| -member(ordered_pair(U,V),X)| -member(ordered_pair(U,W),X)|V=W.
% 4.20/4.38 0 [] single_valued_set(X)|little_set(f19(X)).
% 4.20/4.38 0 [] single_valued_set(X)|little_set(f20(X)).
% 4.20/4.38 0 [] single_valued_set(X)|little_set(f21(X)).
% 4.20/4.38 0 [] single_valued_set(X)|member(ordered_pair(f19(X),f20(X)),X).
% 4.20/4.38 0 [] single_valued_set(X)|member(ordered_pair(f19(X),f21(X)),X).
% 4.20/4.38 0 [] single_valued_set(X)|f20(X)!=f21(X).
% 4.20/4.38 0 [] -function(Xf)|relation(Xf).
% 4.20/4.38 0 [] -function(Xf)|single_valued_set(Xf).
% 4.20/4.38 0 [] function(Xf)| -relation(Xf)| -single_valued_set(Xf).
% 4.20/4.38 0 [] -member(Z,image(X,Xf))|ordered_pair_predicate(f22(Z,X,Xf)).
% 4.20/4.38 0 [] -member(Z,image(X,Xf))|member(f22(Z,X,Xf),Xf).
% 4.20/4.38 0 [] -member(Z,image(X,Xf))|member(first(f22(Z,X,Xf)),X).
% 4.20/4.38 0 [] -member(Z,image(X,Xf))|second(f22(Z,X,Xf))=Z.
% 4.20/4.38 0 [] member(Z,image(X,Xf))| -little_set(Z)| -ordered_pair_predicate(Y)| -member(Y,Xf)| -member(first(Y),X)|second(Y)!=Z.
% 4.20/4.38 0 [] -little_set(X)| -function(Xf)|little_set(image(X,Xf)).
% 4.20/4.38 0 [] -disjoint(X,Y)| -member(U,X)| -member(U,Y).
% 4.20/4.38 0 [] disjoint(X,Y)|member(f23(X,Y),X).
% 4.20/4.38 0 [] disjoint(X,Y)|member(f23(X,Y),Y).
% 4.20/4.38 0 [] X=empty_set|member(f24(X),X).
% 4.20/4.38 0 [] X=empty_set|disjoint(f24(X),X).
% 4.20/4.38 0 [] function(f25).
% 4.20/4.38 0 [] -little_set(X)|X=empty_set|member(f26(X),X).
% 4.20/4.38 0 [] -little_set(X)|X=empty_set|member(ordered_pair(X,f26(X)),f25).
% 4.20/4.38 0 [] -member(Z,range_of(X))|ordered_pair_predicate(f27(Z,X)).
% 4.20/4.38 0 [] -member(Z,range_of(X))|member(f27(Z,X),X).
% 4.20/4.38 0 [] -member(Z,range_of(X))|Z=second(f27(Z,X)).
% 4.20/4.38 0 [] member(Z,range_of(X))| -little_set(Z)| -ordered_pair_predicate(Xp)| -member(Xp,X)|Z!=second(Xp).
% 4.20/4.38 0 [] -member(Z,identity_relation)|ordered_pair_predicate(Z).
% 4.20/4.38 0 [] -member(Z,identity_relation)|first(Z)=second(Z).
% 4.20/4.38 0 [] member(Z,identity_relation)| -little_set(Z)| -ordered_pair_predicate(Z)|first(Z)!=second(Z).
% 4.20/4.38 0 [] restrict(X,Y)=intersection(X,cross_product(Y,universal_set)).
% 4.20/4.38 0 [] -one_to_one_function(Xf)|function(Xf).
% 4.20/4.38 0 [] -one_to_one_function(Xf)|function(converse(Xf)).
% 4.20/4.38 0 [] one_to_one_function(Xf)| -function(Xf)| -function(converse(Xf)).
% 4.20/4.38 0 [] -member(Z,apply(Xf,Y))|ordered_pair_predicate(f28(Z,Xf,Y)).
% 4.20/4.38 0 [] -member(Z,apply(Xf,Y))|member(f28(Z,Xf,Y),Xf).
% 4.20/4.38 0 [] -member(Z,apply(Xf,Y))|first(f28(Z,Xf,Y))=Y.
% 4.20/4.38 0 [] -member(Z,apply(Xf,Y))|member(Z,second(f28(Z,Xf,Y))).
% 4.20/4.38 0 [] member(Z,apply(Xf,Y))| -ordered_pair_predicate(W)| -member(W,Xf)|first(W)!=Y| -member(Z,second(W)).
% 4.20/4.38 0 [] apply_to_two_arguments(Xf,X,Y)=apply(Xf,ordered_pair(X,Y)).
% 4.20/4.38 0 [] -maps(Xf,X,Y)|function(Xf).
% 4.20/4.38 0 [] -maps(Xf,X,Y)|domain_of(Xf)=X.
% 4.20/4.38 0 [] -maps(Xf,X,Y)|subset(range_of(Xf),Y).
% 4.20/4.38 0 [] maps(Xf,X,Y)| -function(Xf)|domain_of(Xf)!=X| -subset(range_of(Xf),Y).
% 4.20/4.38 0 [] -closed(Xs,Xf)|little_set(Xs).
% 4.20/4.38 0 [] -closed(Xs,Xf)|little_set(Xf).
% 4.20/4.38 0 [] -closed(Xs,Xf)|maps(Xf,cross_product(Xs,Xs),Xs).
% 4.20/4.38 0 [] closed(Xs,Xf)| -little_set(Xs)| -little_set(Xf)| -maps(Xf,cross_product(Xs,Xs),Xs).
% 4.20/4.38 0 [] -member(Z,compose(Xf,Xg))|little_set(f29(Z,Xf,Xg)).
% 4.20/4.38 0 [] -member(Z,compose(Xf,Xg))|little_set(f30(Z,Xf,Xg)).
% 4.20/4.39 0 [] -member(Z,compose(Xf,Xg))|little_set(f31(Z,Xf,Xg)).
% 4.20/4.39 0 [] -member(Z,compose(Xf,Xg))|Z=ordered_pair(f29(Z,Xf,Xg),f30(Z,Xf,Xg)).
% 4.20/4.39 0 [] -member(Z,compose(Xf,Xg))|member(ordered_pair(f29(Z,Xf,Xg),f31(Z,Xf,Xg)),Xf).
% 4.20/4.39 0 [] -member(Z,compose(Xf,Xg))|member(ordered_pair(f31(Z,Xf,Xg),f30(Z,Xf,Xg)),Xg).
% 4.20/4.39 0 [] member(Z,compose(Xf,Xg))| -little_set(Z)| -little_set(X)| -little_set(Y)| -little_set(W)|Z!=ordered_pair(X,Y)| -member(ordered_pair(X,W),Xf)| -member(ordered_pair(W,Y),Xg).
% 4.20/4.39 0 [] -homomorphism(Xh,Xs1,Xf1,Xs2,Xf2)|closed(Xs1,Xf1).
% 4.20/4.39 0 [] -homomorphism(Xh,Xs1,Xf1,Xs2,Xf2)|closed(Xs2,Xf2).
% 4.20/4.39 0 [] -homomorphism(Xh,Xs1,Xf1,Xs2,Xf2)|maps(Xh,Xs1,Xs2).
% 4.20/4.39 0 [] -homomorphism(Xh,Xs1,Xf1,Xs2,Xf2)| -member(X,Xs1)| -member(Y,Xs1)|apply(Xh,apply_to_two_arguments(Xf1,X,Y))=apply_to_two_arguments(Xf2,apply(Xh,X),apply(Xh,Y)).
% 4.20/4.39 0 [] homomorphism(Xh,Xs1,Xf1,Xs2,Xf2)| -closed(Xs1,Xf1)| -closed(Xs2,Xf2)| -maps(Xh,Xs1,Xs2)|member(f32(Xh,Xs1,Xf1,Xs2,Xf2),Xs1).
% 4.20/4.39 0 [] homomorphism(Xh,Xs1,Xf1,Xs2,Xf2)| -closed(Xs1,Xf1)| -closed(Xs2,Xf2)| -maps(Xh,Xs1,Xs2)|member(f33(Xh,Xs1,Xf1,Xs2,Xf2),Xs1).
% 4.20/4.39 0 [] homomorphism(Xh,Xs1,Xf1,Xs2,Xf2)| -closed(Xs1,Xf1)| -closed(Xs2,Xf2)| -maps(Xh,Xs1,Xs2)|apply(Xh,apply_to_two_arguments(Xf1,f32(Xh,Xs1,Xf1,Xs2,Xf2),f33(Xh,Xs1,Xf1,Xs2,Xf2)))!=apply_to_two_arguments(Xf2,apply(Xh,f32(Xh,Xs1,Xf1,Xs2,Xf2)),apply(Xh,f33(Xh,Xs1,Xf1,Xs2,Xf2))).
% 4.20/4.39 0 [] function(a_function).
% 4.20/4.39 0 [] member(a,domain_of(a_function)).
% 4.20/4.39 0 [] apply(a_function,a)=b.
% 4.20/4.39 0 [] -member(ordered_pair(a,b),a_function).
% 4.20/4.39 end_of_list.
% 4.20/4.39
% 4.20/4.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 4.20/4.39
% 4.20/4.39 This ia a non-Horn set with equality. The strategy will be
% 4.20/4.39 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 4.20/4.39 deletion, with positive clauses in sos and nonpositive
% 4.20/4.39 clauses in usable.
% 4.20/4.39
% 4.20/4.39 dependent: set(knuth_bendix).
% 4.20/4.39 dependent: set(anl_eq).
% 4.20/4.39 dependent: set(para_from).
% 4.20/4.39 dependent: set(para_into).
% 4.20/4.39 dependent: clear(para_from_right).
% 4.20/4.39 dependent: clear(para_into_right).
% 4.20/4.39 dependent: set(para_from_vars).
% 4.20/4.39 dependent: set(eq_units_both_ways).
% 4.20/4.39 dependent: set(dynamic_demod_all).
% 4.20/4.39 dependent: set(dynamic_demod).
% 4.20/4.39 dependent: set(order_eq).
% 4.20/4.39 dependent: set(back_demod).
% 4.20/4.39 dependent: set(lrpo).
% 4.20/4.39 dependent: set(hyper_res).
% 4.20/4.39 dependent: set(unit_deletion).
% 4.20/4.39 dependent: set(factor).
% 4.20/4.39
% 4.20/4.39 ------------> process usable:
% 4.20/4.39 ** KEPT (pick-wt=5): 1 [] -member(A,B)|little_set(A).
% 4.20/4.39 ** KEPT (pick-wt=13): 2 [] -member(f1(A,B),A)| -member(f1(A,B),B)|A=B.
% 4.20/4.39 ** KEPT (pick-wt=11): 3 [] -member(A,non_ordered_pair(B,C))|A=B|A=C.
% 4.20/4.39 ** KEPT (pick-wt=10): 4 [] member(A,non_ordered_pair(B,C))| -little_set(A)|A!=B.
% 4.20/4.39 ** KEPT (pick-wt=10): 5 [] member(A,non_ordered_pair(B,C))| -little_set(A)|A!=C.
% 4.20/4.39 ** KEPT (pick-wt=5): 6 [] -ordered_pair_predicate(A)|little_set(f2(A)).
% 4.20/4.39 ** KEPT (pick-wt=5): 7 [] -ordered_pair_predicate(A)|little_set(f3(A)).
% 4.20/4.39 ** KEPT (pick-wt=9): 9 [copy,8,flip.2] -ordered_pair_predicate(A)|ordered_pair(f2(A),f3(A))=A.
% 4.20/4.39 ** KEPT (pick-wt=11): 10 [] ordered_pair_predicate(A)| -little_set(B)| -little_set(C)|A!=ordered_pair(B,C).
% 4.20/4.39 ** KEPT (pick-wt=8): 11 [] -member(A,first(B))|little_set(f4(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=8): 12 [] -member(A,first(B))|little_set(f5(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=13): 14 [copy,13,flip.2] -member(A,first(B))|ordered_pair(f4(A,B),f5(A,B))=B.
% 4.20/4.39 ** KEPT (pick-wt=9): 15 [] -member(A,first(B))|member(A,f4(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=16): 16 [] member(A,first(B))| -little_set(C)| -little_set(D)|B!=ordered_pair(C,D)| -member(A,C).
% 4.20/4.39 ** KEPT (pick-wt=8): 17 [] -member(A,second(B))|little_set(f6(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=8): 18 [] -member(A,second(B))|little_set(f7(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=13): 20 [copy,19,flip.2] -member(A,second(B))|ordered_pair(f6(A,B),f7(A,B))=B.
% 4.20/4.39 ** KEPT (pick-wt=9): 21 [] -member(A,second(B))|member(A,f7(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=16): 22 [] member(A,second(B))| -little_set(C)| -little_set(D)|B!=ordered_pair(C,D)| -member(A,D).
% 4.20/4.39 ** KEPT (pick-wt=5): 23 [] -member(A,estin)|ordered_pair_predicate(A).
% 4.20/4.39 ** KEPT (pick-wt=8): 24 [] -member(A,estin)|member(first(A),second(A)).
% 4.20/4.39 ** KEPT (pick-wt=12): 25 [] member(A,estin)| -little_set(A)| -ordered_pair_predicate(A)| -member(first(A),second(A)).
% 4.20/4.39 ** KEPT (pick-wt=8): 26 [] -member(A,intersection(B,C))|member(A,B).
% 4.20/4.39 ** KEPT (pick-wt=8): 27 [] -member(A,intersection(B,C))|member(A,C).
% 4.20/4.39 ** KEPT (pick-wt=11): 28 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 4.20/4.39 ** KEPT (pick-wt=7): 29 [] -member(A,complement(B))| -member(A,B).
% 4.20/4.39 ** KEPT (pick-wt=9): 30 [] member(A,complement(B))| -little_set(A)|member(A,B).
% 4.20/4.39 ** KEPT (pick-wt=8): 31 [] -member(A,domain_of(B))|ordered_pair_predicate(f8(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=9): 32 [] -member(A,domain_of(B))|member(f8(A,B),B).
% 4.20/4.39 ** KEPT (pick-wt=10): 34 [copy,33,flip.2] -member(A,domain_of(B))|first(f8(A,B))=A.
% 4.20/4.39 ** KEPT (pick-wt=15): 35 [] member(A,domain_of(B))| -little_set(A)| -ordered_pair_predicate(C)| -member(C,B)|A!=first(C).
% 4.20/4.39 ** KEPT (pick-wt=7): 36 [] -member(A,cross_product(B,C))|ordered_pair_predicate(A).
% 4.20/4.39 ** KEPT (pick-wt=9): 37 [] -member(A,cross_product(B,C))|member(first(A),B).
% 4.20/4.39 ** KEPT (pick-wt=9): 38 [] -member(A,cross_product(B,C))|member(second(A),C).
% 4.20/4.39 ** KEPT (pick-wt=17): 39 [] member(A,cross_product(B,C))| -little_set(A)| -ordered_pair_predicate(A)| -member(first(A),B)| -member(second(A),C).
% 4.20/4.39 ** KEPT (pick-wt=6): 40 [] -member(A,converse(B))|ordered_pair_predicate(A).
% 4.20/4.39 ** KEPT (pick-wt=11): 41 [] -member(A,converse(B))|member(ordered_pair(second(A),first(A)),B).
% 4.20/4.39 ** KEPT (pick-wt=15): 42 [] member(A,converse(B))| -little_set(A)| -ordered_pair_predicate(A)| -member(ordered_pair(second(A),first(A)),B).
% 4.20/4.39 ** KEPT (pick-wt=8): 43 [] -member(A,rotate_right(B))|little_set(f9(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=8): 44 [] -member(A,rotate_right(B))|little_set(f10(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=8): 45 [] -member(A,rotate_right(B))|little_set(f11(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=17): 47 [copy,46,flip.2] -member(A,rotate_right(B))|ordered_pair(f9(A,B),ordered_pair(f10(A,B),f11(A,B)))=A.
% 4.20/4.39 ** KEPT (pick-wt=17): 48 [] -member(A,rotate_right(B))|member(ordered_pair(f10(A,B),ordered_pair(f11(A,B),f9(A,B))),B).
% 4.20/4.39 ** KEPT (pick-wt=26): 49 [] member(A,rotate_right(B))| -little_set(A)| -little_set(C)| -little_set(D)| -little_set(E)|A!=ordered_pair(C,ordered_pair(D,E))| -member(ordered_pair(D,ordered_pair(E,C)),B).
% 4.20/4.39 ** KEPT (pick-wt=8): 50 [] -member(A,flip_range_of(B))|little_set(f12(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=8): 51 [] -member(A,flip_range_of(B))|little_set(f13(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=8): 52 [] -member(A,flip_range_of(B))|little_set(f14(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=17): 54 [copy,53,flip.2] -member(A,flip_range_of(B))|ordered_pair(f12(A,B),ordered_pair(f13(A,B),f14(A,B)))=A.
% 4.20/4.39 ** KEPT (pick-wt=17): 55 [] -member(A,flip_range_of(B))|member(ordered_pair(f12(A,B),ordered_pair(f14(A,B),f13(A,B))),B).
% 4.20/4.39 ** KEPT (pick-wt=26): 56 [] member(A,flip_range_of(B))| -little_set(A)| -little_set(C)| -little_set(D)| -little_set(E)|A!=ordered_pair(C,ordered_pair(D,E))| -member(ordered_pair(C,ordered_pair(E,D)),B).
% 4.20/4.39 ** KEPT (pick-wt=3): 57 [] -member(A,empty_set).
% 4.20/4.39 ** KEPT (pick-wt=5): 58 [] member(A,universal_set)| -little_set(A).
% 4.20/4.39 ** KEPT (pick-wt=7): 59 [] -member(A,infinity)|member(successor(A),infinity).
% 4.20/4.39 ** KEPT (pick-wt=9): 60 [] -member(A,sigma(B))|member(f16(A,B),B).
% 4.20/4.39 ** KEPT (pick-wt=9): 61 [] -member(A,sigma(B))|member(A,f16(A,B)).
% 4.20/4.39 ** KEPT (pick-wt=10): 62 [] member(A,sigma(B))| -member(C,B)| -member(A,C).
% 4.20/4.39 ** KEPT (pick-wt=5): 63 [] -little_set(A)|little_set(sigma(A)).
% 4.20/4.39 ** KEPT (pick-wt=9): 64 [] -subset(A,B)| -member(C,A)|member(C,B).
% 4.20/4.39 ** KEPT (pick-wt=8): 65 [] subset(A,B)| -member(f17(A,B),B).
% 4.20/4.39 ** KEPT (pick-wt=6): 66 [] -proper_subset(A,B)|subset(A,B).
% 4.20/4.39 ** KEPT (pick-wt=6): 67 [] -proper_subset(A,B)|A!=B.
% 4.20/4.39 ** KEPT (pick-wt=9): 68 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 4.20/4.39 ** KEPT (pick-wt=7): 69 [] -member(A,powerset(B))|subset(A,B).
% 4.20/4.39 ** KEPT (pick-wt=9): 70 [] member(A,powerset(B))| -little_set(A)| -subset(A,B).
% 4.20/4.39 ** KEPT (pick-wt=5): 71 [] -little_set(A)|little_set(powerset(A)).
% 4.20/4.39 ** KEPT (pick-wt=7): 72 [] -relation(A)| -member(B,A)|ordered_pair_predicate(B).
% 4.20/4.39 ** KEPT (pick-wt=5): 73 [] relation(A)| -ordered_pair_predicate(f18(A)).
% 4.20/4.39 ** KEPT (pick-wt=21): 74 [] -single_valued_set(A)| -little_set(B)| -little_set(C)| -little_set(D)| -member(ordered_pair(B,C),A)| -member(ordered_pair(B,D),A)|C=D.
% 4.20/4.40 ** KEPT (pick-wt=7): 76 [copy,75,flip.2] single_valued_set(A)|f21(A)!=f20(A).
% 4.20/4.40 ** KEPT (pick-wt=4): 77 [] -function(A)|relation(A).
% 4.20/4.40 ** KEPT (pick-wt=4): 78 [] -function(A)|single_valued_set(A).
% 4.20/4.40 ** KEPT (pick-wt=6): 79 [] function(A)| -relation(A)| -single_valued_set(A).
% 4.20/4.40 ** KEPT (pick-wt=10): 80 [] -member(A,image(B,C))|ordered_pair_predicate(f22(A,B,C)).
% 4.20/4.40 ** KEPT (pick-wt=11): 81 [] -member(A,image(B,C))|member(f22(A,B,C),C).
% 4.20/4.40 ** KEPT (pick-wt=12): 82 [] -member(A,image(B,C))|member(first(f22(A,B,C)),B).
% 4.20/4.40 ** KEPT (pick-wt=12): 83 [] -member(A,image(B,C))|second(f22(A,B,C))=A.
% 4.20/4.40 ** KEPT (pick-wt=20): 84 [] member(A,image(B,C))| -little_set(A)| -ordered_pair_predicate(D)| -member(D,C)| -member(first(D),B)|second(D)!=A.
% 4.20/4.40 ** KEPT (pick-wt=8): 85 [] -little_set(A)| -function(B)|little_set(image(A,B)).
% 4.20/4.40 ** KEPT (pick-wt=9): 86 [] -disjoint(A,B)| -member(C,A)| -member(C,B).
% 4.20/4.40 ** KEPT (pick-wt=9): 87 [] -little_set(A)|A=empty_set|member(f26(A),A).
% 4.20/4.40 ** KEPT (pick-wt=11): 88 [] -little_set(A)|A=empty_set|member(ordered_pair(A,f26(A)),f25).
% 4.20/4.40 ** KEPT (pick-wt=8): 89 [] -member(A,range_of(B))|ordered_pair_predicate(f27(A,B)).
% 4.20/4.40 ** KEPT (pick-wt=9): 90 [] -member(A,range_of(B))|member(f27(A,B),B).
% 4.20/4.40 ** KEPT (pick-wt=10): 92 [copy,91,flip.2] -member(A,range_of(B))|second(f27(A,B))=A.
% 4.20/4.40 ** KEPT (pick-wt=15): 93 [] member(A,range_of(B))| -little_set(A)| -ordered_pair_predicate(C)| -member(C,B)|A!=second(C).
% 4.20/4.40 ** KEPT (pick-wt=5): 94 [] -member(A,identity_relation)|ordered_pair_predicate(A).
% 4.20/4.40 ** KEPT (pick-wt=8): 96 [copy,95,flip.2] -member(A,identity_relation)|second(A)=first(A).
% 4.20/4.40 ** KEPT (pick-wt=12): 98 [copy,97,flip.4] member(A,identity_relation)| -little_set(A)| -ordered_pair_predicate(A)|second(A)!=first(A).
% 4.20/4.40 ** KEPT (pick-wt=4): 99 [] -one_to_one_function(A)|function(A).
% 4.20/4.40 ** KEPT (pick-wt=5): 100 [] -one_to_one_function(A)|function(converse(A)).
% 4.20/4.40 ** KEPT (pick-wt=7): 101 [] one_to_one_function(A)| -function(A)| -function(converse(A)).
% 4.20/4.40 ** KEPT (pick-wt=10): 102 [] -member(A,apply(B,C))|ordered_pair_predicate(f28(A,B,C)).
% 4.20/4.40 ** KEPT (pick-wt=11): 103 [] -member(A,apply(B,C))|member(f28(A,B,C),B).
% 4.20/4.40 ** KEPT (pick-wt=12): 104 [] -member(A,apply(B,C))|first(f28(A,B,C))=C.
% 4.20/4.40 ** KEPT (pick-wt=12): 105 [] -member(A,apply(B,C))|member(A,second(f28(A,B,C))).
% 4.20/4.40 ** KEPT (pick-wt=18): 106 [] member(A,apply(B,C))| -ordered_pair_predicate(D)| -member(D,B)|first(D)!=C| -member(A,second(D)).
% 4.20/4.40 ** KEPT (pick-wt=6): 107 [] -maps(A,B,C)|function(A).
% 4.20/4.40 ** KEPT (pick-wt=8): 108 [] -maps(A,B,C)|domain_of(A)=B.
% 4.20/4.40 ** KEPT (pick-wt=8): 109 [] -maps(A,B,C)|subset(range_of(A),C).
% 4.20/4.40 ** KEPT (pick-wt=14): 110 [] maps(A,B,C)| -function(A)|domain_of(A)!=B| -subset(range_of(A),C).
% 4.20/4.40 ** KEPT (pick-wt=5): 111 [] -closed(A,B)|little_set(A).
% 4.20/4.40 ** KEPT (pick-wt=5): 112 [] -closed(A,B)|little_set(B).
% 4.20/4.40 ** KEPT (pick-wt=9): 113 [] -closed(A,B)|maps(B,cross_product(A,A),A).
% 4.20/4.40 ** KEPT (pick-wt=13): 114 [] closed(A,B)| -little_set(A)| -little_set(B)| -maps(B,cross_product(A,A),A).
% 4.20/4.40 ** KEPT (pick-wt=10): 115 [] -member(A,compose(B,C))|little_set(f29(A,B,C)).
% 4.20/4.40 ** KEPT (pick-wt=10): 116 [] -member(A,compose(B,C))|little_set(f30(A,B,C)).
% 4.20/4.40 ** KEPT (pick-wt=10): 117 [] -member(A,compose(B,C))|little_set(f31(A,B,C)).
% 4.20/4.40 ** KEPT (pick-wt=16): 119 [copy,118,flip.2] -member(A,compose(B,C))|ordered_pair(f29(A,B,C),f30(A,B,C))=A.
% 4.20/4.40 ** KEPT (pick-wt=16): 120 [] -member(A,compose(B,C))|member(ordered_pair(f29(A,B,C),f31(A,B,C)),B).
% 4.20/4.40 ** KEPT (pick-wt=16): 121 [] -member(A,compose(B,C))|member(ordered_pair(f31(A,B,C),f30(A,B,C)),C).
% 4.20/4.40 ** KEPT (pick-wt=28): 122 [] member(A,compose(B,C))| -little_set(A)| -little_set(D)| -little_set(E)| -little_set(F)|A!=ordered_pair(D,E)| -member(ordered_pair(D,F),B)| -member(ordered_pair(F,E),C).
% 4.20/4.40 ** KEPT (pick-wt=9): 123 [] -homomorphism(A,B,C,D,E)|closed(B,C).
% 4.20/4.40 ** KEPT (pick-wt=9): 124 [] -homomorphism(A,B,C,D,E)|closed(D,E).
% 4.20/4.40 ** KEPT (pick-wt=10): 125 [] -homomorphism(A,B,C,D,E)|maps(A,B,D).
% 4.20/4.40 ** KEPT (pick-wt=27): 126 [] -homomorphism(A,B,C,D,E)| -member(F,B)| -member(G,B)|apply(A,apply_to_two_arguments(C,F,G))=apply_to_two_arguments(E,apply(A,F),apply(A,G)).
% 4.20/4.40 ** KEPT (pick-wt=24): 127 [] homomorphism(A,B,C,D,E)| -closed(B,C)| -closed(D,E)| -maps(A,B,D)|member(f32(A,B,C,D,E),B).
% 4.20/4.41 ** KEPT (pick-wt=24): 128 [] homomorphism(A,B,C,D,E)| -closed(B,C)| -closed(D,E)| -maps(A,B,D)|member(f33(A,B,C,D,E),B).
% 4.20/4.41 ** KEPT (pick-wt=51): 129 [] homomorphism(A,B,C,D,E)| -closed(B,C)| -closed(D,E)| -maps(A,B,D)|apply(A,apply_to_two_arguments(C,f32(A,B,C,D,E),f33(A,B,C,D,E)))!=apply_to_two_arguments(E,apply(A,f32(A,B,C,D,E)),apply(A,f33(A,B,C,D,E))).
% 4.20/4.41 ** KEPT (pick-wt=5): 130 [] -member(ordered_pair(a,b),a_function).
% 4.20/4.41
% 4.20/4.41 ------------> process sos:
% 4.20/4.41 ** KEPT (pick-wt=3): 193 [] A=A.
% 4.20/4.41 ** KEPT (pick-wt=7): 194 [] little_set(f1(A,B))|A=B.
% 4.20/4.41 ** KEPT (pick-wt=13): 195 [] member(f1(A,B),A)|member(f1(A,B),B)|A=B.
% 4.20/4.41 ** KEPT (pick-wt=4): 196 [] little_set(non_ordered_pair(A,B)).
% 4.20/4.41 ** KEPT (pick-wt=6): 197 [] singleton_set(A)=non_ordered_pair(A,A).
% 4.20/4.41 ---> New Demodulator: 198 [new_demod,197] singleton_set(A)=non_ordered_pair(A,A).
% 4.20/4.41 ** KEPT (pick-wt=11): 200 [copy,199,demod,198] ordered_pair(A,B)=non_ordered_pair(non_ordered_pair(A,A),non_ordered_pair(A,B)).
% 4.20/4.41 ---> New Demodulator: 201 [new_demod,200] ordered_pair(A,B)=non_ordered_pair(non_ordered_pair(A,A),non_ordered_pair(A,B)).
% 4.20/4.41 ** KEPT (pick-wt=10): 203 [copy,202,flip.1] complement(intersection(complement(A),complement(B)))=union(A,B).
% 4.20/4.41 ---> New Demodulator: 204 [new_demod,203] complement(intersection(complement(A),complement(B)))=union(A,B).
% 4.20/4.41 ** KEPT (pick-wt=8): 206 [copy,205,demod,198] successor(A)=union(A,non_ordered_pair(A,A)).
% 4.20/4.41 ---> New Demodulator: 207 [new_demod,206] successor(A)=union(A,non_ordered_pair(A,A)).
% 4.20/4.41 ** KEPT (pick-wt=2): 208 [] little_set(infinity).
% 4.20/4.41 ** KEPT (pick-wt=3): 209 [] member(empty_set,infinity).
% 4.20/4.41 ** KEPT (pick-wt=8): 210 [] subset(A,B)|member(f17(A,B),A).
% 4.20/4.41 ** KEPT (pick-wt=6): 211 [] relation(A)|member(f18(A),A).
% 4.20/4.41 ** KEPT (pick-wt=5): 212 [] single_valued_set(A)|little_set(f19(A)).
% 4.20/4.41 ** KEPT (pick-wt=5): 213 [] single_valued_set(A)|little_set(f20(A)).
% 4.20/4.41 ** KEPT (pick-wt=5): 214 [] single_valued_set(A)|little_set(f21(A)).
% 4.20/4.41 ** KEPT (pick-wt=15): 216 [copy,215,demod,201] single_valued_set(A)|member(non_ordered_pair(non_ordered_pair(f19(A),f19(A)),non_ordered_pair(f19(A),f20(A))),A).
% 4.20/4.41 ** KEPT (pick-wt=15): 218 [copy,217,demod,201] single_valued_set(A)|member(non_ordered_pair(non_ordered_pair(f19(A),f19(A)),non_ordered_pair(f19(A),f21(A))),A).
% 4.20/4.41 ** KEPT (pick-wt=8): 219 [] disjoint(A,B)|member(f23(A,B),A).
% 4.20/4.41 ** KEPT (pick-wt=8): 220 [] disjoint(A,B)|member(f23(A,B),B).
% 4.20/4.41 ** KEPT (pick-wt=7): 221 [] A=empty_set|member(f24(A),A).
% 4.20/4.41 ** KEPT (pick-wt=7): 222 [] A=empty_set|disjoint(f24(A),A).
% 4.20/4.41 ** KEPT (pick-wt=2): 223 [] function(f25).
% 4.20/4.41 ** KEPT (pick-wt=9): 224 [] restrict(A,B)=intersection(A,cross_product(B,universal_set)).
% 4.20/4.41 ---> New Demodulator: 225 [new_demod,224] restrict(A,B)=intersection(A,cross_product(B,universal_set)).
% 4.20/4.41 ** KEPT (pick-wt=14): 227 [copy,226,demod,201,flip.1] apply(A,non_ordered_pair(non_ordered_pair(B,B),non_ordered_pair(B,C)))=apply_to_two_arguments(A,B,C).
% 4.20/4.41 ---> New Demodulator: 228 [new_demod,227] apply(A,non_ordered_pair(non_ordered_pair(B,B),non_ordered_pair(B,C)))=apply_to_two_arguments(A,B,C).
% 4.20/4.41 ** KEPT (pick-wt=2): 229 [] function(a_function).
% 4.20/4.41 ** KEPT (pick-wt=4): 230 [] member(a,domain_of(a_function)).
% 4.20/4.41 ** KEPT (pick-wt=5): 231 [] apply(a_function,a)=b.
% 4.20/4.41 ---> New Demodulator: 232 [new_demod,231] apply(a_function,a)=b.
% 4.20/4.41 Following clause subsumed by 193 during input processing: 0 [copy,193,flip.1] A=A.
% 4.20/4.41 193 back subsumes 181.
% 4.20/4.41 193 back subsumes 152.
% 4.20/4.41 193 back subsumes 131.
% 4.20/4.41 >>>> Starting back demodulation with 198.
% 4.20/4.41 >>>> Starting back demodulation with 201.
% 4.20/4.41 >> back demodulating 192 with 201.
% 4.20/4.41 >> back demodulating 191 with 201.
% 4.20/4.41 >> back demodulating 190 with 201.
% 4.20/4.41 >> back demodulating 189 with 201.
% 4.20/4.41 >> back demodulating 188 with 201.
% 4.20/4.41 >> back demodulating 187 with 201.
% 4.20/4.41 >> back demodulating 186 with 201.
% 4.20/4.41 >> back demodulating 185 with 201.
% 4.20/4.41 >> back demodulating 184 with 201.
% 4.20/4.41 >> back demodulating 183 with 201.
% 4.20/4.41 >> back demodulating 182 with 201.
% 4.20/4.41 >> back demodulating 180 with 201.
% 4.20/4.41 >> back demodulating 179 with 201.
% 4.20/4.41 >> back demodulatAlarm clock
% 299.99/300.11 Otter interrupted
% 299.99/300.11 PROOF NOT FOUND
%------------------------------------------------------------------------------