158 lines
7.7 KiB
Plaintext
158 lines
7.7 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-14.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-14.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.020s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.017s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.180s CPU, 0.183s wall-clock]
|
|
1580 relevant atoms
|
|
947 auxiliary atoms
|
|
2527 final queue length
|
|
3598 total queue pushes
|
|
Completing instantiation... [0.230s CPU, 0.229s wall-clock]
|
|
Instantiating: [0.450s CPU, 0.455s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.023s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.018s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
3 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.004s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.060s CPU, 0.059s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.020s CPU, 0.014s wall-clock]
|
|
Translating task: [0.250s CPU, 0.249s wall-clock]
|
|
90 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
12 propositions removed
|
|
Detecting unreachable propositions: [0.140s CPU, 0.133s wall-clock]
|
|
Reordering and filtering variables...
|
|
15 of 15 variables necessary.
|
|
3 of 15 mutex groups necessary.
|
|
1158 of 1158 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.030s CPU, 0.036s wall-clock]
|
|
Translator variables: 15
|
|
Translator derived variables: 0
|
|
Translator facts: 195
|
|
Translator goal facts: 9
|
|
Translator mutex groups: 3
|
|
Translator total mutex groups size: 12
|
|
Translator operators: 1158
|
|
Translator axioms: 0
|
|
Translator task size: 4965
|
|
Translator peak memory: 39628 KB
|
|
Writing output... [0.090s CPU, 0.107s wall-clock]
|
|
Done! [1.060s CPU, 1.075s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.21s
|
|
Memory: 61MB
|
|
|
|
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: 61MB (+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.06s
|
|
Memory: 61MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 63MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
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.06s
|
|
Memory: 68MB (+5MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 70MB (+2MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 1.31s
|
|
Memory: 133MB (+63MB)
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 134MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 134MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("board-truck","driver3","truck1","s2")),1) occurs(action(("walk","driver1","s9","p7-9")),1) occurs(action(("walk","driver2","s2","p1-2")),1) occurs(action(("drive-truck","truck1","s2","s0","driver3")),2) occurs(action(("walk","driver1","p7-9","s7")),2) occurs(action(("walk","driver2","p1-2","s1")),2) occurs(action(("drive-truck","truck1","s0","s8","driver3")),3) occurs(action(("board-truck","driver2","truck2","s1")),3) occurs(action(("walk","driver1","s7","p3-7")),3) occurs(action(("drive-truck","truck1","s8","s6","driver3")),4) occurs(action(("drive-truck","truck2","s1","s3","driver2")),4) occurs(action(("walk","driver1","p3-7","s3")),4) occurs(action(("unload-truck","package5","truck2","s3")),5) occurs(action(("load-truck","package4","truck2","s3")),5) occurs(action(("drive-truck","truck2","s3","s9","driver2")),5) occurs(action(("disembark-truck","driver3","truck1","s6")),5) occurs(action(("walk","driver1","s3","p8-3")),5) occurs(action(("load-truck","package3","truck2","s9")),6) occurs(action(("drive-truck","truck2","s9","s4","driver2")),6) occurs(action(("walk","driver1","p8-3","s8")),6) occurs(action(("walk","driver3","s6","p6-2")),6) occurs(action(("unload-truck","package3","truck2","s4")),7) occurs(action(("unload-truck","package4","truck2","s4")),7) occurs(action(("load-truck","package6","truck2","s4")),7) occurs(action(("drive-truck","truck2","s4","s5","driver2")),7) occurs(action(("board-truck","driver1","truck3","s8")),7) occurs(action(("walk","driver3","p6-2","s2")),7) occurs(action(("unload-truck","package6","truck2","s5")),8) occurs(action(("load-truck","package1","truck2","s5")),8) occurs(action(("load-truck","package2","truck2","s5")),8) occurs(action(("drive-truck","truck2","s5","s0","driver2")),8) occurs(action(("walk","driver3","s2","p1-2")),8) occurs(action(("drive-truck","truck3","s8","s1","driver1")),8) occurs(action(("unload-truck","package1","truck2","s0")),9) occurs(action(("unload-truck","package2","truck2","s0")),9) occurs(action(("walk","driver3","p1-2","s1")),9) occurs(action(("drive-truck","truck3","s1","s3","driver1")),9) occurs(action(("drive-truck","truck2","s0","s2","driver2")),9) occurs(action(("drive-truck","truck2","s2","s3","driver2")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 1.603s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 1.584s
|
|
|
|
Choices : 674 (Domain: 661)
|
|
Conflicts : 116 (Analyzed: 116)
|
|
Restarts : 1 (Average: 116.00 Last: 16)
|
|
Model-Level : 129.0
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
|
Lemmas : 129 (Deleted: 0)
|
|
Binary : 14 (Ratio: 10.85%)
|
|
Ternary : 1 (Ratio: 0.78%)
|
|
Conflict : 116 (Average Length: 165.1 Ratio: 89.92%)
|
|
Loop : 13 (Average Length: 2.0 Ratio: 10.08%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 116 (Average: 3.41 Max: 54 Sum: 395)
|
|
Executed : 116 (Average: 3.41 Max: 54 Sum: 395 Ratio: 100.00%)
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
|
|
|
Rules : 837990
|
|
Acyc : 91800
|
|
Atoms : 746190
|
|
Bodies : 11 (Original: 10)
|
|
Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20)
|
|
Tight : Yes
|
|
Variables : 13935 (Eliminated: 0 Frozen: 5137)
|
|
Constraints : 41983 (Binary: 94.1% Ternary: 3.7% Other: 2.2%)
|
|
|
|
Memory Peak : 134MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 2
|
|
|
|
|