A proof-checking experiment on representing graphs as membership digraphs