174 lines
8.2 KiB
Plaintext
174 lines
8.2 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-16.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-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-16.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.021s 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.020s CPU, 0.020s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.270s CPU, 0.273s wall-clock]
|
||
|
|
1870 relevant atoms
|
||
|
|
1665 auxiliary atoms
|
||
|
|
3535 final queue length
|
||
|
|
6814 total queue pushes
|
||
|
|
Completing instantiation... [0.540s CPU, 0.537s wall-clock]
|
||
|
|
Instantiating: [0.860s CPU, 0.860s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.042s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.008s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
63 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Computing fact groups: [0.080s CPU, 0.072s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.030s CPU, 0.028s wall-clock]
|
||
|
|
Translating task: [0.640s CPU, 0.635s wall-clock]
|
||
|
|
2052 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
45 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.300s CPU, 0.305s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
36 of 54 variables necessary.
|
||
|
|
3 of 12 mutex groups necessary.
|
||
|
|
1428 of 1428 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.130s CPU, 0.130s wall-clock]
|
||
|
|
Translator variables: 36
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 237
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 21
|
||
|
|
Translator operators: 1428
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 10632
|
||
|
|
Translator peak memory: 43468 KB
|
||
|
|
Writing output... [0.190s CPU, 0.207s wall-clock]
|
||
|
|
Done! [2.240s CPU, 2.260s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.45s
|
||
|
|
Memory: 78MB
|
||
|
|
|
||
|
|
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.00s
|
||
|
|
Memory: 79MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 79MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.12s
|
||
|
|
Memory: 79MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 80MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.19s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 81.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.14s
|
||
|
|
Memory: 85MB (+5MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 89MB (+4MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.49s
|
||
|
|
Memory: 107MB (+18MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.22s
|
||
|
|
Memory: 105MB (+-2MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 2.92s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 114.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.22s
|
||
|
|
Memory: 107MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.72s
|
||
|
|
Memory: 115MB (+8MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 115MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("move","hoist0","depot0-1-3","depot0-1-2")),1) occurs(action(("go-out","hoist1","depot1-2-3","loadarea")),1) occurs(action(("move","hoist2","depot1-2-2","depot1-2-1")),1) occurs(action(("move","hoist0","depot0-1-2","depot0-2-2")),2) occurs(action(("lift","hoist1","crate5","container-1-1","loadarea","container1")),2) occurs(action(("move","hoist2","depot1-2-1","depot1-1-1")),2) occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),3) occurs(action(("go-in","hoist1","loadarea","depot1-2-3")),3) occurs(action(("drop","hoist1","crate5","depot1-2-2","depot1-2-3","depot1")),4) occurs(action(("lift","hoist0","crate2","container-0-2","loadarea","container0")),4) occurs(action(("go-in","hoist0","loadarea","depot0-2-2")),5) occurs(action(("go-out","hoist1","depot1-2-3","loadarea")),5) occurs(action(("drop","hoist0","crate2","depot0-1-2","depot0-2-2","depot0")),6) occurs(action(("lift","hoist1","crate4","container-1-0","loadarea","container1")),6) occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),7) occurs(action(("go-in","hoist1","loadarea","depot1-2-3")),7) occurs(action(("drop","hoist1","crate4","depot1-1-3","depot1-2-3","depot1")),8) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),8) occurs(action(("go-in","hoist0","loadarea","depot0-2-2")),9) occurs(action(("go-out","hoist1","depot1-2-3","loadarea")),9) occurs(action(("move","hoist2","depot1-1-1","depot1-2-1")),9) occurs(action(("drop","hoist0","crate1","depot0-2-1","depot0-2-2","depot0")),10) occurs(action(("lift","hoist1","crate0","container-0-0","loadarea","container0")),10) occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),11) occurs(action(("move","hoist2","depot1-2-1","depot1-1-1")),11) occurs(action(("drop","hoist1","crate0","depot0-2-2","loadarea","depot0")),12) occurs(action(("lift","hoist0","crate3","container-0-3","loadarea","container0")),12) occurs(action(("move","hoist2","depot1-1-1","depot1-1-2")),12) occurs(action(("drop","hoist0","crate3","depot1-2-3","loadarea","depot1")),13) occurs(action(("move","hoist2","depot1-1-2","depot1-1-1")),13) occurs(action(("go-in","hoist1","loadarea","container-0-0")),13) occurs(action(("go-in","hoist0","loadarea","container-0-3")),14) occurs(action(("go-out","hoist1","container-0-0","loadarea")),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 4.222s (Solving: 2.93s 1st Model: 0.72s Unsat: 0.01s)
|
||
|
|
CPU Time : 4.204s
|
||
|
|
|
||
|
|
Choices : 39023 (Domain: 36824)
|
||
|
|
Conflicts : 12232 (Analyzed: 12231)
|
||
|
|
Restarts : 120 (Average: 101.92 Last: 81)
|
||
|
|
Model-Level : 88.0
|
||
|
|
Problems : 5 (Average Length: 10.00 Splits: 0)
|
||
|
|
Lemmas : 12231 (Deleted: 9369)
|
||
|
|
Binary : 32 (Ratio: 0.26%)
|
||
|
|
Ternary : 17 (Ratio: 0.14%)
|
||
|
|
Conflict : 12231 (Average Length: 385.2 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 12231 (Average: 3.01 Max: 46 Sum: 36874)
|
||
|
|
Executed : 12229 (Average: 3.01 Max: 46 Sum: 36872 Ratio: 99.99%)
|
||
|
|
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.01%)
|
||
|
|
|
||
|
|
Rules : 61710 (Original: 61631)
|
||
|
|
Atoms : 35745
|
||
|
|
Bodies : 17723 (Original: 17650)
|
||
|
|
Count : 239 (Original: 251)
|
||
|
|
Equivalences : 9314 (Atom=Atom: 29 Body=Body: 0 Other: 9285)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 27910 (Eliminated: 0 Frozen: 19132)
|
||
|
|
Constraints : 241120 (Binary: 97.2% Ternary: 1.4% Other: 1.4%)
|
||
|
|
|
||
|
|
Memory Peak : 115MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|