156 lines
6.7 KiB
Plaintext
156 lines
6.7 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-13.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-13.pddl
|
|
Parsing...
|
|
Parsing: [0.040s CPU, 0.035s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.032s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.033s wall-clock]
|
|
Generated 42 rules.
|
|
Computing model... [1.990s CPU, 1.988s wall-clock]
|
|
19584 relevant atoms
|
|
7514 auxiliary atoms
|
|
27098 final queue length
|
|
61437 total queue pushes
|
|
Completing instantiation... [6.900s CPU, 6.892s wall-clock]
|
|
Instantiating: [8.980s CPU, 8.980s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.130s CPU, 0.124s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
|
Instantiating groups... [0.120s CPU, 0.125s wall-clock]
|
|
Collecting mutex groups... [0.010s CPU, 0.008s wall-clock]
|
|
Choosing groups...
|
|
6 uncovered facts
|
|
Choosing groups: [0.020s CPU, 0.024s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.016s wall-clock]
|
|
Computing fact groups: [0.370s CPU, 0.370s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.011s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.006s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.010s CPU, 0.008s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.260s CPU, 0.262s wall-clock]
|
|
Translating task: [4.920s CPU, 4.918s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
88 propositions removed
|
|
Detecting unreachable propositions: [2.580s CPU, 2.583s wall-clock]
|
|
Reordering and filtering variables...
|
|
76 of 76 variables necessary.
|
|
0 of 76 mutex groups necessary.
|
|
17845 of 17845 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.770s CPU, 0.767s wall-clock]
|
|
Translator variables: 76
|
|
Translator derived variables: 0
|
|
Translator facts: 1427
|
|
Translator goal facts: 2
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 17845
|
|
Translator axioms: 0
|
|
Translator task size: 108118
|
|
Translator peak memory: 103972 KB
|
|
Writing output... [1.730s CPU, 1.900s wall-clock]
|
|
Done! [19.640s CPU, 19.802s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 4.10s
|
|
Memory: 333MB
|
|
|
|
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: 333MB (+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.75s
|
|
Memory: 333MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.34s
|
|
Memory: 346MB (+13MB)
|
|
UNSAT
|
|
Iteration Time: 3.04s
|
|
|
|
Iteration 3
|
|
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 5
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 1.56s
|
|
Memory: 376MB (+30MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 2.15s
|
|
Memory: 430MB (+54MB)
|
|
UNSAT
|
|
Iteration Time: 4.57s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 1.64s
|
|
Memory: 474MB (+44MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("feast","love","baguette","lemon","alsace","bavaria")),1) occurs(action(("overcome","laceration-20","love","lemon","vulcan","venus")),2) occurs(action(("feast","love","lemon","onion","bavaria","quebec")),3) occurs(action(("feast","love","onion","turkey","oregon","alsace")),4) occurs(action(("feast","love","turkey","potato","alsace","bavaria")),5) occurs(action(("feast","love","potato","muffin","oregon","alsace")),6) occurs(action(("feast","aesthetics","hamburger","scallion","alsace","bavaria")),7) occurs(action(("feast","love","muffin","ham","alsace","bavaria")),8) occurs(action(("feast","aesthetics","scallion","flounder","oregon","alsace")),9) occurs(action(("feast","aesthetics","flounder","lemon","bavaria","quebec")),10) occurs(action(("overcome","prostatitis-18","aesthetics","lemon","mars","neptune")),11) occurs(action(("feast","aesthetics","lemon","baguette","alsace","bavaria")),12) occurs(action(("feast","aesthetics","baguette","lobster","oregon","alsace")),13) occurs(action(("succumb","prostatitis-18","aesthetics","lobster","mars","neptune")),14) occurs(action(("succumb","laceration-20","love","ham","vulcan","venus")),15)
|
|
Solving Time: 2.62s
|
|
Memory: 548MB (+74MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 17.081s (Solving: 4.65s 1st Model: 2.53s Unsat: 2.11s)
|
|
CPU Time : 16.850s
|
|
|
|
Choices : 5298
|
|
Conflicts : 2654 (Analyzed: 2652)
|
|
Restarts : 29 (Average: 91.45 Last: 42)
|
|
Model-Level : 26.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 2652 (Deleted: 0)
|
|
Binary : 322 (Ratio: 12.14%)
|
|
Ternary : 182 (Ratio: 6.86%)
|
|
Conflict : 2652 (Average Length: 435.1 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 2652 (Average: 2.20 Max: 92 Sum: 5822)
|
|
Executed : 2571 (Average: 1.97 Max: 92 Sum: 5221 Ratio: 89.68%)
|
|
Bounded : 81 (Average: 7.42 Max: 17 Sum: 601 Ratio: 10.32%)
|
|
|
|
Rules : 326370
|
|
Atoms : 326370
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 289050 (Eliminated: 0 Frozen: 265707)
|
|
Constraints : 1746930 (Binary: 98.1% Ternary: 0.9% Other: 1.0%)
|
|
|
|
Memory Peak : 548MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|