TSTP Solution File: SEU379+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU379+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:15:58 EDT 2022
% Result : Unknown 2.91s 3.14s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU379+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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 07:41:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.35/2.54 ----- Otter 3.3f, August 2004 -----
% 2.35/2.54 The process was started by sandbox2 on n003.cluster.edu,
% 2.35/2.54 Wed Jul 27 07:41:26 2022
% 2.35/2.54 The command was "./otter". The process ID is 12910.
% 2.35/2.54
% 2.35/2.54 set(prolog_style_variables).
% 2.35/2.54 set(auto).
% 2.35/2.54 dependent: set(auto1).
% 2.35/2.54 dependent: set(process_input).
% 2.35/2.54 dependent: clear(print_kept).
% 2.35/2.54 dependent: clear(print_new_demod).
% 2.35/2.54 dependent: clear(print_back_demod).
% 2.35/2.54 dependent: clear(print_back_sub).
% 2.35/2.54 dependent: set(control_memory).
% 2.35/2.54 dependent: assign(max_mem, 12000).
% 2.35/2.54 dependent: assign(pick_given_ratio, 4).
% 2.35/2.54 dependent: assign(stats_level, 1).
% 2.35/2.54 dependent: assign(max_seconds, 10800).
% 2.35/2.54 clear(print_given).
% 2.35/2.54
% 2.35/2.54 formula_list(usable).
% 2.35/2.54 all A (A=A).
% 2.35/2.54 all A B (one_sorted_str(A)&net_str(B,A)-> (strict_net_str(B,A)->B=net_str_of(A,the_carrier(B),the_InternalRel(B),the_mapping(A,B)))).
% 2.35/2.54 all A B (in(A,B)-> -in(B,A)).
% 2.35/2.54 all A (empty(A)->function(A)).
% 2.35/2.54 all A (empty(A)->relation(A)).
% 2.35/2.54 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 2.35/2.54 all A (rel_str(A)-> (empty_carrier(A)->v1_yellow_3(A))).
% 2.35/2.54 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.35/2.54 all A (rel_str(A)-> (-v1_yellow_3(A)-> -empty_carrier(A))).
% 2.35/2.54 all A (transitive_relstr(A)&rel_str(A)-> (all B (subrelstr(B,A)-> (full_subrelstr(B,A)->transitive_relstr(B)&full_subrelstr(B,A))))).
% 2.35/2.54 all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&net_str(B,A)-> (all C (is_eventually_in(A,B,C)<-> (exists D (element(D,the_carrier(B))& (all E (element(E,the_carrier(B))-> (related(B,D,E)->in(apply_netmap(A,B,E),C))))))))))).
% 2.35/2.54 all A (relation(A)&function(A)-> (all B C (C=relation_inverse_image(A,B)<-> (all D (in(D,C)<->in(D,relation_dom(A))&in(apply(A,D),B)))))).
% 2.35/2.54 all A (one_sorted_str(A)-> (all B (net_str(B,A)-> (all C D (strict_net_str(D,A)&subnetstr(D,A,B)-> (D=preimage_subnetstr(A,B,C)<->full_subrelstr(D,B)&subrelstr(D,B)&the_carrier(D)=function_invverse_img_as_carrier_subset(B,A,the_mapping(A,B),C))))))).
% 2.35/2.54 all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&net_str(B,A)-> (all C (element(C,the_carrier(B))->apply_netmap(A,B,C)=apply_on_structs(B,A,the_mapping(A,B),C)))))).
% 2.35/2.54 all A (one_sorted_str(A)-> (all B (net_str(B,A)-> (all C (net_str(C,A)-> (subnetstr(C,A,B)<->subrelstr(C,B)&the_mapping(A,C)=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)))))))).
% 2.35/2.54 all A B C D (one_sorted_str(A)&relation_of2(C,B,B)&function(D)&quasi_total(D,B,the_carrier(A))&relation_of2(D,B,the_carrier(A))->strict_net_str(net_str_of(A,B,C,D),A)&net_str(net_str_of(A,B,C,D),A)).
% 2.35/2.54 $T.
% 2.35/2.54 $T.
% 2.35/2.54 $T.
% 2.35/2.54 all A B C D (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&one_sorted_str(B)&function(C)&quasi_total(C,the_carrier(A),the_carrier(B))&relation_of2(C,the_carrier(A),the_carrier(B))&element(D,the_carrier(A))->element(apply_on_structs(A,B,C,D),the_carrier(B))).
% 2.35/2.54 $T.
% 2.35/2.54 $T.
% 2.35/2.54 $T.
% 2.35/2.54 all A B C (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&net_str(B,A)&element(C,the_carrier(B))->element(apply_netmap(A,B,C),the_carrier(A))).
% 2.35/2.54 all A B C D (one_sorted_str(A)&one_sorted_str(B)&function(C)&quasi_total(C,the_carrier(A),the_carrier(B))&relation_of2(C,the_carrier(A),the_carrier(B))->element(function_invverse_img_as_carrier_subset(A,B,C,D),powerset(the_carrier(A)))).
% 2.35/2.54 all A B C (one_sorted_str(A)&net_str(B,A)->strict_net_str(preimage_subnetstr(A,B,C),A)&subnetstr(preimage_subnetstr(A,B,C),A,B)).
% 2.35/2.54 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 2.35/2.54 all A B C D (relation_of2(C,A,B)->relation_of2_as_subset(relation_dom_restr_as_relation_of(A,B,C,D),A,B)).
% 2.35/2.54 all A (rel_str(A)->one_sorted_str(A)).
% 2.35/2.54 $T.
% 2.35/2.54 all A (one_sorted_str(A)-> (all B (net_str(B,A)->rel_str(B)))).
% 2.35/2.54 $T.
% 2.35/2.54 $T.
% 2.35/2.54 all A (rel_str(A)-> (all B (subrelstr(B,A)->rel_str(B)))).
% 2.35/2.54 all A B (one_sorted_str(A)&net_str(B,A)-> (all C (subnetstr(C,A,B)->net_str(C,A)))).
% 2.35/2.54 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 2.35/2.54 all A B (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&transitive_relstr(B)&directed_relstr(B)&net_str(B,A)-> (all C (subnet(C,A,B)-> -empty_carrier(C)&transitive_relstr(C)&directed_relstr(C)&net_str(C,A)))).
% 2.35/2.55 all A (rel_str(A)->relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A))).
% 2.35/2.55 $T.
% 2.35/2.55 all A B (one_sorted_str(A)&net_str(B,A)->function(the_mapping(A,B))&quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A))&relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A))).
% 2.35/2.55 exists A rel_str(A).
% 2.35/2.55 exists A one_sorted_str(A).
% 2.35/2.55 all A (one_sorted_str(A)-> (exists B net_str(B,A))).
% 2.35/2.55 all A B exists C relation_of2(C,A,B).
% 2.35/2.55 all A exists B element(B,A).
% 2.35/2.55 all A (rel_str(A)-> (exists B subrelstr(B,A))).
% 2.35/2.55 all A B (one_sorted_str(A)&net_str(B,A)-> (exists C subnetstr(C,A,B))).
% 2.35/2.55 all A B exists C relation_of2_as_subset(C,A,B).
% 2.35/2.55 all A B (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&transitive_relstr(B)&directed_relstr(B)&net_str(B,A)-> (exists C subnet(C,A,B))).
% 2.35/2.55 empty(empty_set).
% 2.35/2.55 relation(empty_set).
% 2.35/2.55 relation_empty_yielding(empty_set).
% 2.35/2.55 all A B (relation(A)&relation_empty_yielding(A)->relation(relation_dom_restriction(A,B))&relation_empty_yielding(relation_dom_restriction(A,B))).
% 2.35/2.55 all A (-v1_yellow_3(A)&rel_str(A)-> -empty(the_InternalRel(A))&relation(the_InternalRel(A))).
% 2.35/2.55 all A B (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&net_str(B,A)-> -empty(the_mapping(A,B))&relation(the_mapping(A,B))&function(the_mapping(A,B))&quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A))).
% 2.35/2.55 all A B C (one_sorted_str(A)&transitive_relstr(B)&net_str(B,A)->transitive_relstr(preimage_subnetstr(A,B,C))&strict_net_str(preimage_subnetstr(A,B,C),A)&full_subnetstr(preimage_subnetstr(A,B,C),A,B)).
% 2.35/2.55 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 2.35/2.55 all A (-empty(powerset(A))).
% 2.35/2.55 all A B (relation(A)&function(A)->relation(relation_dom_restriction(A,B))&function(relation_dom_restriction(A,B))).
% 2.35/2.55 empty(empty_set).
% 2.35/2.55 relation(empty_set).
% 2.35/2.55 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 2.35/2.55 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.35/2.55 all A B C D (one_sorted_str(A)& -empty(B)&relation_of2(C,B,B)&function(D)&quasi_total(D,B,the_carrier(A))&relation_of2(D,B,the_carrier(A))-> -empty_carrier(net_str_of(A,B,C,D))&strict_net_str(net_str_of(A,B,C,D),A)).
% 2.35/2.55 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.35/2.55 all A B C D (one_sorted_str(A)&relation_of2(C,B,B)&function(D)&quasi_total(D,B,the_carrier(A))&relation_of2(D,B,the_carrier(A))-> (all E F G H (net_str_of(A,B,C,D)=net_str_of(E,F,G,H)->A=E&B=F&C=G&D=H))).
% 2.35/2.55 exists A (relation(A)&function(A)).
% 2.35/2.55 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.35/2.55 exists A (empty(A)&relation(A)).
% 2.35/2.55 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.35/2.55 exists A (relation(A)&empty(A)&function(A)).
% 2.35/2.55 exists A (-empty(A)&relation(A)).
% 2.35/2.55 all A exists B (element(B,powerset(A))&empty(B)).
% 2.35/2.55 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.35/2.55 exists A (relation(A)&relation_empty_yielding(A)).
% 2.35/2.55 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 2.35/2.55 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.35/2.55 all A (one_sorted_str(A)-> (exists B (net_str(B,A)&strict_net_str(B,A)))).
% 2.35/2.55 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 2.35/2.55 all A B (one_sorted_str(A)&net_str(B,A)-> (exists C (subnetstr(C,A,B)&strict_net_str(C,A)&full_subnetstr(C,A,B)))).
% 2.35/2.55 all A B (one_sorted_str(A)& -empty_carrier(B)&net_str(B,A)-> (exists C (subnetstr(C,A,B)& -empty_carrier(C)&strict_net_str(C,A)&full_subnetstr(C,A,B)))).
% 2.35/2.55 all A B C D (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&one_sorted_str(B)&function(C)&quasi_total(C,the_carrier(A),the_carrier(B))&relation_of2(C,the_carrier(A),the_carrier(B))&element(D,the_carrier(A))->apply_on_structs(A,B,C,D)=apply(C,D)).
% 2.35/2.55 all A B C D (one_sorted_str(A)&one_sorted_str(B)&function(C)&quasi_total(C,the_carrier(A),the_carrier(B))&relation_of2(C,the_carrier(A),the_carrier(B))->function_invverse_img_as_carrier_subset(A,B,C,D)=relation_inverse_image(C,D)).
% 2.35/2.55 all A B C D (relation_of2(C,A,B)->relation_dom_restr_as_relation_of(A,B,C,D)=relation_dom_restriction(C,D)).
% 2.35/2.55 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 2.35/2.55 all A B subset(A,A).
% 2.35/2.55 all A B (in(A,B)->element(A,B)).
% 2.35/2.55 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.35/2.55 -(all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&transitive_relstr(B)&directed_relstr(B)&net_str(B,A)-> (all C D (subnet(D,A,B)-> (D=preimage_subnetstr(A,B,C)->is_eventually_in(A,D,C)))))))).
% 2.35/2.55 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.35/2.55 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.35/2.55 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.35/2.55 all A (empty(A)->A=empty_set).
% 2.35/2.55 all A B C (relation(C)&function(C)-> (in(B,A)->apply(relation_dom_restriction(C,A),B)=apply(C,B))).
% 2.35/2.55 all A B (-(in(A,B)&empty(B))).
% 2.35/2.55 all A B (-(empty(A)&A!=B&empty(B))).
% 2.35/2.55 end_of_list.
% 2.35/2.55
% 2.35/2.55 -------> usable clausifies to:
% 2.35/2.55
% 2.35/2.55 list(usable).
% 2.35/2.55 0 [] A=A.
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(B,A)|B=net_str_of(A,the_carrier(B),the_InternalRel(B),the_mapping(A,B)).
% 2.35/2.55 0 [] -in(A,B)| -in(B,A).
% 2.35/2.55 0 [] -empty(A)|function(A).
% 2.35/2.55 0 [] -empty(A)|relation(A).
% 2.35/2.55 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 2.35/2.55 0 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 2.35/2.55 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.35/2.55 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 2.35/2.55 0 [] -transitive_relstr(A)| -rel_str(A)| -subrelstr(B,A)| -full_subrelstr(B,A)|transitive_relstr(B).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)|element($f1(A,B,C),the_carrier(B)).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)| -element(E,the_carrier(B))| -related(B,$f1(A,B,C),E)|in(apply_netmap(A,B,E),C).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|element($f2(A,B,C,D),the_carrier(B)).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|related(B,D,$f2(A,B,C,D)).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))| -in(apply_netmap(A,B,$f2(A,B,C,D)),C).
% 2.35/2.55 0 [] -relation(A)| -function(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in(D,relation_dom(A)).
% 2.35/2.55 0 [] -relation(A)| -function(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in(apply(A,D),B).
% 2.35/2.55 0 [] -relation(A)| -function(A)|C!=relation_inverse_image(A,B)|in(D,C)| -in(D,relation_dom(A))| -in(apply(A,D),B).
% 2.35/2.55 0 [] -relation(A)| -function(A)|C=relation_inverse_image(A,B)|in($f3(A,B,C),C)|in($f3(A,B,C),relation_dom(A)).
% 2.35/2.55 0 [] -relation(A)| -function(A)|C=relation_inverse_image(A,B)|in($f3(A,B,C),C)|in(apply(A,$f3(A,B,C)),B).
% 2.35/2.55 0 [] -relation(A)| -function(A)|C=relation_inverse_image(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),relation_dom(A))| -in(apply(A,$f3(A,B,C)),B).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(D,A)| -subnetstr(D,A,B)|D!=preimage_subnetstr(A,B,C)|full_subrelstr(D,B).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(D,A)| -subnetstr(D,A,B)|D!=preimage_subnetstr(A,B,C)|subrelstr(D,B).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(D,A)| -subnetstr(D,A,B)|D!=preimage_subnetstr(A,B,C)|the_carrier(D)=function_invverse_img_as_carrier_subset(B,A,the_mapping(A,B),C).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(D,A)| -subnetstr(D,A,B)|D=preimage_subnetstr(A,B,C)| -full_subrelstr(D,B)| -subrelstr(D,B)|the_carrier(D)!=function_invverse_img_as_carrier_subset(B,A,the_mapping(A,B),C).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|apply_netmap(A,B,C)=apply_on_structs(B,A,the_mapping(A,B),C).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|subrelstr(C,B).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|the_mapping(A,C)=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)|subnetstr(C,A,B)| -subrelstr(C,B)|the_mapping(A,C)!=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|strict_net_str(net_str_of(A,B,C,D),A).
% 2.35/2.55 0 [] -one_sorted_str(A)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|net_str(net_str_of(A,B,C,D),A).
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|element(apply_on_structs(A,B,C,D),the_carrier(B)).
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|element(apply_netmap(A,B,C),the_carrier(A)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))|element(function_invverse_img_as_carrier_subset(A,B,C,D),powerset(the_carrier(A))).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|strict_net_str(preimage_subnetstr(A,B,C),A).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr(preimage_subnetstr(A,B,C),A,B).
% 2.35/2.55 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.35/2.55 0 [] -relation_of2(C,A,B)|relation_of2_as_subset(relation_dom_restr_as_relation_of(A,B,C,D),A,B).
% 2.35/2.55 0 [] -rel_str(A)|one_sorted_str(A).
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|net_str(C,A).
% 2.35/2.55 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)| -empty_carrier(C).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)|transitive_relstr(C).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)|directed_relstr(C).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)|net_str(C,A).
% 2.35/2.55 0 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 2.35/2.55 0 [] $T.
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.35/2.55 0 [] rel_str($c1).
% 2.35/2.55 0 [] one_sorted_str($c2).
% 2.35/2.55 0 [] -one_sorted_str(A)|net_str($f4(A),A).
% 2.35/2.55 0 [] relation_of2($f5(A,B),A,B).
% 2.35/2.55 0 [] element($f6(A),A).
% 2.35/2.55 0 [] -rel_str(A)|subrelstr($f7(A),A).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f8(A,B),A,B).
% 2.35/2.55 0 [] relation_of2_as_subset($f9(A,B),A,B).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)|subnet($f10(A,B),A,B).
% 2.35/2.55 0 [] empty(empty_set).
% 2.35/2.55 0 [] relation(empty_set).
% 2.35/2.55 0 [] relation_empty_yielding(empty_set).
% 2.35/2.55 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 2.35/2.55 0 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 2.35/2.55 0 [] v1_yellow_3(A)| -rel_str(A)| -empty(the_InternalRel(A)).
% 2.35/2.55 0 [] v1_yellow_3(A)| -rel_str(A)|relation(the_InternalRel(A)).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -empty(the_mapping(A,B)).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|relation(the_mapping(A,B)).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -transitive_relstr(B)| -net_str(B,A)|transitive_relstr(preimage_subnetstr(A,B,C)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -transitive_relstr(B)| -net_str(B,A)|strict_net_str(preimage_subnetstr(A,B,C),A).
% 2.35/2.55 0 [] -one_sorted_str(A)| -transitive_relstr(B)| -net_str(B,A)|full_subnetstr(preimage_subnetstr(A,B,C),A,B).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.35/2.55 0 [] -empty(powerset(A)).
% 2.35/2.55 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 2.35/2.55 0 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 2.35/2.55 0 [] empty(empty_set).
% 2.35/2.55 0 [] relation(empty_set).
% 2.35/2.55 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.35/2.55 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.35/2.55 0 [] -one_sorted_str(A)|empty(B)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))| -empty_carrier(net_str_of(A,B,C,D)).
% 2.35/2.55 0 [] -one_sorted_str(A)|empty(B)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|strict_net_str(net_str_of(A,B,C,D),A).
% 2.35/2.55 0 [] -empty(A)|empty(relation_dom(A)).
% 2.35/2.55 0 [] -empty(A)|relation(relation_dom(A)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|net_str_of(A,B,C,D)!=net_str_of(E,F,G,H)|A=E.
% 2.35/2.55 0 [] -one_sorted_str(A)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|net_str_of(A,B,C,D)!=net_str_of(E,F,G,H)|B=F.
% 2.35/2.55 0 [] -one_sorted_str(A)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|net_str_of(A,B,C,D)!=net_str_of(E,F,G,H)|C=G.
% 2.35/2.55 0 [] -one_sorted_str(A)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|net_str_of(A,B,C,D)!=net_str_of(E,F,G,H)|D=H.
% 2.35/2.55 0 [] relation($c3).
% 2.35/2.55 0 [] function($c3).
% 2.35/2.55 0 [] relation($c4).
% 2.35/2.55 0 [] relation_empty_yielding($c4).
% 2.35/2.55 0 [] function($c4).
% 2.35/2.55 0 [] empty($c5).
% 2.35/2.55 0 [] relation($c5).
% 2.35/2.55 0 [] empty(A)|element($f11(A),powerset(A)).
% 2.35/2.55 0 [] empty(A)| -empty($f11(A)).
% 2.35/2.55 0 [] relation($c6).
% 2.35/2.55 0 [] empty($c6).
% 2.35/2.55 0 [] function($c6).
% 2.35/2.55 0 [] -empty($c7).
% 2.35/2.55 0 [] relation($c7).
% 2.35/2.55 0 [] element($f12(A),powerset(A)).
% 2.35/2.55 0 [] empty($f12(A)).
% 2.35/2.55 0 [] relation($c8).
% 2.35/2.55 0 [] function($c8).
% 2.35/2.55 0 [] one_to_one($c8).
% 2.35/2.55 0 [] relation($c9).
% 2.35/2.55 0 [] relation_empty_yielding($c9).
% 2.35/2.55 0 [] one_sorted_str($c10).
% 2.35/2.55 0 [] -empty_carrier($c10).
% 2.35/2.55 0 [] relation($c11).
% 2.35/2.55 0 [] relation_empty_yielding($c11).
% 2.35/2.55 0 [] function($c11).
% 2.35/2.55 0 [] -one_sorted_str(A)|net_str($f13(A),A).
% 2.35/2.55 0 [] -one_sorted_str(A)|strict_net_str($f13(A),A).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f14(A),powerset(the_carrier(A))).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f14(A)).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f15(A,B),A,B).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|strict_net_str($f15(A,B),A).
% 2.35/2.55 0 [] -one_sorted_str(A)| -net_str(B,A)|full_subnetstr($f15(A,B),A,B).
% 2.35/2.55 0 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|subnetstr($f16(A,B),A,B).
% 2.35/2.55 0 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -empty_carrier($f16(A,B)).
% 2.35/2.55 0 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|strict_net_str($f16(A,B),A).
% 2.35/2.55 0 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|full_subnetstr($f16(A,B),A,B).
% 2.35/2.55 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|apply_on_structs(A,B,C,D)=apply(C,D).
% 2.35/2.55 0 [] -one_sorted_str(A)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))|function_invverse_img_as_carrier_subset(A,B,C,D)=relation_inverse_image(C,D).
% 2.35/2.55 0 [] -relation_of2(C,A,B)|relation_dom_restr_as_relation_of(A,B,C,D)=relation_dom_restriction(C,D).
% 2.35/2.55 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 2.35/2.55 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 2.35/2.55 0 [] subset(A,A).
% 2.35/2.55 0 [] -in(A,B)|element(A,B).
% 2.35/2.55 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.35/2.55 0 [] -empty_carrier($c15).
% 2.35/2.55 0 [] one_sorted_str($c15).
% 2.35/2.55 0 [] -empty_carrier($c14).
% 2.35/2.55 0 [] transitive_relstr($c14).
% 2.35/2.55 0 [] directed_relstr($c14).
% 2.35/2.55 0 [] net_str($c14,$c15).
% 2.35/2.55 0 [] subnet($c12,$c15,$c14).
% 2.35/2.55 0 [] $c12=preimage_subnetstr($c15,$c14,$c13).
% 2.35/2.55 0 [] -is_eventually_in($c15,$c12,$c13).
% 2.35/2.55 0 [] -element(A,powerset(B))|subset(A,B).
% 2.35/2.55 0 [] element(A,powerset(B))| -subset(A,B).
% 2.35/2.55 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.35/2.55 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.35/2.55 0 [] -empty(A)|A=empty_set.
% 2.35/2.55 0 [] -relation(C)| -function(C)| -in(B,A)|apply(relation_dom_restriction(C,A),B)=apply(C,B).
% 2.35/2.55 0 [] -in(A,B)| -empty(B).
% 2.35/2.55 0 [] -empty(A)|A=B| -empty(B).
% 2.35/2.55 end_of_list.
% 2.35/2.55
% 2.35/2.55 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 2.35/2.55
% 2.35/2.55 This ia a non-Horn set with equality. The strategy will be
% 2.35/2.55 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.35/2.55 deletion, with positive clauses in sos and nonpositive
% 2.35/2.55 clauses in usable.
% 2.35/2.55
% 2.35/2.55 dependent: set(knuth_bendix).
% 2.35/2.55 dependent: set(anl_eq).
% 2.35/2.55 dependent: set(para_from).
% 2.35/2.55 dependent: set(para_into).
% 2.35/2.55 dependent: clear(para_from_right).
% 2.35/2.55 dependent: clear(para_into_right).
% 2.35/2.55 dependent: set(para_from_vars).
% 2.35/2.55 dependent: set(eq_units_both_ways).
% 2.35/2.55 dependent: set(dynamic_demod_all).
% 2.35/2.55 dependent: set(dynamic_demod).
% 2.35/2.55 dependent: set(order_eq).
% 2.35/2.55 dependent: set(back_demod).
% 2.35/2.55 dependent: set(lrpo).
% 2.35/2.55 dependent: set(hyper_res).
% 2.35/2.55 dependent: set(unit_deletion).
% 2.35/2.55 dependent: set(factor).
% 2.35/2.55
% 2.35/2.55 ------------> process usable:
% 2.35/2.55 ** KEPT (pick-wt=19): 2 [copy,1,flip.4] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(B,A)|net_str_of(A,the_carrier(B),the_InternalRel(B),the_mapping(A,B))=B.
% 2.35/2.55 ** KEPT (pick-wt=6): 3 [] -in(A,B)| -in(B,A).
% 2.35/2.55 ** KEPT (pick-wt=4): 4 [] -empty(A)|function(A).
% 2.35/2.55 ** KEPT (pick-wt=4): 5 [] -empty(A)|relation(A).
% 2.35/2.55 ** KEPT (pick-wt=8): 6 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 2.35/2.55 ** KEPT (pick-wt=6): 7 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 2.35/2.55 ** KEPT (pick-wt=8): 8 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.35/2.55 Following clause subsumed by 7 during input processing: 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 2.35/2.55 ** KEPT (pick-wt=12): 9 [] -transitive_relstr(A)| -rel_str(A)| -subrelstr(B,A)| -full_subrelstr(B,A)|transitive_relstr(B).
% 2.35/2.55 ** KEPT (pick-wt=20): 10 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)|element($f1(A,B,C),the_carrier(B)).
% 2.35/2.55 ** KEPT (pick-wt=30): 11 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)| -element(D,the_carrier(B))| -related(B,$f1(A,B,C),D)|in(apply_netmap(A,B,D),C).
% 2.35/2.55 ** KEPT (pick-wt=25): 12 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|element($f2(A,B,C,D),the_carrier(B)).
% 2.35/2.55 ** KEPT (pick-wt=25): 13 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|related(B,D,$f2(A,B,C,D)).
% 2.35/2.55 ** KEPT (pick-wt=27): 14 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))| -in(apply_netmap(A,B,$f2(A,B,C,D)),C).
% 2.35/2.55 ** KEPT (pick-wt=16): 15 [] -relation(A)| -function(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in(D,relation_dom(A)).
% 2.35/2.55 ** KEPT (pick-wt=17): 16 [] -relation(A)| -function(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in(apply(A,D),C).
% 2.35/2.55 ** KEPT (pick-wt=21): 17 [] -relation(A)| -function(A)|B!=relation_inverse_image(A,C)|in(D,B)| -in(D,relation_dom(A))| -in(apply(A,D),C).
% 2.35/2.55 ** KEPT (pick-wt=22): 18 [] -relation(A)| -function(A)|B=relation_inverse_image(A,C)|in($f3(A,C,B),B)|in($f3(A,C,B),relation_dom(A)).
% 2.35/2.55 ** KEPT (pick-wt=23): 19 [] -relation(A)| -function(A)|B=relation_inverse_image(A,C)|in($f3(A,C,B),B)|in(apply(A,$f3(A,C,B)),C).
% 2.35/2.55 ** KEPT (pick-wt=30): 20 [] -relation(A)| -function(A)|B=relation_inverse_image(A,C)| -in($f3(A,C,B),B)| -in($f3(A,C,B),relation_dom(A))| -in(apply(A,$f3(A,C,B)),C).
% 2.35/2.55 ** KEPT (pick-wt=21): 21 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(C,A)| -subnetstr(C,A,B)|C!=preimage_subnetstr(A,B,D)|full_subrelstr(C,B).
% 2.35/2.55 ** KEPT (pick-wt=21): 22 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(C,A)| -subnetstr(C,A,B)|C!=preimage_subnetstr(A,B,D)|subrelstr(C,B).
% 2.35/2.55 ** KEPT (pick-wt=28): 23 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(C,A)| -subnetstr(C,A,B)|C!=preimage_subnetstr(A,B,D)|the_carrier(C)=function_invverse_img_as_carrier_subset(B,A,the_mapping(A,B),D).
% 2.35/2.55 ** KEPT (pick-wt=34): 24 [] -one_sorted_str(A)| -net_str(B,A)| -strict_net_str(C,A)| -subnetstr(C,A,B)|C=preimage_subnetstr(A,B,D)| -full_subrelstr(C,B)| -subrelstr(C,B)|the_carrier(C)!=function_invverse_img_as_carrier_subset(B,A,the_mapping(A,B),D).
% 2.35/2.55 ** KEPT (pick-wt=25): 25 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|apply_netmap(A,B,C)=apply_on_structs(B,A,the_mapping(A,B),C).
% 2.35/2.55 ** KEPT (pick-wt=15): 26 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|subrelstr(C,B).
% 2.35/2.55 ** KEPT (pick-wt=26): 27 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)| -subnetstr(C,A,B)|the_mapping(A,C)=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 2.35/2.55 ** KEPT (pick-wt=29): 28 [] -one_sorted_str(A)| -net_str(B,A)| -net_str(C,A)|subnetstr(C,A,B)| -subrelstr(C,B)|the_mapping(A,C)!=relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)).
% 2.35/2.55 ** KEPT (pick-wt=25): 29 [] -one_sorted_str(A)| -relation_of2(B,C,C)| -function(D)| -quasi_total(D,C,the_carrier(A))| -relation_of2(D,C,the_carrier(A))|strict_net_str(net_str_of(A,C,B,D),A).
% 2.35/2.55 ** KEPT (pick-wt=25): 30 [] -one_sorted_str(A)| -relation_of2(B,C,C)| -function(D)| -quasi_total(D,C,the_carrier(A))| -relation_of2(D,C,the_carrier(A))|net_str(net_str_of(A,C,B,D),A).
% 2.35/2.55 ** KEPT (pick-wt=34): 31 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|element(apply_on_structs(A,B,C,D),the_carrier(B)).
% 2.35/2.55 ** KEPT (pick-wt=20): 32 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|element(apply_netmap(A,B,C),the_carrier(A)).
% 2.35/2.55 ** KEPT (pick-wt=27): 33 [] -one_sorted_str(A)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))|element(function_invverse_img_as_carrier_subset(A,B,C,D),powerset(the_carrier(A))).
% 2.35/2.55 ** KEPT (pick-wt=11): 34 [] -one_sorted_str(A)| -net_str(B,A)|strict_net_str(preimage_subnetstr(A,B,C),A).
% 2.35/2.55 ** KEPT (pick-wt=12): 35 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr(preimage_subnetstr(A,B,C),A,B).
% 2.35/2.55 ** KEPT (pick-wt=6): 36 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=12): 37 [] -relation_of2(A,B,C)|relation_of2_as_subset(relation_dom_restr_as_relation_of(B,C,A,D),B,C).
% 2.35/2.55 ** KEPT (pick-wt=4): 38 [] -rel_str(A)|one_sorted_str(A).
% 2.35/2.55 ** KEPT (pick-wt=7): 39 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 2.35/2.55 ** KEPT (pick-wt=7): 40 [] -rel_str(A)| -subrelstr(B,A)|rel_str(B).
% 2.35/2.55 ** KEPT (pick-wt=12): 41 [] -one_sorted_str(A)| -net_str(B,A)| -subnetstr(C,A,B)|net_str(C,A).
% 2.35/2.55 ** KEPT (pick-wt=10): 42 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 2.35/2.55 ** KEPT (pick-wt=19): 43 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)| -empty_carrier(C).
% 2.35/2.55 ** KEPT (pick-wt=19): 44 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)|transitive_relstr(C).
% 2.35/2.55 ** KEPT (pick-wt=19): 45 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)|directed_relstr(C).
% 2.35/2.55 ** KEPT (pick-wt=20): 46 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)| -subnet(C,A,B)|net_str(C,A).
% 2.35/2.55 ** KEPT (pick-wt=9): 47 [] -rel_str(A)|relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)).
% 2.35/2.55 ** KEPT (pick-wt=9): 48 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=13): 49 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.35/2.55 ** KEPT (pick-wt=13): 50 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.35/2.55 ** KEPT (pick-wt=6): 51 [] -one_sorted_str(A)|net_str($f4(A),A).
% 2.35/2.55 ** KEPT (pick-wt=6): 52 [] -rel_str(A)|subrelstr($f7(A),A).
% 2.35/2.55 ** KEPT (pick-wt=11): 53 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f8(A,B),A,B).
% 2.35/2.55 ** KEPT (pick-wt=19): 54 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -transitive_relstr(B)| -directed_relstr(B)| -net_str(B,A)|subnet($f10(A,B),A,B).
% 2.35/2.55 Following clause subsumed by 36 during input processing: 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=8): 55 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=7): 56 [] v1_yellow_3(A)| -rel_str(A)| -empty(the_InternalRel(A)).
% 2.35/2.55 ** KEPT (pick-wt=7): 57 [] v1_yellow_3(A)| -rel_str(A)|relation(the_InternalRel(A)).
% 2.35/2.55 ** KEPT (pick-wt=13): 58 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -empty(the_mapping(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=13): 59 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|relation(the_mapping(A,B)).
% 2.35/2.55 Following clause subsumed by 48 during input processing: 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.35/2.55 Following clause subsumed by 49 during input processing: 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.35/2.55 ** KEPT (pick-wt=12): 60 [] -one_sorted_str(A)| -transitive_relstr(B)| -net_str(B,A)|transitive_relstr(preimage_subnetstr(A,B,C)).
% 2.35/2.55 Following clause subsumed by 34 during input processing: 0 [] -one_sorted_str(A)| -transitive_relstr(B)| -net_str(B,A)|strict_net_str(preimage_subnetstr(A,B,C),A).
% 2.35/2.55 ** KEPT (pick-wt=14): 61 [] -one_sorted_str(A)| -transitive_relstr(B)| -net_str(B,A)|full_subnetstr(preimage_subnetstr(A,B,C),A,B).
% 2.35/2.55 ** KEPT (pick-wt=7): 62 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.35/2.55 ** KEPT (pick-wt=3): 63 [] -empty(powerset(A)).
% 2.35/2.55 Following clause subsumed by 36 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=8): 64 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=8): 65 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=7): 66 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.35/2.55 ** KEPT (pick-wt=26): 67 [] -one_sorted_str(A)|empty(B)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))| -empty_carrier(net_str_of(A,B,C,D)).
% 2.35/2.55 Following clause subsumed by 29 during input processing: 0 [] -one_sorted_str(A)|empty(B)| -relation_of2(C,B,B)| -function(D)| -quasi_total(D,B,the_carrier(A))| -relation_of2(D,B,the_carrier(A))|strict_net_str(net_str_of(A,B,C,D),A).
% 2.35/2.55 ** KEPT (pick-wt=5): 68 [] -empty(A)|empty(relation_dom(A)).
% 2.35/2.55 ** KEPT (pick-wt=5): 69 [] -empty(A)|relation(relation_dom(A)).
% 2.35/2.55 ** KEPT (pick-wt=32): 70 [] -one_sorted_str(A)| -relation_of2(B,C,C)| -function(D)| -quasi_total(D,C,the_carrier(A))| -relation_of2(D,C,the_carrier(A))|net_str_of(A,C,B,D)!=net_str_of(E,F,G,H)|A=E.
% 2.35/2.55 ** KEPT (pick-wt=32): 71 [] -one_sorted_str(A)| -relation_of2(B,C,C)| -function(D)| -quasi_total(D,C,the_carrier(A))| -relation_of2(D,C,the_carrier(A))|net_str_of(A,C,B,D)!=net_str_of(E,F,G,H)|C=F.
% 2.35/2.55 ** KEPT (pick-wt=32): 72 [] -one_sorted_str(A)| -relation_of2(B,C,C)| -function(D)| -quasi_total(D,C,the_carrier(A))| -relation_of2(D,C,the_carrier(A))|net_str_of(A,C,B,D)!=net_str_of(E,F,G,H)|B=G.
% 2.35/2.55 ** KEPT (pick-wt=32): 73 [] -one_sorted_str(A)| -relation_of2(B,C,C)| -function(D)| -quasi_total(D,C,the_carrier(A))| -relation_of2(D,C,the_carrier(A))|net_str_of(A,C,B,D)!=net_str_of(E,F,G,H)|D=H.
% 2.35/2.55 ** KEPT (pick-wt=5): 74 [] empty(A)| -empty($f11(A)).
% 2.35/2.55 ** KEPT (pick-wt=2): 75 [] -empty($c7).
% 2.35/2.55 ** KEPT (pick-wt=2): 76 [] -empty_carrier($c10).
% 2.35/2.55 ** KEPT (pick-wt=6): 77 [] -one_sorted_str(A)|net_str($f13(A),A).
% 2.35/2.55 ** KEPT (pick-wt=6): 78 [] -one_sorted_str(A)|strict_net_str($f13(A),A).
% 2.35/2.55 ** KEPT (pick-wt=10): 79 [] empty_carrier(A)| -one_sorted_str(A)|element($f14(A),powerset(the_carrier(A))).
% 2.35/2.55 ** KEPT (pick-wt=7): 80 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f14(A)).
% 2.35/2.55 ** KEPT (pick-wt=11): 81 [] -one_sorted_str(A)| -net_str(B,A)|subnetstr($f15(A,B),A,B).
% 2.35/2.55 ** KEPT (pick-wt=10): 82 [] -one_sorted_str(A)| -net_str(B,A)|strict_net_str($f15(A,B),A).
% 2.35/2.55 ** KEPT (pick-wt=11): 83 [] -one_sorted_str(A)| -net_str(B,A)|full_subnetstr($f15(A,B),A,B).
% 2.35/2.55 ** KEPT (pick-wt=13): 84 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|subnetstr($f16(A,B),A,B).
% 2.35/2.55 ** KEPT (pick-wt=11): 85 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -empty_carrier($f16(A,B)).
% 2.35/2.55 ** KEPT (pick-wt=12): 86 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|strict_net_str($f16(A,B),A).
% 2.35/2.55 ** KEPT (pick-wt=13): 87 [] -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|full_subnetstr($f16(A,B),A,B).
% 2.35/2.55 ** KEPT (pick-wt=35): 88 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|apply_on_structs(A,B,C,D)=apply(C,D).
% 2.35/2.55 ** KEPT (pick-wt=27): 89 [] -one_sorted_str(A)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))|function_invverse_img_as_carrier_subset(A,B,C,D)=relation_inverse_image(C,D).
% 2.35/2.55 ** KEPT (pick-wt=13): 90 [] -relation_of2(A,B,C)|relation_dom_restr_as_relation_of(B,C,A,D)=relation_dom_restriction(A,D).
% 2.35/2.55 ** KEPT (pick-wt=8): 91 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 2.35/2.55 ** KEPT (pick-wt=8): 92 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 2.35/2.55 ** KEPT (pick-wt=6): 93 [] -in(A,B)|element(A,B).
% 2.35/2.55 ** KEPT (pick-wt=8): 94 [] -element(A,B)|empty(B)|in(A,B).
% 2.35/2.55 ** KEPT (pick-wt=2): 95 [] -empty_carrier($c15).
% 2.35/2.55 ** KEPT (pick-wt=2): 96 [] -empty_carrier($c14).
% 2.35/2.55 ** KEPT (pick-wt=4): 97 [] -is_eventually_in($c15,$c12,$c13).
% 2.35/2.55 ** KEPT (pick-wt=7): 98 [] -element(A,powerset(B))|subset(A,B).
% 2.35/2.55 ** KEPT (pick-wt=7): 99 [] element(A,powerset(B))| -subset(A,B).
% 2.35/2.55 ** KEPT (pick-wt=10): 100 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.35/2.55 ** KEPT (pick-wt=9): 101 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.35/2.55 ** KEPT (pick-wt=5): 102 [] -empty(A)|A=empty_set.
% 2.35/2.55 ** KEPT (pick-wt=16): 103 [] -relation(A)| -function(A)| -in(B,C)|apply(relation_dom_restriction(A,C),B)=apply(A,B).
% 2.35/2.55 ** KEPT (pick-wt=5): 104 [] -in(A,B)| -empty(B).
% 2.35/2.55 ** KEPT (pick-wt=7): 105 [] -empty(A)|A=B| -empty(B).
% 2.35/2.55
% 2.35/2.55 ------------> process sos:
% 2.35/2.55 ** KEPT (pick-wt=3): 139 [] A=A.
% 2.35/2.55 ** KEPT (pick-wt=2): 140 [] rel_str($c1).
% 2.35/2.55 ** KEPT (pick-wt=2): 141 [] one_sorted_str($c2).
% 2.35/2.55 ** KEPT (pick-wt=6): 142 [] relation_of2($f5(A,B),A,B).
% 2.35/2.55 ** KEPT (pick-wt=4): 143 [] element($f6(A),A).
% 2.35/2.55 ** KEPT (pick-wt=6): 144 [] relation_of2_as_subset($f9(A,B),A,B).
% 2.35/2.55 ** KEPT (pick-wt=2): 145 [] empty(empty_set).
% 2.35/2.55 ** KEPT (pick-wt=2): 146 [] relation(empty_set).
% 2.35/2.55 ** KEPT (pick-wt=2): 147 [] relation_empty_yielding(empty_set).
% 2.35/2.55 Following clause subsumed by 145 during input processing: 0 [] empty(empty_set).
% 2.35/2.55 Following clause subsumed by 146 during input processing: 0 [] relation(empty_set).
% 2.35/2.55 ** KEPT (pick-wt=2): 148 [] relation($c3).
% 2.35/2.55 ** KEPT (pick-wt=2): 149 [] function($c3).
% 2.35/2.55 ** KEPT (pick-wt=2): 150 [] relation($c4).
% 2.35/2.55 ** KEPT (pick-wt=2): 151 [] relation_empty_yielding($c4).
% 2.35/2.55 ** KEPT (pick-wt=2): 152 [] function($c4).
% 2.35/2.55 ** KEPT (pick-wt=2): 153 [] empty($c5).
% 2.35/2.55 ** KEPT (pick-wt=2): 154 [] relation($c5).
% 2.35/2.55 ** KEPT (pick-wt=7): 155 [] empty(A)|element($f11(A),powerset(A)).
% 2.35/2.55 ** KEPT (pick-wt=2): 156 [] relation($c6).
% 2.35/2.55 ** KEPT (pick-wt=2): 157 [] empty($c6).
% 2.35/2.55 ** KEPT (pick-wt=2): 158 [] function($c6).
% 2.35/2.55 ** KEPT (pick-wt=2): 159 [] relation($c7).
% 2.35/2.55 ** KEPT (pick-wt=5): 160 [] element($f12(A),powerset(A)).
% 2.35/2.55 ** KEPT (pick-wt=3): 161 [] empty($f12(A)).
% 2.35/2.55 ** KEPT (pick-wt=2): 162 [] relation($c8).
% 2.35/2.55 ** KEPT (pick-wt=2): 163 [] function($c8).
% 2.35/2.55 ** KEPT (pick-wt=2): 164 [] one_to_one($c8).
% 2.35/2.55 ** KEPT (pick-wt=2): 165 [] relation($c9).
% 2.35/2.55 ** KEPT (pick-wt=2): 166 [] relation_empty_yielding($c9).
% 2.35/2.55 ** KEPT (pick-wt=2): 167 [] one_sorted_str($c10).
% 2.35/2.55 ** KEPT (pick-wt=2): 168 [] relation($c11).
% 2.91/3.14 ** KEPT (pick-wt=2): 169 [] relation_empty_yielding($c11).
% 2.91/3.14 ** KEPT (pick-wt=2): 170 [] function($c11).
% 2.91/3.14 ** KEPT (pick-wt=3): 171 [] subset(A,A).
% 2.91/3.14 ** KEPT (pick-wt=2): 172 [] one_sorted_str($c15).
% 2.91/3.14 ** KEPT (pick-wt=2): 173 [] transitive_relstr($c14).
% 2.91/3.14 ** KEPT (pick-wt=2): 174 [] directed_relstr($c14).
% 2.91/3.14 ** KEPT (pick-wt=3): 175 [] net_str($c14,$c15).
% 2.91/3.14 ** KEPT (pick-wt=4): 176 [] subnet($c12,$c15,$c14).
% 2.91/3.14 ** KEPT (pick-wt=6): 178 [copy,177,flip.1] preimage_subnetstr($c15,$c14,$c13)=$c12.
% 2.91/3.14 ---> New Demodulator: 179 [new_demod,178] preimage_subnetstr($c15,$c14,$c13)=$c12.
% 2.91/3.14 Following clause subsumed by 139 during input processing: 0 [copy,139,flip.1] A=A.
% 2.91/3.14 139 back subsumes 138.
% 2.91/3.14 >>>> Starting back demodulation with 179.
% 2.91/3.14
% 2.91/3.14 ======= end of input processing =======
% 2.91/3.14
% 2.91/3.14 =========== start of search ===========
% 2.91/3.14
% 2.91/3.14
% 2.91/3.14 Resetting weight limit to 2.
% 2.91/3.14
% 2.91/3.14
% 2.91/3.14 Resetting weight limit to 2.
% 2.91/3.14
% 2.91/3.14 sos_size=221
% 2.91/3.14
% 2.91/3.14 Search stopped because sos empty.
% 2.91/3.14
% 2.91/3.14
% 2.91/3.14 Search stopped because sos empty.
% 2.91/3.14
% 2.91/3.14 ============ end of search ============
% 2.91/3.14
% 2.91/3.14 -------------- statistics -------------
% 2.91/3.14 clauses given 246
% 2.91/3.14 clauses generated 27961
% 2.91/3.14 clauses kept 425
% 2.91/3.14 clauses forward subsumed 142
% 2.91/3.14 clauses back subsumed 1
% 2.91/3.14 Kbytes malloced 5859
% 2.91/3.14
% 2.91/3.14 ----------- times (seconds) -----------
% 2.91/3.14 user CPU time 0.60 (0 hr, 0 min, 0 sec)
% 2.91/3.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.91/3.14 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.91/3.14
% 2.91/3.14 Process 12910 finished Wed Jul 27 07:41:29 2022
% 2.91/3.14 Otter interrupted
% 2.91/3.14 PROOF NOT FOUND
%------------------------------------------------------------------------------