TSTP Solution File: SEU377+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SEU377+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n026.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:57 EDT 2022

% Result   : Unknown 3.55s 3.74s
% Output   : None 
% Verified : 
% SZS Type : -

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