Consider a directed graph defined with a unary relation node and a binary base relation edge. Write rules to to determine if the graph is symmetric, i.e. if there is an arc from one node to a second node, then there is also an arc from the second to the first.