130 lines
7.1 KiB
Plaintext
130 lines
7.1 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.pddl']
|
||
|
|
INFO translator arguments: []
|
||
|
|
INFO translator time limit: None
|
||
|
|
INFO translator memory limit: None
|
||
|
|
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.027s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [1.940s CPU, 1.931s wall-clock]
|
||
|
|
17570 relevant atoms
|
||
|
|
6412 auxiliary atoms
|
||
|
|
23982 final queue length
|
||
|
|
56683 total queue pushes
|
||
|
|
Completing instantiation... [6.980s CPU, 6.981s wall-clock]
|
||
|
|
Instantiating: [9.010s CPU, 8.997s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.120s CPU, 0.124s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.050s CPU, 0.059s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.240s CPU, 0.245s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.270s CPU, 0.270s wall-clock]
|
||
|
|
Translating task: [5.300s CPU, 5.291s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
52 propositions removed
|
||
|
|
Detecting unreachable propositions: [2.660s CPU, 2.665s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
52 of 52 variables necessary.
|
||
|
|
0 of 52 mutex groups necessary.
|
||
|
|
16665 of 16665 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.780s CPU, 0.781s wall-clock]
|
||
|
|
Translator variables: 52
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 681
|
||
|
|
Translator goal facts: 1
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 16665
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 98645
|
||
|
|
Translator peak memory: 100988 KB
|
||
|
|
Writing output... [1.690s CPU, 1.843s wall-clock]
|
||
|
|
Done! [19.930s CPU, 20.083s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 4.22s
|
||
|
|
Memory: 332MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 332MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.02s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 1.26s
|
||
|
|
Memory: 332MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("overcome","anxiety","curiosity","turkey","uranus","mars")),1) occurs(action(("overcome","dread","empathy","onion","uranus","mars")),1) occurs(action(("overcome","jealousy","satisfaction","pistachio","neptune","earth")),1) occurs(action(("overcome","loneliness","stimulation","lobster","mars","neptune")),1) occurs(action(("feast","aesthetics","cucumber","lobster","goias","surrey")),1) occurs(action(("feast","curiosity","turkey","cantelope","oregon","goias")),1) occurs(action(("feast","empathy","onion","haroset","oregon","goias")),1) occurs(action(("feast","entertainment","pepper","bacon","goias","surrey")),1) occurs(action(("feast","expectation","lamb","cantelope","alsace","arizona")),1) occurs(action(("feast","learning","broccoli","lemon","surrey","moravia")),1) occurs(action(("feast","lubricity","okra","pistachio","surrey","moravia")),1) occurs(action(("feast","satisfaction","pistachio","broccoli","surrey","moravia")),1) occurs(action(("feast","stimulation","lobster","cucumber","bavaria","alsace")),1) occurs(action(("feast","understanding","cod","pea","pennsylvania","quebec")),1) occurs(action(("overcome","grief","entertainment","bacon","uranus","mars")),2) occurs(action(("overcome","laceration","satisfaction","broccoli","mars","neptune")),2) occurs(action(("overcome","sciatica","stimulation","cucumber","uranus","mars")),2) occurs(action(("overcome","boils","understanding","pea","uranus","mars")),2) occurs(action(("feast","empathy","haroset","lemon","surrey","moravia")),2) occurs(action(("feast","expectation","cantelope","turkey","moravia","bavaria")),2) occurs(action(("feast","learning","lemon","cod","bavaria","alsace")),2) occurs(action(("feast","satisfaction","broccoli","lemon","goias","surrey")),2) occurs(action(("feast","stimulation","cucumber","lobster","oregon","goias")),2) occurs(action(("feast","curiosity","cantelope","chicken","surrey","moravia")),3) occurs(action(("feast","satisfaction","lemon","cod","moravia","bavaria")),3) occurs(action(("feast","satisfaction","cod","chicken","bosnia","pennsylvania")),4) occurs(action(("feast","learning","cod","pea","bosnia","pennsylvania")),4) occurs(action(("succumb","jealousy","satisfaction","chicken","mars","neptune")),5) occurs(action(("succumb","laceration","satisfaction","chicken","mars","neptune")),5) occurs(action(("feast","empathy","lemon","broccoli","surrey","moravia")),5)
|
||
|
|
Solving Time: 0.25s
|
||
|
|
Memory: 346MB (+14MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 6.706s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 6.564s
|
||
|
|
|
||
|
|
Choices : 460 (Domain: 365)
|
||
|
|
Conflicts : 62 (Analyzed: 62)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 159.0
|
||
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
|
Lemmas : 62 (Deleted: 0)
|
||
|
|
Binary : 11 (Ratio: 17.74%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 62 (Average Length: 13.9 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 62 (Average: 5.19 Max: 70 Sum: 322)
|
||
|
|
Executed : 60 (Average: 4.97 Max: 70 Sum: 308 Ratio: 95.65%)
|
||
|
|
Bounded : 2 (Average: 7.00 Max: 7 Sum: 14 Ratio: 4.35%)
|
||
|
|
|
||
|
|
Rules : 298781
|
||
|
|
Atoms : 298781
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 73020 (Eliminated: 0 Frozen: 2373)
|
||
|
|
Constraints : 158106 (Binary: 98.0% Ternary: 0.9% Other: 1.1%)
|
||
|
|
|
||
|
|
Memory Peak : 346MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
|
||
|
|
|