original_docstring: 
      each max node that corresponds to a decision variable D appears at most once in every path from root to leaves
      
docstring: each max node that corresponds to a decision variable D appears at most once in every path from root to leaves
docstring_tokens: each max node that corresponds to a decision variable D appears at most once in every path from root to leaves
code: def is_max_unique(node):
      '''
      each max node that corresponds to a decision variable D appears at most once in every path from root to leaves
      '''
  
      assert node is not None
  
      for max_node in reversed(get_nodes_by_type(node, Max)):
          check_children_max(max_node, max_node.name)
         
      return True, None
code_tokens: def is_max_unique ( node ) : assert node is not None for max_node in reversed ( get_nodes_by_type ( node , Max ) ) : check_children_max ( max_node , max_node . name ) return True , None
short_docstring: each max node that corresponds to a decision variable D appears at most once in every path from root to leaves
short_docstring_tokens: each max node that corresponds to a decision variable D appears at most once in every path from root to leaves
comment: '''
      each max node that corresponds to a decision variable D appears at most once in every path from root to leaves
      '''