Question: I want to write a reminder program using python. But for some reason, when I read the file it returns nothing. Here's my code,

```
print ("(1)Add something to list\n(2)Read my lists")
option = input ("Please select an option: ")
myFile = open ("Reminder.txt", "a+")
if option == '1':
    ask = input ("What do you want to remember: ")
    myFile.write (ask + "\n")
    myFile.close()
    print ("Successfully added in database")
elif option == '2':
    AllFileContents = myFile.read()
    print (AllFileContents)
else:
    print ("Please select an existing option!")

```

And this is the output I get after adding something to list(I'm using microsoft visual studio):

<https://i.stack.imgur.com/DuS9W.png>

Please help.

Answer: 
You can't do this, except if you accept an exponential blowup in atoms and even than it isn't that easy. You can't enumerate answer sets in a single answer set (the complexity for enumerating is higher, so you can't solve `n` NP problems (enumeration) inside one NP problem (except you describe `n` NP problems in your encoding, which is not practical).

Maybe you can describe what you are trying to achieve and there are other ways of how to do this.

Your problem could be solveable with disjunctive rules, as then the complexity rises to NP^2.
Edit: I found that <https://github.com/potassco/guess_and_check> could exactly do what you are looking for to describe a NP^2 problem without manually writing the disjunctive logic program.
you can also have a look at section 3.3.2 of the following paper:

* <https://arxiv.org/abs/2008.06692>

The method presented there allows you to compute `m` different stable models of a logic program by finding `m` `1`-diverse stable models. But note that `m` has to be given as input, hence the method is not directly applicable to the problem of computing one stable model that contains all stable models of a logic program.