(node9, node10)
]
inequality_list = [
(node9, node1)
]
# Print message.
print ' ... Done'
print ''
print 'Merging...'
print '####################'
# Execute the merges.
alg = Algorithm(merge_list, inequality_list)
alg.merge_nodes()
# Print message.
print '####################'
print ' ... Done'
print ''
print 'Checking satisfiabilty...'
# Check for satisfiability.
satisfiable = alg.check_satisfiability()
# Print message.
if satisfiable:
print ' => Satisfiable'
else:
print ' => Unsatisfiable'
node18.find = node12
# Create the lists to check.
merge_list = [(node1, node2), (node5, node6), (node9, node10)]
inequality_list = [(node9, node1)]
# Print message.
print ' ... Done'
print ''
print 'Merging...'
print '####################'
# Execute the merges.
alg = Algorithm(merge_list, inequality_list)
alg.merge_nodes()
# Print message.
print '####################'
print ' ... Done'
print ''
print 'Checking satisfiabilty...'
# Check for satisfiability.
satisfiable = alg.check_satisfiability()
# Print message.
if satisfiable:
print ' => Satisfiable'
else:
print ' => Unsatisfiable'
