TSTP Solution File: NUM276-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM276-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:07:56 EDT 2022
% Result : Unknown 3.81s 4.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM276-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 10:12:36 EDT 2022
% 0.11/0.33 % CPUTime :
% 3.81/4.03 ----- Otter 3.3f, August 2004 -----
% 3.81/4.03 The process was started by sandbox2 on n027.cluster.edu,
% 3.81/4.03 Wed Jul 27 10:12:37 2022
% 3.81/4.03 The command was "./otter". The process ID is 24246.
% 3.81/4.03
% 3.81/4.03 set(prolog_style_variables).
% 3.81/4.03 set(auto).
% 3.81/4.03 dependent: set(auto1).
% 3.81/4.03 dependent: set(process_input).
% 3.81/4.03 dependent: clear(print_kept).
% 3.81/4.03 dependent: clear(print_new_demod).
% 3.81/4.03 dependent: clear(print_back_demod).
% 3.81/4.03 dependent: clear(print_back_sub).
% 3.81/4.03 dependent: set(control_memory).
% 3.81/4.03 dependent: assign(max_mem, 12000).
% 3.81/4.03 dependent: assign(pick_given_ratio, 4).
% 3.81/4.03 dependent: assign(stats_level, 1).
% 3.81/4.03 dependent: assign(max_seconds, 10800).
% 3.81/4.03 clear(print_given).
% 3.81/4.03
% 3.81/4.03 list(usable).
% 3.81/4.03 0 [] A=A.
% 3.81/4.03 0 [] -subclass(X,Y)| -member(U,X)|member(U,Y).
% 3.81/4.03 0 [] member(not_subclass_element(X,Y),X)|subclass(X,Y).
% 3.81/4.03 0 [] -member(not_subclass_element(X,Y),Y)|subclass(X,Y).
% 3.81/4.03 0 [] subclass(X,universal_class).
% 3.81/4.03 0 [] X!=Y|subclass(X,Y).
% 3.81/4.03 0 [] X!=Y|subclass(Y,X).
% 3.81/4.03 0 [] -subclass(X,Y)| -subclass(Y,X)|X=Y.
% 3.81/4.03 0 [] -member(U,unordered_pair(X,Y))|U=X|U=Y.
% 3.81/4.03 0 [] -member(X,universal_class)|member(X,unordered_pair(X,Y)).
% 3.81/4.03 0 [] -member(Y,universal_class)|member(Y,unordered_pair(X,Y)).
% 3.81/4.03 0 [] member(unordered_pair(X,Y),universal_class).
% 3.81/4.03 0 [] unordered_pair(X,X)=singleton(X).
% 3.81/4.03 0 [] unordered_pair(singleton(X),unordered_pair(X,singleton(Y)))=ordered_pair(X,Y).
% 3.81/4.03 0 [] -member(ordered_pair(U,V),cross_product(X,Y))|member(U,X).
% 3.81/4.03 0 [] -member(ordered_pair(U,V),cross_product(X,Y))|member(V,Y).
% 3.81/4.03 0 [] -member(U,X)| -member(V,Y)|member(ordered_pair(U,V),cross_product(X,Y)).
% 3.81/4.03 0 [] -member(Z,cross_product(X,Y))|ordered_pair(first(Z),second(Z))=Z.
% 3.81/4.03 0 [] subclass(element_relation,cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),element_relation)|member(X,Y).
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),cross_product(universal_class,universal_class))| -member(X,Y)|member(ordered_pair(X,Y),element_relation).
% 3.81/4.03 0 [] -member(Z,intersection(X,Y))|member(Z,X).
% 3.81/4.03 0 [] -member(Z,intersection(X,Y))|member(Z,Y).
% 3.81/4.03 0 [] -member(Z,X)| -member(Z,Y)|member(Z,intersection(X,Y)).
% 3.81/4.03 0 [] -member(Z,complement(X))| -member(Z,X).
% 3.81/4.03 0 [] -member(Z,universal_class)|member(Z,complement(X))|member(Z,X).
% 3.81/4.03 0 [] complement(intersection(complement(X),complement(Y)))=union(X,Y).
% 3.81/4.03 0 [] intersection(complement(intersection(X,Y)),complement(intersection(complement(X),complement(Y))))=symmetric_difference(X,Y).
% 3.81/4.03 0 [] intersection(Xr,cross_product(X,Y))=restrict(Xr,X,Y).
% 3.81/4.03 0 [] intersection(cross_product(X,Y),Xr)=restrict(Xr,X,Y).
% 3.81/4.03 0 [] restrict(X,singleton(Z),universal_class)!=null_class| -member(Z,domain_of(X)).
% 3.81/4.03 0 [] -member(Z,universal_class)|restrict(X,singleton(Z),universal_class)=null_class|member(Z,domain_of(X)).
% 3.81/4.03 0 [] subclass(rotate(X),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(ordered_pair(U,V),W),rotate(X))|member(ordered_pair(ordered_pair(V,W),U),X).
% 3.81/4.03 0 [] -member(ordered_pair(ordered_pair(V,W),U),X)| -member(ordered_pair(ordered_pair(U,V),W),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(U,V),W),rotate(X)).
% 3.81/4.03 0 [] subclass(flip(X),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(ordered_pair(U,V),W),flip(X))|member(ordered_pair(ordered_pair(V,U),W),X).
% 3.81/4.03 0 [] -member(ordered_pair(ordered_pair(V,U),W),X)| -member(ordered_pair(ordered_pair(U,V),W),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(U,V),W),flip(X)).
% 3.81/4.03 0 [] domain_of(flip(cross_product(Y,universal_class)))=inverse(Y).
% 3.81/4.03 0 [] domain_of(inverse(Z))=range_of(Z).
% 3.81/4.03 0 [] first(not_subclass_element(restrict(Z,X,singleton(Y)),null_class))=domain(Z,X,Y).
% 3.81/4.03 0 [] second(not_subclass_element(restrict(Z,singleton(X),Y),null_class))=range(Z,X,Y).
% 3.81/4.03 0 [] range_of(restrict(Xr,X,universal_class))=image(Xr,X).
% 3.81/4.03 0 [] union(X,singleton(X))=successor(X).
% 3.81/4.03 0 [] subclass(successor_relation,cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),successor_relation)|successor(X)=Y.
% 3.81/4.03 0 [] successor(X)!=Y| -member(ordered_pair(X,Y),cross_product(universal_class,universal_class))|member(ordered_pair(X,Y),successor_relation).
% 3.81/4.03 0 [] -inductive(X)|member(null_class,X).
% 3.81/4.03 0 [] -inductive(X)|subclass(image(successor_relation,X),X).
% 3.81/4.03 0 [] -member(null_class,X)| -subclass(image(successor_relation,X),X)|inductive(X).
% 3.81/4.03 0 [] inductive(omega).
% 3.81/4.03 0 [] -inductive(Y)|subclass(omega,Y).
% 3.81/4.03 0 [] member(omega,universal_class).
% 3.81/4.03 0 [] domain_of(restrict(element_relation,universal_class,X))=sum_class(X).
% 3.81/4.03 0 [] -member(X,universal_class)|member(sum_class(X),universal_class).
% 3.81/4.03 0 [] complement(image(element_relation,complement(X)))=power_class(X).
% 3.81/4.03 0 [] -member(U,universal_class)|member(power_class(U),universal_class).
% 3.81/4.03 0 [] subclass(compose(Yr,Xr),cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(Y,Z),compose(Yr,Xr))|member(Z,image(Yr,image(Xr,singleton(Y)))).
% 3.81/4.03 0 [] -member(Z,image(Yr,image(Xr,singleton(Y))))| -member(ordered_pair(Y,Z),cross_product(universal_class,universal_class))|member(ordered_pair(Y,Z),compose(Yr,Xr)).
% 3.81/4.03 0 [] -single_valued_class(X)|subclass(compose(X,inverse(X)),identity_relation).
% 3.81/4.03 0 [] -subclass(compose(X,inverse(X)),identity_relation)|single_valued_class(X).
% 3.81/4.03 0 [] -function(Xf)|subclass(Xf,cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -function(Xf)|subclass(compose(Xf,inverse(Xf)),identity_relation).
% 3.81/4.03 0 [] -subclass(Xf,cross_product(universal_class,universal_class))| -subclass(compose(Xf,inverse(Xf)),identity_relation)|function(Xf).
% 3.81/4.03 0 [] -function(Xf)| -member(X,universal_class)|member(image(Xf,X),universal_class).
% 3.81/4.03 0 [] X=null_class|member(regular(X),X).
% 3.81/4.03 0 [] X=null_class|intersection(X,regular(X))=null_class.
% 3.81/4.03 0 [] sum_class(image(Xf,singleton(Y)))=apply(Xf,Y).
% 3.81/4.03 0 [] function(choice).
% 3.81/4.03 0 [] -member(Y,universal_class)|Y=null_class|member(apply(choice,Y),Y).
% 3.81/4.03 0 [] -one_to_one(Xf)|function(Xf).
% 3.81/4.03 0 [] -one_to_one(Xf)|function(inverse(Xf)).
% 3.81/4.03 0 [] -function(inverse(Xf))| -function(Xf)|one_to_one(Xf).
% 3.81/4.03 0 [] intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation)))))=subset_relation.
% 3.81/4.03 0 [] intersection(inverse(subset_relation),subset_relation)=identity_relation.
% 3.81/4.03 0 [] complement(domain_of(intersection(Xr,identity_relation)))=diagonalise(Xr).
% 3.81/4.03 0 [] intersection(domain_of(X),diagonalise(compose(inverse(element_relation),X)))=cantor(X).
% 3.81/4.03 0 [] -operation(Xf)|function(Xf).
% 3.81/4.03 0 [] -operation(Xf)|cross_product(domain_of(domain_of(Xf)),domain_of(domain_of(Xf)))=domain_of(Xf).
% 3.81/4.03 0 [] -operation(Xf)|subclass(range_of(Xf),domain_of(domain_of(Xf))).
% 3.81/4.03 0 [] -function(Xf)|cross_product(domain_of(domain_of(Xf)),domain_of(domain_of(Xf)))!=domain_of(Xf)| -subclass(range_of(Xf),domain_of(domain_of(Xf)))|operation(Xf).
% 3.81/4.03 0 [] -compatible(Xh,Xf1,Xf2)|function(Xh).
% 3.81/4.03 0 [] -compatible(Xh,Xf1,Xf2)|domain_of(domain_of(Xf1))=domain_of(Xh).
% 3.81/4.03 0 [] -compatible(Xh,Xf1,Xf2)|subclass(range_of(Xh),domain_of(domain_of(Xf2))).
% 3.81/4.03 0 [] -function(Xh)|domain_of(domain_of(Xf1))!=domain_of(Xh)| -subclass(range_of(Xh),domain_of(domain_of(Xf2)))|compatible(Xh,Xf1,Xf2).
% 3.81/4.03 0 [] -homomorphism(Xh,Xf1,Xf2)|operation(Xf1).
% 3.81/4.03 0 [] -homomorphism(Xh,Xf1,Xf2)|operation(Xf2).
% 3.81/4.03 0 [] -homomorphism(Xh,Xf1,Xf2)|compatible(Xh,Xf1,Xf2).
% 3.81/4.03 0 [] -homomorphism(Xh,Xf1,Xf2)| -member(ordered_pair(X,Y),domain_of(Xf1))|apply(Xf2,ordered_pair(apply(Xh,X),apply(Xh,Y)))=apply(Xh,apply(Xf1,ordered_pair(X,Y))).
% 3.81/4.03 0 [] -operation(Xf1)| -operation(Xf2)| -compatible(Xh,Xf1,Xf2)|member(ordered_pair(not_homomorphism1(Xh,Xf1,Xf2),not_homomorphism2(Xh,Xf1,Xf2)),domain_of(Xf1))|homomorphism(Xh,Xf1,Xf2).
% 3.81/4.03 0 [] -operation(Xf1)| -operation(Xf2)| -compatible(Xh,Xf1,Xf2)|apply(Xf2,ordered_pair(apply(Xh,not_homomorphism1(Xh,Xf1,Xf2)),apply(Xh,not_homomorphism2(Xh,Xf1,Xf2))))!=apply(Xh,apply(Xf1,ordered_pair(not_homomorphism1(Xh,Xf1,Xf2),not_homomorphism2(Xh,Xf1,Xf2))))|homomorphism(Xh,Xf1,Xf2).
% 3.81/4.03 0 [] subclass(compose_class(X),cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(Y,Z),compose_class(X))|compose(X,Y)=Z.
% 3.81/4.03 0 [] -member(ordered_pair(Y,Z),cross_product(universal_class,universal_class))|compose(X,Y)!=Z|member(ordered_pair(Y,Z),compose_class(X)).
% 3.81/4.03 0 [] subclass(composition_function,cross_product(universal_class,cross_product(universal_class,universal_class))).
% 3.81/4.03 0 [] -member(ordered_pair(X,ordered_pair(Y,Z)),composition_function)|compose(X,Y)=Z.
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),cross_product(universal_class,universal_class))|member(ordered_pair(X,ordered_pair(Y,compose(X,Y))),composition_function).
% 3.81/4.03 0 [] subclass(domain_relation,cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),domain_relation)|domain_of(X)=Y.
% 3.81/4.03 0 [] -member(X,universal_class)|member(ordered_pair(X,domain_of(X)),domain_relation).
% 3.81/4.03 0 [] first(not_subclass_element(compose(X,inverse(X)),identity_relation))=single_valued1(X).
% 3.81/4.03 0 [] second(not_subclass_element(compose(X,inverse(X)),identity_relation))=single_valued2(X).
% 3.81/4.03 0 [] domain(X,image(inverse(X),singleton(single_valued1(X))),single_valued2(X))=single_valued3(X).
% 3.81/4.03 0 [] intersection(complement(compose(element_relation,complement(identity_relation))),element_relation)=singleton_relation.
% 3.81/4.03 0 [] subclass(application_function,cross_product(universal_class,cross_product(universal_class,universal_class))).
% 3.81/4.03 0 [] -member(ordered_pair(X,ordered_pair(Y,Z)),application_function)|member(Y,domain_of(X)).
% 3.81/4.03 0 [] -member(ordered_pair(X,ordered_pair(Y,Z)),application_function)|apply(X,Y)=Z.
% 3.81/4.03 0 [] -member(ordered_pair(X,ordered_pair(Y,Z)),cross_product(universal_class,cross_product(universal_class,universal_class)))| -member(Y,domain_of(X))|member(ordered_pair(X,ordered_pair(Y,apply(X,Y))),application_function).
% 3.81/4.03 0 [] -maps(Xf,X,Y)|function(Xf).
% 3.81/4.03 0 [] -maps(Xf,X,Y)|domain_of(Xf)=X.
% 3.81/4.03 0 [] -maps(Xf,X,Y)|subclass(range_of(Xf),Y).
% 3.81/4.03 0 [] -function(Xf)| -subclass(range_of(Xf),Y)|maps(Xf,domain_of(Xf),Y).
% 3.81/4.03 0 [] union(X,inverse(X))=symmetrization_of(X).
% 3.81/4.03 0 [] -irreflexive(X,Y)|subclass(restrict(X,Y,Y),complement(identity_relation)).
% 3.81/4.03 0 [] -subclass(restrict(X,Y,Y),complement(identity_relation))|irreflexive(X,Y).
% 3.81/4.03 0 [] -connected(X,Y)|subclass(cross_product(Y,Y),union(identity_relation,symmetrization_of(X))).
% 3.81/4.03 0 [] -subclass(cross_product(Y,Y),union(identity_relation,symmetrization_of(X)))|connected(X,Y).
% 3.81/4.03 0 [] -transitive(Xr,Y)|subclass(compose(restrict(Xr,Y,Y),restrict(Xr,Y,Y)),restrict(Xr,Y,Y)).
% 3.81/4.03 0 [] -subclass(compose(restrict(Xr,Y,Y),restrict(Xr,Y,Y)),restrict(Xr,Y,Y))|transitive(Xr,Y).
% 3.81/4.03 0 [] -asymmetric(Xr,Y)|restrict(intersection(Xr,inverse(Xr)),Y,Y)=null_class.
% 3.81/4.03 0 [] restrict(intersection(Xr,inverse(Xr)),Y,Y)!=null_class|asymmetric(Xr,Y).
% 3.81/4.03 0 [] segment(Xr,Y,Z)=domain_of(restrict(Xr,Y,singleton(Z))).
% 3.81/4.03 0 [] -well_ordering(X,Y)|connected(X,Y).
% 3.81/4.03 0 [] -well_ordering(Xr,Y)| -subclass(U,Y)|U=null_class|member(least(Xr,U),U).
% 3.81/4.03 0 [] -well_ordering(Xr,Y)| -subclass(U,Y)| -member(V,U)|member(least(Xr,U),U).
% 3.81/4.03 0 [] -well_ordering(Xr,Y)| -subclass(U,Y)|segment(Xr,U,least(Xr,U))=null_class.
% 3.81/4.03 0 [] -well_ordering(Xr,Y)| -subclass(U,Y)| -member(V,U)| -member(ordered_pair(V,least(Xr,U)),Xr).
% 3.81/4.03 0 [] -connected(Xr,Y)|not_well_ordering(Xr,Y)!=null_class|well_ordering(Xr,Y).
% 3.81/4.03 0 [] -connected(Xr,Y)|subclass(not_well_ordering(Xr,Y),Y)|well_ordering(Xr,Y).
% 3.81/4.03 0 [] -member(V,not_well_ordering(Xr,Y))|segment(Xr,not_well_ordering(Xr,Y),V)!=null_class| -connected(Xr,Y)|well_ordering(Xr,Y).
% 3.81/4.03 0 [] -section(Xr,Y,Z)|subclass(Y,Z).
% 3.81/4.03 0 [] -section(Xr,Y,Z)|subclass(domain_of(restrict(Xr,Z,Y)),Y).
% 3.81/4.03 0 [] -subclass(Y,Z)| -subclass(domain_of(restrict(Xr,Z,Y)),Y)|section(Xr,Y,Z).
% 3.81/4.03 0 [] -member(X,ordinal_numbers)|well_ordering(element_relation,X).
% 3.81/4.03 0 [] -member(X,ordinal_numbers)|subclass(sum_class(X),X).
% 3.81/4.03 0 [] -well_ordering(element_relation,X)| -subclass(sum_class(X),X)| -member(X,universal_class)|member(X,ordinal_numbers).
% 3.81/4.03 0 [] -well_ordering(element_relation,X)| -subclass(sum_class(X),X)|member(X,ordinal_numbers)|X=ordinal_numbers.
% 3.81/4.03 0 [] union(singleton(null_class),image(successor_relation,ordinal_numbers))=kind_1_ordinals.
% 3.81/4.03 0 [] intersection(complement(kind_1_ordinals),ordinal_numbers)=limit_ordinals.
% 3.81/4.03 0 [] subclass(rest_of(X),cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(U,V),rest_of(X))|member(U,domain_of(X)).
% 3.81/4.03 0 [] -member(ordered_pair(U,V),rest_of(X))|restrict(X,U,universal_class)=V.
% 3.81/4.03 0 [] -member(U,domain_of(X))|restrict(X,U,universal_class)!=V|member(ordered_pair(U,V),rest_of(X)).
% 3.81/4.03 0 [] subclass(rest_relation,cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),rest_relation)|rest_of(X)=Y.
% 3.81/4.03 0 [] -member(X,universal_class)|member(ordered_pair(X,rest_of(X)),rest_relation).
% 3.81/4.03 0 [] -member(X,recursion_e_quation_functions(Z))|function(Z).
% 3.81/4.03 0 [] -member(X,recursion_e_quation_functions(Z))|function(X).
% 3.81/4.03 0 [] -member(X,recursion_e_quation_functions(Z))|member(domain_of(X),ordinal_numbers).
% 3.81/4.03 0 [] -member(X,recursion_e_quation_functions(Z))|compose(Z,rest_of(X))=X.
% 3.81/4.03 0 [] -function(Z)| -function(X)| -member(domain_of(X),ordinal_numbers)|compose(Z,rest_of(X))!=X|member(X,recursion_e_quation_functions(Z)).
% 3.81/4.03 0 [] subclass(union_of_range_map,cross_product(universal_class,universal_class)).
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),union_of_range_map)|sum_class(range_of(X))=Y.
% 3.81/4.03 0 [] -member(ordered_pair(X,Y),cross_product(universal_class,universal_class))|sum_class(range_of(X))!=Y|member(ordered_pair(X,Y),union_of_range_map).
% 3.81/4.03 0 [] apply(recursion(X,successor_relation,union_of_range_map),Y)=ordinal_add(X,Y).
% 3.81/4.03 0 [] recursion(null_class,apply(add_relation,X),union_of_range_map)=ordinal_multiply(X,Y).
% 3.81/4.03 0 [] -member(X,omega)|integer_of(X)=X.
% 3.81/4.03 0 [] member(X,omega)|integer_of(X)=null_class.
% 3.81/4.03 0 [] subclass(ordinals_with_null_class_as_identity,ordinal_numbers).
% 3.81/4.03 0 [] -member(X,ordinals_with_null_class_as_identity)|ordinal_add(null_class,X)=X.
% 3.81/4.03 0 [] -member(X,ordinal_numbers)|ordinal_add(null_class,X)!=X|member(X,ordinals_with_null_class_as_identity).
% 3.81/4.03 0 [] -subclass(intersection(power_class(ordinals_with_null_class_as_identity),limit_ordinals),ordinals_with_null_class_as_identity).
% 3.81/4.03 end_of_list.
% 3.81/4.03
% 3.81/4.03 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 3.81/4.03
% 3.81/4.03 This ia a non-Horn set with equality. The strategy will be
% 3.81/4.03 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 3.81/4.03 deletion, with positive clauses in sos and nonpositive
% 3.81/4.03 clauses in usable.
% 3.81/4.03
% 3.81/4.03 dependent: set(knuth_bendix).
% 3.81/4.03 dependent: set(anl_eq).
% 3.81/4.03 dependent: set(para_from).
% 3.81/4.03 dependent: set(para_into).
% 3.81/4.03 dependent: clear(para_from_right).
% 3.81/4.03 dependent: clear(para_into_right).
% 3.81/4.03 dependent: set(para_from_vars).
% 3.81/4.03 dependent: set(eq_units_both_ways).
% 3.81/4.03 dependent: set(dynamic_demod_all).
% 3.81/4.03 dependent: set(dynamic_demod).
% 3.81/4.03 dependent: set(order_eq).
% 3.81/4.03 dependent: set(back_demod).
% 3.81/4.03 dependent: set(lrpo).
% 3.81/4.03 dependent: set(hyper_res).
% 3.81/4.03 dependent: set(unit_deletion).
% 3.81/4.03 dependent: set(factor).
% 3.81/4.03
% 3.81/4.03 ------------> process usable:
% 3.81/4.03 ** KEPT (pick-wt=9): 1 [] -subclass(A,B)| -member(C,A)|member(C,B).
% 3.81/4.03 ** KEPT (pick-wt=8): 2 [] -member(not_subclass_element(A,B),B)|subclass(A,B).
% 3.81/4.03 ** KEPT (pick-wt=6): 3 [] A!=B|subclass(A,B).
% 3.81/4.03 ** KEPT (pick-wt=6): 4 [] A!=B|subclass(B,A).
% 3.81/4.03 ** KEPT (pick-wt=9): 5 [] -subclass(A,B)| -subclass(B,A)|A=B.
% 3.81/4.03 ** KEPT (pick-wt=11): 6 [] -member(A,unordered_pair(B,C))|A=B|A=C.
% 3.81/4.03 ** KEPT (pick-wt=8): 7 [] -member(A,universal_class)|member(A,unordered_pair(A,B)).
% 3.81/4.03 ** KEPT (pick-wt=8): 8 [] -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 3.81/4.03 ** KEPT (pick-wt=10): 9 [] -member(ordered_pair(A,B),cross_product(C,D))|member(A,C).
% 3.81/4.03 ** KEPT (pick-wt=10): 10 [] -member(ordered_pair(A,B),cross_product(C,D))|member(B,D).
% 3.81/4.03 ** KEPT (pick-wt=13): 11 [] -member(A,B)| -member(C,D)|member(ordered_pair(A,C),cross_product(B,D)).
% 3.81/4.03 ** KEPT (pick-wt=12): 12 [] -member(A,cross_product(B,C))|ordered_pair(first(A),second(A))=A.
% 3.81/4.03 ** KEPT (pick-wt=8): 13 [] -member(ordered_pair(A,B),element_relation)|member(A,B).
% 3.81/4.03 ** KEPT (pick-wt=15): 14 [] -member(ordered_pair(A,B),cross_product(universal_class,universal_class))| -member(A,B)|member(ordered_pair(A,B),element_relation).
% 3.81/4.03 ** KEPT (pick-wt=8): 15 [] -member(A,intersection(B,C))|member(A,B).
% 3.81/4.03 ** KEPT (pick-wt=8): 16 [] -member(A,intersection(B,C))|member(A,C).
% 3.81/4.03 ** KEPT (pick-wt=11): 17 [] -member(A,B)| -member(A,C)|member(A,intersection(B,C)).
% 3.81/4.03 ** KEPT (pick-wt=7): 18 [] -member(A,complement(B))| -member(A,B).
% 3.81/4.03 ** KEPT (pick-wt=10): 19 [] -member(A,universal_class)|member(A,complement(B))|member(A,B).
% 3.81/4.03 ** KEPT (pick-wt=11): 20 [] restrict(A,singleton(B),universal_class)!=null_class| -member(B,domain_of(A)).
% 3.81/4.03 ** KEPT (pick-wt=14): 21 [] -member(A,universal_class)|restrict(B,singleton(A),universal_class)=null_class|member(A,domain_of(B)).
% 3.81/4.03 ** KEPT (pick-wt=15): 22 [] -member(ordered_pair(ordered_pair(A,B),C),rotate(D))|member(ordered_pair(ordered_pair(B,C),A),D).
% 3.81/4.03 ** KEPT (pick-wt=26): 23 [] -member(ordered_pair(ordered_pair(A,B),C),D)| -member(ordered_pair(ordered_pair(C,A),B),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(C,A),B),rotate(D)).
% 3.81/4.03 ** KEPT (pick-wt=15): 24 [] -member(ordered_pair(ordered_pair(A,B),C),flip(D))|member(ordered_pair(ordered_pair(B,A),C),D).
% 3.81/4.03 ** KEPT (pick-wt=26): 25 [] -member(ordered_pair(ordered_pair(A,B),C),D)| -member(ordered_pair(ordered_pair(B,A),C),cross_product(cross_product(universal_class,universal_class),universal_class))|member(ordered_pair(ordered_pair(B,A),C),flip(D)).
% 3.81/4.03 ** KEPT (pick-wt=9): 26 [] -member(ordered_pair(A,B),successor_relation)|successor(A)=B.
% 3.81/4.03 ** KEPT (pick-wt=16): 27 [] successor(A)!=B| -member(ordered_pair(A,B),cross_product(universal_class,universal_class))|member(ordered_pair(A,B),successor_relation).
% 3.81/4.03 ** KEPT (pick-wt=5): 28 [] -inductive(A)|member(null_class,A).
% 3.81/4.03 ** KEPT (pick-wt=7): 29 [] -inductive(A)|subclass(image(successor_relation,A),A).
% 3.81/4.03 ** KEPT (pick-wt=10): 30 [] -member(null_class,A)| -subclass(image(successor_relation,A),A)|inductive(A).
% 3.81/4.03 ** KEPT (pick-wt=5): 31 [] -inductive(A)|subclass(omega,A).
% 3.81/4.03 ** KEPT (pick-wt=7): 32 [] -member(A,universal_class)|member(sum_class(A),universal_class).
% 3.81/4.03 ** KEPT (pick-wt=7): 33 [] -member(A,universal_class)|member(power_class(A),universal_class).
% 3.81/4.03 ** KEPT (pick-wt=15): 34 [] -member(ordered_pair(A,B),compose(C,D))|member(B,image(C,image(D,singleton(A)))).
% 3.81/4.03 ** KEPT (pick-wt=22): 35 [] -member(A,image(B,image(C,singleton(D))))| -member(ordered_pair(D,A),cross_product(universal_class,universal_class))|member(ordered_pair(D,A),compose(B,C)).
% 3.81/4.03 ** KEPT (pick-wt=8): 36 [] -single_valued_class(A)|subclass(compose(A,inverse(A)),identity_relation).
% 3.81/4.03 ** KEPT (pick-wt=8): 37 [] -subclass(compose(A,inverse(A)),identity_relation)|single_valued_class(A).
% 3.81/4.03 ** KEPT (pick-wt=7): 38 [] -function(A)|subclass(A,cross_product(universal_class,universal_class)).
% 3.81/4.03 ** KEPT (pick-wt=8): 39 [] -function(A)|subclass(compose(A,inverse(A)),identity_relation).
% 3.81/4.03 ** KEPT (pick-wt=13): 40 [] -subclass(A,cross_product(universal_class,universal_class))| -subclass(compose(A,inverse(A)),identity_relation)|function(A).
% 3.81/4.03 ** KEPT (pick-wt=10): 41 [] -function(A)| -member(B,universal_class)|member(image(A,B),universal_class).
% 3.81/4.03 ** KEPT (pick-wt=11): 42 [] -member(A,universal_class)|A=null_class|member(apply(choice,A),A).
% 3.81/4.03 ** KEPT (pick-wt=4): 43 [] -one_to_one(A)|function(A).
% 3.81/4.03 ** KEPT (pick-wt=5): 44 [] -one_to_one(A)|function(inverse(A)).
% 3.81/4.03 ** KEPT (pick-wt=7): 45 [] -function(inverse(A))| -function(A)|one_to_one(A).
% 3.81/4.03 ** KEPT (pick-wt=4): 46 [] -operation(A)|function(A).
% 3.81/4.03 ** KEPT (pick-wt=12): 47 [] -operation(A)|cross_product(domain_of(domain_of(A)),domain_of(domain_of(A)))=domain_of(A).
% 3.81/4.03 ** KEPT (pick-wt=8): 48 [] -operation(A)|subclass(range_of(A),domain_of(domain_of(A))).
% 3.81/4.03 ** KEPT (pick-wt=20): 49 [] -function(A)|cross_product(domain_of(domain_of(A)),domain_of(domain_of(A)))!=domain_of(A)| -subclass(range_of(A),domain_of(domain_of(A)))|operation(A).
% 3.81/4.03 ** KEPT (pick-wt=6): 50 [] -compatible(A,B,C)|function(A).
% 3.81/4.03 ** KEPT (pick-wt=10): 51 [] -compatible(A,B,C)|domain_of(domain_of(B))=domain_of(A).
% 3.81/4.03 ** KEPT (pick-wt=10): 52 [] -compatible(A,B,C)|subclass(range_of(A),domain_of(domain_of(C))).
% 3.81/4.03 ** KEPT (pick-wt=18): 53 [] -function(A)|domain_of(domain_of(B))!=domain_of(A)| -subclass(range_of(A),domain_of(domain_of(C)))|compatible(A,B,C).
% 3.81/4.03 ** KEPT (pick-wt=6): 54 [] -homomorphism(A,B,C)|operation(B).
% 3.81/4.03 ** KEPT (pick-wt=6): 55 [] -homomorphism(A,B,C)|operation(C).
% 3.81/4.03 ** KEPT (pick-wt=8): 56 [] -homomorphism(A,B,C)|compatible(A,B,C).
% 3.81/4.03 ** KEPT (pick-wt=27): 57 [] -homomorphism(A,B,C)| -member(ordered_pair(D,E),domain_of(B))|apply(C,ordered_pair(apply(A,D),apply(A,E)))=apply(A,apply(B,ordered_pair(D,E))).
% 3.81/4.03 ** KEPT (pick-wt=24): 58 [] -operation(A)| -operation(B)| -compatible(C,A,B)|member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A))|homomorphism(C,A,B).
% 3.81/4.03 ** KEPT (pick-wt=41): 59 [] -operation(A)| -operation(B)| -compatible(C,A,B)|apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B))))!=apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B))))|homomorphism(C,A,B).
% 3.81/4.03 ** KEPT (pick-wt=11): 60 [] -member(ordered_pair(A,B),compose_class(C))|compose(C,A)=B.
% 3.81/4.03 ** KEPT (pick-wt=18): 61 [] -member(ordered_pair(A,B),cross_product(universal_class,universal_class))|compose(C,A)!=B|member(ordered_pair(A,B),compose_class(C)).
% 3.81/4.03 ** KEPT (pick-wt=12): 62 [] -member(ordered_pair(A,ordered_pair(B,C)),composition_function)|compose(A,B)=C.
% 3.81/4.03 ** KEPT (pick-wt=16): 63 [] -member(ordered_pair(A,B),cross_product(universal_class,universal_class))|member(ordered_pair(A,ordered_pair(B,compose(A,B))),composition_function).
% 3.81/4.03 ** KEPT (pick-wt=9): 64 [] -member(ordered_pair(A,B),domain_relation)|domain_of(A)=B.
% 3.81/4.03 ** KEPT (pick-wt=9): 65 [] -member(A,universal_class)|member(ordered_pair(A,domain_of(A)),domain_relation).
% 3.81/4.03 ** KEPT (pick-wt=11): 66 [] -member(ordered_pair(A,ordered_pair(B,C)),application_function)|member(B,domain_of(A)).
% 3.81/4.03 ** KEPT (pick-wt=12): 67 [] -member(ordered_pair(A,ordered_pair(B,C)),application_function)|apply(A,B)=C.
% 3.81/4.03 ** KEPT (pick-wt=24): 68 [] -member(ordered_pair(A,ordered_pair(B,C)),cross_product(universal_class,cross_product(universal_class,universal_class)))| -member(B,domain_of(A))|member(ordered_pair(A,ordered_pair(B,apply(A,B))),application_function).
% 3.81/4.03 ** KEPT (pick-wt=6): 69 [] -maps(A,B,C)|function(A).
% 3.81/4.03 ** KEPT (pick-wt=8): 70 [] -maps(A,B,C)|domain_of(A)=B.
% 3.81/4.03 ** KEPT (pick-wt=8): 71 [] -maps(A,B,C)|subclass(range_of(A),C).
% 3.81/4.03 ** KEPT (pick-wt=11): 72 [] -function(A)| -subclass(range_of(A),B)|maps(A,domain_of(A),B).
% 3.81/4.03 ** KEPT (pick-wt=10): 73 [] -irreflexive(A,B)|subclass(restrict(A,B,B),complement(identity_relation)).
% 3.81/4.03 ** KEPT (pick-wt=10): 74 [] -subclass(restrict(A,B,B),complement(identity_relation))|irreflexive(A,B).
% 3.81/4.03 ** KEPT (pick-wt=11): 75 [] -connected(A,B)|subclass(cross_product(B,B),union(identity_relation,symmetrization_of(A))).
% 3.81/4.03 ** KEPT (pick-wt=11): 76 [] -subclass(cross_product(A,A),union(identity_relation,symmetrization_of(B)))|connected(B,A).
% 3.81/4.03 ** KEPT (pick-wt=17): 77 [] -transitive(A,B)|subclass(compose(restrict(A,B,B),restrict(A,B,B)),restrict(A,B,B)).
% 3.81/4.03 ** KEPT (pick-wt=17): 78 [] -subclass(compose(restrict(A,B,B),restrict(A,B,B)),restrict(A,B,B))|transitive(A,B).
% 3.81/4.03 ** KEPT (pick-wt=12): 79 [] -asymmetric(A,B)|restrict(intersection(A,inverse(A)),B,B)=null_class.
% 3.81/4.03 ** KEPT (pick-wt=12): 80 [] restrict(intersection(A,inverse(A)),B,B)!=null_class|asymmetric(A,B).
% 3.81/4.03 ** KEPT (pick-wt=6): 81 [] -well_ordering(A,B)|connected(A,B).
% 3.81/4.03 ** KEPT (pick-wt=14): 82 [] -well_ordering(A,B)| -subclass(C,B)|C=null_class|member(least(A,C),C).
% 3.81/4.03 ** KEPT (pick-wt=14): 83 [] -well_ordering(A,B)| -subclass(C,B)| -member(D,C)|member(least(A,C),C).
% 3.81/4.03 ** KEPT (pick-wt=14): 84 [] -well_ordering(A,B)| -subclass(C,B)|segment(A,C,least(A,C))=null_class.
% 3.81/4.03 ** KEPT (pick-wt=16): 85 [] -well_ordering(A,B)| -subclass(C,B)| -member(D,C)| -member(ordered_pair(D,least(A,C)),A).
% 3.81/4.03 ** KEPT (pick-wt=11): 86 [] -connected(A,B)|not_well_ordering(A,B)!=null_class|well_ordering(A,B).
% 3.81/4.03 ** KEPT (pick-wt=11): 87 [] -connected(A,B)|subclass(not_well_ordering(A,B),B)|well_ordering(A,B).
% 3.81/4.03 ** KEPT (pick-wt=19): 88 [] -member(A,not_well_ordering(B,C))|segment(B,not_well_ordering(B,C),A)!=null_class| -connected(B,C)|well_ordering(B,C).
% 3.81/4.03 ** KEPT (pick-wt=7): 89 [] -section(A,B,C)|subclass(B,C).
% 3.81/4.03 ** KEPT (pick-wt=11): 90 [] -section(A,B,C)|subclass(domain_of(restrict(A,C,B)),B).
% 3.81/4.03 ** KEPT (pick-wt=14): 91 [] -subclass(A,B)| -subclass(domain_of(restrict(C,B,A)),A)|section(C,A,B).
% 3.81/4.03 ** KEPT (pick-wt=6): 92 [] -member(A,ordinal_numbers)|well_ordering(element_relation,A).
% 3.81/4.03 ** KEPT (pick-wt=7): 93 [] -member(A,ordinal_numbers)|subclass(sum_class(A),A).
% 3.81/4.03 ** KEPT (pick-wt=13): 94 [] -well_ordering(element_relation,A)| -subclass(sum_class(A),A)| -member(A,universal_class)|member(A,ordinal_numbers).
% 3.81/4.03 ** KEPT (pick-wt=13): 95 [] -well_ordering(element_relation,A)| -subclass(sum_class(A),A)|member(A,ordinal_numbers)|A=ordinal_numbers.
% 3.81/4.03 ** KEPT (pick-wt=10): 96 [] -member(ordered_pair(A,B),rest_of(C))|member(A,domain_of(C)).
% 3.81/4.03 ** KEPT (pick-wt=12): 97 [] -member(ordered_pair(A,B),rest_of(C))|restrict(C,A,universal_class)=B.
% 3.81/4.03 ** KEPT (pick-wt=16): 98 [] -member(A,domain_of(B))|restrict(B,A,universal_class)!=C|member(ordered_pair(A,C),rest_of(B)).
% 3.81/4.03 ** KEPT (pick-wt=9): 99 [] -member(ordered_pair(A,B),rest_relation)|rest_of(A)=B.
% 3.81/4.03 ** KEPT (pick-wt=9): 100 [] -member(A,universal_class)|member(ordered_pair(A,rest_of(A)),rest_relation).
% 3.81/4.03 ** KEPT (pick-wt=6): 101 [] -member(A,recursion_e_quation_functions(B))|function(B).
% 3.81/4.03 ** KEPT (pick-wt=6): 102 [] -member(A,recursion_e_quation_functions(B))|function(A).
% 3.81/4.03 ** KEPT (pick-wt=8): 103 [] -member(A,recursion_e_quation_functions(B))|member(domain_of(A),ordinal_numbers).
% 3.81/4.03 ** KEPT (pick-wt=10): 104 [] -member(A,recursion_e_quation_functions(B))|compose(B,rest_of(A))=A.
% 3.81/4.03 ** KEPT (pick-wt=18): 105 [] -function(A)| -function(B)| -member(domain_of(B),ordinal_numbers)|compose(A,rest_of(B))!=B|member(B,recursion_e_quation_functions(A)).
% 3.81/4.03 ** KEPT (pick-wt=10): 106 [] -member(ordered_pair(A,B),union_of_range_map)|sum_class(range_of(A))=B.
% 3.81/4.03 ** KEPT (pick-wt=17): 107 [] -member(ordered_pair(A,B),cross_product(universal_class,universal_class))|sum_class(range_of(A))!=B|member(ordered_pair(A,B),union_of_range_map).
% 3.81/4.03 ** KEPT (pick-wt=7): 108 [] -member(A,omega)|integer_of(A)=A.
% 3.81/4.03 ** KEPT (pick-wt=8): 109 [] -member(A,ordinals_with_null_class_as_identity)|ordinal_add(null_class,A)=A.
% 3.81/4.03 ** KEPT (pick-wt=11): 110 [] -member(A,ordinal_numbers)|ordinal_add(null_class,A)!=A|member(A,ordinals_with_null_class_as_identity).
% 3.81/4.03 ** KEPT (pick-wt=6): 111 [] -subclass(intersection(power_class(ordinals_with_null_class_as_identity),limit_ordinals),ordinals_with_null_class_as_identity).
% 3.81/4.03
% 3.81/4.03 ------------> process sos:
% 3.81/4.03 ** KEPT (pick-wt=3): 121 [] A=A.
% 3.81/4.04 ** KEPT (pick-wt=8): 122 [] member(not_subclass_element(A,B),A)|subclass(A,B).
% 3.81/4.04 ** KEPT (pick-wt=3): 123 [] subclass(A,universal_class).
% 3.81/4.04 ** KEPT (pick-wt=5): 124 [] member(unordered_pair(A,B),universal_class).
% 3.81/4.04 ** KEPT (pick-wt=6): 126 [copy,125,flip.1] singleton(A)=unordered_pair(A,A).
% 3.81/4.04 ---> New Demodulator: 127 [new_demod,126] singleton(A)=unordered_pair(A,A).
% 3.81/4.04 ** KEPT (pick-wt=13): 129 [copy,128,demod,127,127] unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 3.81/4.04 ---> New Demodulator: 130 [new_demod,129] unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 3.81/4.04 ** KEPT (pick-wt=5): 131 [] subclass(element_relation,cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=10): 132 [] complement(intersection(complement(A),complement(B)))=union(A,B).
% 3.81/4.04 ---> New Demodulator: 133 [new_demod,132] complement(intersection(complement(A),complement(B)))=union(A,B).
% 3.81/4.04 ** KEPT (pick-wt=12): 135 [copy,134,demod,133] intersection(complement(intersection(A,B)),union(A,B))=symmetric_difference(A,B).
% 3.81/4.04 ---> New Demodulator: 136 [new_demod,135] intersection(complement(intersection(A,B)),union(A,B))=symmetric_difference(A,B).
% 3.81/4.04 ** KEPT (pick-wt=10): 137 [] intersection(A,cross_product(B,C))=restrict(A,B,C).
% 3.81/4.04 ---> New Demodulator: 138 [new_demod,137] intersection(A,cross_product(B,C))=restrict(A,B,C).
% 3.81/4.04 ** KEPT (pick-wt=10): 139 [] intersection(cross_product(A,B),C)=restrict(C,A,B).
% 3.81/4.04 ---> New Demodulator: 140 [new_demod,139] intersection(cross_product(A,B),C)=restrict(C,A,B).
% 3.81/4.04 ** KEPT (pick-wt=8): 141 [] subclass(rotate(A),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=8): 142 [] subclass(flip(A),cross_product(cross_product(universal_class,universal_class),universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=8): 144 [copy,143,flip.1] inverse(A)=domain_of(flip(cross_product(A,universal_class))).
% 3.81/4.04 ---> New Demodulator: 145 [new_demod,144] inverse(A)=domain_of(flip(cross_product(A,universal_class))).
% 3.81/4.04 ** KEPT (pick-wt=9): 147 [copy,146,demod,145,flip.1] range_of(A)=domain_of(domain_of(flip(cross_product(A,universal_class)))).
% 3.81/4.04 ---> New Demodulator: 148 [new_demod,147] range_of(A)=domain_of(domain_of(flip(cross_product(A,universal_class)))).
% 3.81/4.04 ** KEPT (pick-wt=14): 150 [copy,149,demod,127] first(not_subclass_element(restrict(A,B,unordered_pair(C,C)),null_class))=domain(A,B,C).
% 3.81/4.04 ---> New Demodulator: 151 [new_demod,150] first(not_subclass_element(restrict(A,B,unordered_pair(C,C)),null_class))=domain(A,B,C).
% 3.81/4.04 ** KEPT (pick-wt=14): 153 [copy,152,demod,127] second(not_subclass_element(restrict(A,unordered_pair(B,B),C),null_class))=range(A,B,C).
% 3.81/4.04 ---> New Demodulator: 154 [new_demod,153] second(not_subclass_element(restrict(A,unordered_pair(B,B),C),null_class))=range(A,B,C).
% 3.81/4.04 ** KEPT (pick-wt=13): 156 [copy,155,demod,148] domain_of(domain_of(flip(cross_product(restrict(A,B,universal_class),universal_class))))=image(A,B).
% 3.81/4.04 ---> New Demodulator: 157 [new_demod,156] domain_of(domain_of(flip(cross_product(restrict(A,B,universal_class),universal_class))))=image(A,B).
% 3.81/4.04 ** KEPT (pick-wt=8): 159 [copy,158,demod,127,flip.1] successor(A)=union(A,unordered_pair(A,A)).
% 3.81/4.04 ---> New Demodulator: 160 [new_demod,159] successor(A)=union(A,unordered_pair(A,A)).
% 3.81/4.04 ** KEPT (pick-wt=5): 161 [] subclass(successor_relation,cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=2): 162 [] inductive(omega).
% 3.81/4.04 ** KEPT (pick-wt=3): 163 [] member(omega,universal_class).
% 3.81/4.04 ** KEPT (pick-wt=8): 165 [copy,164,flip.1] sum_class(A)=domain_of(restrict(element_relation,universal_class,A)).
% 3.81/4.04 ---> New Demodulator: 166 [new_demod,165] sum_class(A)=domain_of(restrict(element_relation,universal_class,A)).
% 3.81/4.04 ** KEPT (pick-wt=8): 168 [copy,167,flip.1] power_class(A)=complement(image(element_relation,complement(A))).
% 3.81/4.04 ---> New Demodulator: 169 [new_demod,168] power_class(A)=complement(image(element_relation,complement(A))).
% 3.81/4.04 ** KEPT (pick-wt=7): 170 [] subclass(compose(A,B),cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=7): 171 [] A=null_class|member(regular(A),A).
% 3.81/4.04 ** KEPT (pick-wt=9): 172 [] A=null_class|intersection(A,regular(A))=null_class.
% 3.81/4.04 ** KEPT (pick-wt=13): 174 [copy,173,demod,127,166] domain_of(restrict(element_relation,universal_class,image(A,unordered_pair(B,B))))=apply(A,B).
% 3.81/4.04 ---> New Demodulator: 175 [new_demod,174] domain_of(restrict(element_relation,universal_class,image(A,unordered_pair(B,B))))=apply(A,B).
% 3.81/4.04 ** KEPT (pick-wt=2): 176 [] function(choice).
% 3.81/4.04 ** KEPT (pick-wt=17): 178 [copy,177,demod,145,140,140] restrict(restrict(complement(compose(complement(element_relation),domain_of(flip(cross_product(element_relation,universal_class))))),universal_class,universal_class),universal_class,universal_class)=subset_relation.
% 3.81/4.04 ---> New Demodulator: 179 [new_demod,178] restrict(restrict(complement(compose(complement(element_relation),domain_of(flip(cross_product(element_relation,universal_class))))),universal_class,universal_class),universal_class,universal_class)=subset_relation.
% 3.81/4.04 ** KEPT (pick-wt=9): 181 [copy,180,demod,145] intersection(domain_of(flip(cross_product(subset_relation,universal_class))),subset_relation)=identity_relation.
% 3.81/4.04 ---> New Demodulator: 182 [new_demod,181] intersection(domain_of(flip(cross_product(subset_relation,universal_class))),subset_relation)=identity_relation.
% 3.81/4.04 ** KEPT (pick-wt=8): 183 [] complement(domain_of(intersection(A,identity_relation)))=diagonalise(A).
% 3.81/4.04 ---> New Demodulator: 184 [new_demod,183] complement(domain_of(intersection(A,identity_relation)))=diagonalise(A).
% 3.81/4.04 ** KEPT (pick-wt=14): 186 [copy,185,demod,145] intersection(domain_of(A),diagonalise(compose(domain_of(flip(cross_product(element_relation,universal_class))),A)))=cantor(A).
% 3.81/4.04 ---> New Demodulator: 187 [new_demod,186] intersection(domain_of(A),diagonalise(compose(domain_of(flip(cross_product(element_relation,universal_class))),A)))=cantor(A).
% 3.81/4.04 ** KEPT (pick-wt=6): 188 [] subclass(compose_class(A),cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=7): 189 [] subclass(composition_function,cross_product(universal_class,cross_product(universal_class,universal_class))).
% 3.81/4.04 ** KEPT (pick-wt=5): 190 [] subclass(domain_relation,cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=13): 192 [copy,191,demod,145,flip.1] single_valued1(A)=first(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)).
% 3.81/4.04 ---> New Demodulator: 193 [new_demod,192] single_valued1(A)=first(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)).
% 3.81/4.04 ** KEPT (pick-wt=13): 195 [copy,194,demod,145,flip.1] single_valued2(A)=second(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)).
% 3.81/4.04 ---> New Demodulator: 196 [new_demod,195] single_valued2(A)=second(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)).
% 3.81/4.04 ** KEPT (pick-wt=42): 198 [copy,197,demod,145,193,127,196,flip.1] single_valued3(A)=domain(A,image(domain_of(flip(cross_product(A,universal_class))),unordered_pair(first(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)),first(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)))),second(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation))).
% 3.81/4.04 ---> New Demodulator: 199 [new_demod,198] single_valued3(A)=domain(A,image(domain_of(flip(cross_product(A,universal_class))),unordered_pair(first(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)),first(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation)))),second(not_subclass_element(compose(A,domain_of(flip(cross_product(A,universal_class)))),identity_relation))).
% 3.81/4.04 ** KEPT (pick-wt=9): 200 [] intersection(complement(compose(element_relation,complement(identity_relation))),element_relation)=singleton_relation.
% 3.81/4.04 ---> New Demodulator: 201 [new_demod,200] intersection(complement(compose(element_relation,complement(identity_relation))),element_relation)=singleton_relation.
% 3.81/4.04 ** KEPT (pick-wt=7): 202 [] subclass(application_function,cross_product(universal_class,cross_product(universal_class,universal_class))).
% 3.81/4.04 ** KEPT (pick-wt=10): 204 [copy,203,demod,145,flip.1] symmetrization_of(A)=union(A,domain_of(flip(cross_product(A,universal_class)))).
% 3.81/4.04 ---> New Demodulator: 205 [new_demod,204] symmetrization_of(A)=union(A,domain_of(flip(cross_product(A,universal_class)))).
% 3.81/4.04 ** KEPT (pick-wt=12): 207 [copy,206,demod,127,flip.1] domain_of(restrict(A,B,unordered_pair(C,C)))=segment(A,B,C).
% 3.81/4.04 ---> New Demodulator: 208 [new_demod,207] domain_of(restrict(A,B,unordered_pair(C,C)))=segment(A,B,C).
% 3.81/4.04 ** KEPT (pick-wt=9): 210 [copy,209,demod,127] union(unordered_pair(null_class,null_class),image(successor_relation,ordinal_numbers))=kind_1_ordinals.
% 3.81/4.04 ---> New Demodulator: 211 [new_demod,210] union(unordered_pair(null_class,null_class),image(successor_relation,ordinal_numbers))=kind_1_ordinals.
% 3.81/4.04 ** KEPT (pick-wt=6): 212 [] intersection(complement(kind_1_ordinals),ordinal_numbers)=limit_ordinals.
% 3.81/4.04 ---> New Demodulator: 213 [new_demod,212] intersection(complement(kind_1_ordinals),ordinal_numbers)=limit_ordinals.
% 3.81/4.04 ** KEPT (pick-wt=6): 214 [] subclass(rest_of(A),cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=5): 215 [] subclass(rest_relation,cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=5): 216 [] subclass(union_of_range_map,cross_product(universal_class,universal_class)).
% 3.81/4.04 ** KEPT (pick-wt=10): 218 [copy,217,flip.1] ordinal_add(A,B)=apply(recursion(A,successor_relation,union_of_range_map),B).
% 3.81/4.04 ---> New Demodulator: 219 [new_demod,218] ordinal_add(A,B)=apply(recursion(A,successor_relation,union_of_range_map),B).
% 3.81/4.04 ** KEPT (pick-wt=10): 221 [copy,220,flip.1] ordinal_multiply(A,B)=recursion(null_class,apply(add_relation,A),union_of_range_map).
% 3.81/4.04 ---> New Demodulator: 222 [new_demod,221] ordinal_multiply(A,B)=recursion(null_class,apply(add_relation,A),union_of_range_map).
% 3.81/4.04 ** KEPT (pick-wt=7): 223 [] member(A,omega)|integer_of(A)=null_class.
% 3.81/4.04 ** KEPT (pick-wt=3): 224 [] subclass(ordinals_with_null_class_as_identity,ordinal_numbers).
% 3.81/4.08 Following clause subsumed by 121 during input processing: 0 [copy,121,flip.1] A=A.
% 3.81/4.08 121 back subsumes 112.
% 3.81/4.08 >>>> Starting back demodulation with 127.
% 3.81/4.08 >> back demodulating 35 with 127.
% 3.81/4.08 >> back demodulating 34 with 127.
% 3.81/4.08 >> back demodulating 21 with 127.
% 3.81/4.08 >> back demodulating 20 with 127.
% 3.81/4.08 >>>> Starting back demodulation with 130.
% 3.81/4.08 >>>> Starting back demodulation with 133.
% 3.81/4.08 >>>> Starting back demodulation with 136.
% 3.81/4.08 >>>> Starting back demodulation with 138.
% 3.81/4.08 >>>> Starting back demodulation with 140.
% 3.81/4.08 >>>> Starting back demodulation with 145.
% 3.81/4.08 >> back demodulating 80 with 145.
% 3.81/4.08 >> back demodulating 79 with 145.
% 3.81/4.08 >> back demodulating 45 with 145.
% 3.81/4.08 >> back demodulating 44 with 145.
% 3.81/4.08 >> back demodulating 40 with 145.
% 3.81/4.08 >> back demodulating 39 with 145.
% 3.81/4.08 >> back demodulating 37 with 145.
% 3.81/4.08 >> back demodulating 36 with 145.
% 3.81/4.08 >>>> Starting back demodulation with 148.
% 3.81/4.08 >> back demodulating 107 with 148.
% 3.81/4.08 >> back demodulating 106 with 148.
% 3.81/4.08 >> back demodulating 72 with 148.
% 3.81/4.08 >> back demodulating 71 with 148.
% 3.81/4.08 >> back demodulating 53 with 148.
% 3.81/4.08 >> back demodulating 52 with 148.
% 3.81/4.08 >> back demodulating 49 with 148.
% 3.81/4.08 >> back demodulating 48 with 148.
% 3.81/4.08 >>>> Starting back demodulation with 151.
% 3.81/4.08 >>>> Starting back demodulation with 154.
% 3.81/4.08 >>>> Starting back demodulation with 157.
% 3.81/4.08 >>>> Starting back demodulation with 160.
% 3.81/4.08 >> back demodulating 27 with 160.
% 3.81/4.08 >> back demodulating 26 with 160.
% 3.81/4.08 >>>> Starting back demodulation with 166.
% 3.81/4.08 >> back demodulating 95 with 166.
% 3.81/4.08 >> back demodulating 94 with 166.
% 3.81/4.08 >> back demodulating 93 with 166.
% 3.81/4.08 >> back demodulating 32 with 166.
% 3.81/4.08 >>>> Starting back demodulation with 169.
% 3.81/4.08 >> back demodulating 111 with 169.
% 3.81/4.08 >> back demodulating 33 with 169.
% 3.81/4.08 >>>> Starting back demodulation with 175.
% 3.81/4.08 >>>> Starting back demodulation with 179.
% 3.81/4.08 >>>> Starting back demodulation with 182.
% 3.81/4.08 >>>> Starting back demodulation with 184.
% 3.81/4.08 >>>> Starting back demodulation with 187.
% 3.81/4.08 >>>> Starting back demodulation with 193.
% 3.81/4.08 >>>> Starting back demodulation with 196.
% 3.81/4.08 >>>> Starting back demodulation with 199.
% 3.81/4.08 >>>> Starting back demodulation with 201.
% 3.81/4.08 >>>> Starting back demodulation with 205.
% 3.81/4.08 >> back demodulating 76 with 205.
% 3.81/4.08 >> back demodulating 75 with 205.
% 3.81/4.08 >>>> Starting back demodulation with 208.
% 3.81/4.08 >>>> Starting back demodulation with 211.
% 3.81/4.08 >>>> Starting back demodulation with 213.
% 3.81/4.08 >>>> Starting back demodulation with 219.
% 3.81/4.08 >> back demodulating 110 with 219.
% 3.81/4.08 >> back demodulating 109 with 219.
% 3.81/4.08 >>>> Starting back demodulation with 222.
% 3.81/4.08
% 3.81/4.08 ======= end of input processing =======
% 3.81/4.08
% 3.81/4.08 =========== start of search ===========
% 3.81/4.08
% 3.81/4.08
% 3.81/4.08 Resetting weight limit to 3.
% 3.81/4.08
% 3.81/4.08
% 3.81/4.08 Resetting weight limit to 3.
% 3.81/4.08
% 3.81/4.08 sos_size=83
% 3.81/4.08
% 3.81/4.08 Search stopped because sos empty.
% 3.81/4.08
% 3.81/4.08
% 3.81/4.08 Search stopped because sos empty.
% 3.81/4.08
% 3.81/4.08 ============ end of search ============
% 3.81/4.08
% 3.81/4.08 -------------- statistics -------------
% 3.81/4.08 clauses given 88
% 3.81/4.08 clauses generated 5325
% 3.81/4.08 clauses kept 208
% 3.81/4.08 clauses forward subsumed 38
% 3.81/4.08 clauses back subsumed 1
% 3.81/4.08 Kbytes malloced 5859
% 3.81/4.08
% 3.81/4.08 ----------- times (seconds) -----------
% 3.81/4.08 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 3.81/4.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.81/4.08 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.81/4.08
% 3.81/4.08 Process 24246 finished Wed Jul 27 10:12:40 2022
% 3.81/4.08 Otter interrupted
% 3.81/4.08 PROOF NOT FOUND
%------------------------------------------------------------------------------