157 lines
8.6 KiB
Plaintext
157 lines
8.6 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-15.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.029s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.020s CPU, 0.011s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.025s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.350s CPU, 0.348s wall-clock]
|
|
3250 relevant atoms
|
|
1604 auxiliary atoms
|
|
4854 final queue length
|
|
7326 total queue pushes
|
|
Completing instantiation... [0.520s CPU, 0.513s wall-clock]
|
|
Instantiating: [0.930s CPU, 0.920s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.024s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.040s CPU, 0.035s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
4 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.007s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.004s wall-clock]
|
|
Computing fact groups: [0.090s CPU, 0.090s 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.010s CPU, 0.002s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.030s CPU, 0.029s wall-clock]
|
|
Translating task: [0.580s CPU, 0.584s wall-clock]
|
|
192 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
16 propositions removed
|
|
Detecting unreachable propositions: [0.300s CPU, 0.298s wall-clock]
|
|
Reordering and filtering variables...
|
|
20 of 20 variables necessary.
|
|
4 of 20 mutex groups necessary.
|
|
2592 of 2592 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.080s CPU, 0.076s wall-clock]
|
|
Translator variables: 20
|
|
Translator derived variables: 0
|
|
Translator facts: 336
|
|
Translator goal facts: 10
|
|
Translator mutex groups: 4
|
|
Translator total mutex groups size: 20
|
|
Translator operators: 2592
|
|
Translator axioms: 0
|
|
Translator task size: 10978
|
|
Translator peak memory: 43980 KB
|
|
Writing output... [0.220s CPU, 0.237s wall-clock]
|
|
Done! [2.250s CPU, 2.265s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.45s
|
|
Memory: 77MB
|
|
|
|
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: 77MB (+0MB)
|
|
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
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.12s
|
|
Memory: 77MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 79MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.20s
|
|
|
|
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: 0.15s
|
|
Memory: 88MB (+9MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 93MB (+5MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 6.00s
|
|
Memory: 435MB (+342MB)
|
|
Solving...
|
|
Solving Time: 0.26s
|
|
Memory: 432MB (+-3MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 432MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("load-truck","package7","truck2","s9")),1) occurs(action(("walk","driver1","s8","p8-3")),1) occurs(action(("walk","driver2","s5","p5-9")),1) occurs(action(("walk","driver3","s5","p1-5")),1) occurs(action(("walk","driver4","s10","p10-0")),1) occurs(action(("walk","driver1","p8-3","s3")),2) occurs(action(("walk","driver2","p5-9","s9")),2) occurs(action(("walk","driver3","p1-5","s1")),2) occurs(action(("walk","driver4","p10-0","s0")),2) occurs(action(("walk","driver3","s1","p8-1")),3) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver4","s0","p0-6")),3) occurs(action(("walk","driver3","p8-1","s8")),4) occurs(action(("drive-truck","truck3","s3","s8","driver1")),4) occurs(action(("drive-truck","truck2","s9","s3","driver2")),4) occurs(action(("walk","driver4","p0-6","s6")),4) occurs(action(("load-truck","package1","truck2","s3")),5) occurs(action(("load-truck","package3","truck3","s8")),5) occurs(action(("load-truck","package6","truck3","s8")),5) occurs(action(("drive-truck","truck3","s8","s0","driver1")),5) occurs(action(("drive-truck","truck2","s3","s10","driver2")),5) occurs(action(("board-truck","driver4","truck4","s6")),5) occurs(action(("drive-truck","truck3","s0","s11","driver1")),6) occurs(action(("load-truck","package8","truck2","s10")),6) occurs(action(("unload-truck","package1","truck2","s10")),6) occurs(action(("unload-truck","package7","truck2","s10")),6) occurs(action(("drive-truck","truck2","s10","s3","driver2")),6) occurs(action(("drive-truck","truck4","s6","s10","driver4")),6) occurs(action(("unload-truck","package6","truck3","s11")),7) occurs(action(("load-truck","package1","truck4","s10")),7) occurs(action(("load-truck","package7","truck4","s10")),7) occurs(action(("drive-truck","truck4","s10","s2","driver4")),7) occurs(action(("drive-truck","truck2","s3","s0","driver2")),7) occurs(action(("drive-truck","truck3","s11","s0","driver1")),7) occurs(action(("unload-truck","package1","truck4","s2")),8) occurs(action(("unload-truck","package7","truck4","s2")),8) occurs(action(("unload-truck","package8","truck2","s0")),8) occurs(action(("load-truck","package2","truck4","s2")),8) occurs(action(("drive-truck","truck4","s2","s5","driver4")),8) occurs(action(("drive-truck","truck3","s0","s1","driver1")),8) occurs(action(("drive-truck","truck2","s0","s11","driver2")),8) occurs(action(("unload-truck","package2","truck4","s5")),9) occurs(action(("unload-truck","package3","truck3","s1")),9) occurs(action(("load-truck","package4","truck2","s11")),9) occurs(action(("drive-truck","truck2","s11","s7","driver2")),9) occurs(action(("load-truck","package5","truck3","s1")),9) occurs(action(("drive-truck","truck4","s5","s0","driver4")),9) occurs(action(("drive-truck","truck3","s1","s0","driver1")),9) occurs(action(("unload-truck","package4","truck2","s7")),10) occurs(action(("unload-truck","package5","truck3","s0")),10) occurs(action(("drive-truck","truck3","s0","s8","driver1")),10) occurs(action(("drive-truck","truck2","s7","s11","driver2")),10) occurs(action(("drive-truck","truck4","s0","s11","driver4")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 6.837s (Solving: 0.05s 1st Model: 0.04s Unsat: 0.00s)
|
|
CPU Time : 6.820s
|
|
|
|
Choices : 714 (Domain: 681)
|
|
Conflicts : 63 (Analyzed: 63)
|
|
Restarts : 0
|
|
Model-Level : 168.0
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
|
Lemmas : 63 (Deleted: 0)
|
|
Binary : 2 (Ratio: 3.17%)
|
|
Ternary : 0 (Ratio: 0.00%)
|
|
Conflict : 63 (Average Length: 200.4 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 63 (Average: 6.76 Max: 95 Sum: 426)
|
|
Executed : 61 (Average: 6.38 Max: 95 Sum: 402 Ratio: 94.37%)
|
|
Bounded : 2 (Average: 12.00 Max: 12 Sum: 24 Ratio: 5.63%)
|
|
|
|
Rules : 3015288
|
|
Atoms : 2995039
|
|
Bodies : 42654 (Original: 42653)
|
|
Equivalences : 124904 (Atom=Atom: 21812 Body=Body: 14376 Other: 88716)
|
|
Tight : No (SCCs: 508 Non-Hcfs: 0 Nodes: 36130 Gammas: 0)
|
|
Variables : 44000 (Eliminated: 0 Frozen: 24726)
|
|
Constraints : 84866 (Binary: 95.3% Ternary: 2.9% Other: 1.8%)
|
|
|
|
Memory Peak : 435MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 2
|
|
|
|
|