tplp-planning-benchmark/gc-ta1-tt1/ipc-2011_transport-sequential-satisficing_4.out

340 lines
25 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/transport-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/transport-sequential-satisficing/instances/instance-4.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-2011/domains/transport-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/transport-sequential-satisficing/instances/instance-4.pddl
Parsing...
Parsing: [0.050s CPU, 0.056s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
Preparing model... [0.030s CPU, 0.027s wall-clock]
Generated 26 rules.
Computing model... [2.130s CPU, 2.122s wall-clock]
15500 relevant atoms
12176 auxiliary atoms
27676 final queue length
55372 total queue pushes
Completing instantiation... [5.540s CPU, 5.536s wall-clock]
Instantiating: [7.750s CPU, 7.742s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.100s CPU, 0.101s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.029s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.012s wall-clock]
Building translation key... [0.010s CPU, 0.008s wall-clock]
Computing fact groups: [0.190s CPU, 0.193s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.240s CPU, 0.232s wall-clock]
Translating task: [4.430s CPU, 4.420s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
20 propositions removed
Detecting unreachable propositions: [2.300s CPU, 2.303s wall-clock]
Reordering and filtering variables...
20 of 20 variables necessary.
0 of 20 mutex groups necessary.
14496 of 14496 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.670s CPU, 0.665s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 644
Translator goal facts: 12
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 14496
Translator axioms: 0
Translator task size: 85636
Translator peak memory: 92108 KB
Writing output... [1.440s CPU, 1.594s wall-clock]
Done! [17.040s CPU, 17.180s wall-clock]
planner.py version 0.0.1
Time: 3.59s
Memory: 297MB
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: 297MB (+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
Expected Memory: 297MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 1.12s
Memory: 297MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.21s
Memory: 315MB (+18MB)
UNSAT
Iteration Time: 2.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
Expected Memory: 333.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 1.24s
Memory: 315MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 1.30s
Memory: 345MB (+30MB)
UNSAT
Iteration Time: 3.25s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 375.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 1.12s
Memory: 375MB (+30MB)
Unblocking actions...
Solving...
Solving Time: 2.74s
Memory: 419MB (+44MB)
UNKNOWN
Iteration Time: 4.53s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 493.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 1.18s
Memory: 452MB (+33MB)
Unblocking actions...
Solving...
Solving Time: 7.36s
Memory: 502MB (+50MB)
UNKNOWN
Iteration Time: 9.22s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 585.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 1.49s
Memory: 573MB (+71MB)
Unblocking actions...
Solving...
Solving Time: 7.60s
Memory: 646MB (+73MB)
UNKNOWN
Iteration Time: 9.82s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 790.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 1.13s
Memory: 651MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 1.24s
Memory: 680MB (+29MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 6.10s
Memory: 854MB (+174MB)
Solving...
Solving Time: 25.87s
Memory: 854MB (+0MB)
UNKNOWN
Iteration Time: 35.10s
Iteration 8
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 9.79s
Memory: 854MB (+0MB)
UNKNOWN
Iteration Time: 9.83s
Iteration 9
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 23.55s
Memory: 854MB (+0MB)
UNKNOWN
Iteration Time: 23.59s
Iteration 10
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 22.35s
Memory: 854MB (+0MB)
UNKNOWN
Iteration Time: 22.39s
Iteration 11
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 26.17s
Memory: 903MB (+49MB)
UNKNOWN
Iteration Time: 26.21s
Iteration 12
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Expected Memory: 1047.0MB
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 2.07s
Memory: 903MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 27.85s
Memory: 968MB (+65MB)
UNKNOWN
Iteration Time: 30.85s
Iteration 13
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 35
Expected Memory: 1112.0MB
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 2.12s
Memory: 981MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 36.43s
Memory: 1042MB (+61MB)
UNKNOWN
Iteration Time: 39.50s
Iteration 14
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 40
Expected Memory: 1186.0MB
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 2.08s
Memory: 1042MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 35.70s
Memory: 1158MB (+116MB)
UNKNOWN
Iteration Time: 38.74s
Iteration 15
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 45
Expected Memory: 1302.0MB
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 2.12s
Memory: 1158MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 36.89s
Memory: 1228MB (+70MB)
UNKNOWN
Iteration Time: 40.02s
Iteration 16
Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 50
Expected Memory: 1372.0MB
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 2.77s
Memory: 1336MB (+108MB)
Unblocking actions...
Solving...
Solving Time: 38.76s
Memory: 1401MB (+65MB)
UNKNOWN
Iteration Time: 42.58s
Iteration 17
Queue: [(12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 55
Expected Memory: 1574.0MB
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
Grounding Time: 2.02s
Memory: 1401MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 11.93s
Memory: 1452MB (+51MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 1452MB (+0MB)
Answer: 2
occurs(action(("drive","truck-1","city-2-loc-6","city-2-loc-5")),1) occurs(action(("drive","truck-3","city-2-loc-3","city-2-loc-6")),1) occurs(action(("drive","truck-2","city-2-loc-4","city-2-loc-8")),1) occurs(action(("drive","truck-4","city-2-loc-5","city-1-loc-12")),1) occurs(action(("drive","truck-3","city-2-loc-6","city-2-loc-5")),2) occurs(action(("drive","truck-2","city-2-loc-8","city-2-loc-6")),2) occurs(action(("drive","truck-1","city-2-loc-5","city-1-loc-12")),2) occurs(action(("drive","truck-4","city-1-loc-12","city-1-loc-3")),2) occurs(action(("drive","truck-2","city-2-loc-6","city-2-loc-5")),3) occurs(action(("drive","truck-1","city-1-loc-12","city-1-loc-3")),3) occurs(action(("drive","truck-3","city-2-loc-5","city-1-loc-12")),3) occurs(action(("drive","truck-4","city-1-loc-3","city-1-loc-10")),3) occurs(action(("drive","truck-1","city-1-loc-3","city-1-loc-10")),4) occurs(action(("drive","truck-2","city-2-loc-5","city-1-loc-12")),4) occurs(action(("drive","truck-3","city-1-loc-12","city-1-loc-1")),4) occurs(action(("drive","truck-4","city-1-loc-10","city-1-loc-9")),4) occurs(action(("pick-up","truck-1","city-1-loc-10","package-10","capacity-3","capacity-4")),5) occurs(action(("pick-up","truck-4","city-1-loc-9","package-1","capacity-1","capacity-2")),5) occurs(action(("drive","truck-2","city-1-loc-12","city-1-loc-3")),5) occurs(action(("drive","truck-3","city-1-loc-1","city-1-loc-7")),5) occurs(action(("drive","truck-1","city-1-loc-10","city-1-loc-3")),6) occurs(action(("drive","truck-2","city-1-loc-3","city-1-loc-10")),6) occurs(action(("drive","truck-3","city-1-loc-7","city-1-loc-8")),6) occurs(action(("drive","truck-4","city-1-loc-9","city-1-loc-10")),6) occurs(action(("pick-up","truck-2","city-1-loc-10","package-7","capacity-1","capacity-2")),7) occurs(action(("pick-up","truck-3","city-1-loc-8","package-11","capacity-3","capacity-4")),7) occurs(action(("drive","truck-1","city-1-loc-3","city-1-loc-12")),7) occurs(action(("drive","truck-4","city-1-loc-10","city-1-loc-3")),7) occurs(action(("drive","truck-1","city-1-loc-12","city-2-loc-5")),8) occurs(action(("drive","truck-2","city-1-loc-10","city-1-loc-3")),8) occurs(action(("drive","truck-3","city-1-loc-8","city-1-loc-10")),8) occurs(action(("drive","truck-4","city-1-loc-3","city-1-loc-12")),8) occurs(action(("drive","truck-1","city-2-loc-5","city-2-loc-15")),9) occurs(action(("drive","truck-2","city-1-loc-3","city-1-loc-12")),9) occurs(action(("drive","truck-3","city-1-loc-10","city-1-loc-3")),9) occurs(action(("drive","truck-4","city-1-loc-12","city-2-loc-5")),9) occurs(action(("drop","truck-1","city-2-loc-15","package-10","capacity-3","capacity-4")),10) occurs(action(("drive","truck-2","city-1-loc-12","city-2-loc-5")),10) occurs(action(("drive","truck-4","city-2-loc-5","city-2-loc-6")),10) occurs(action(("drive","truck-3","city-1-loc-3","city-1-loc-12")),10) occurs(action(("drive","truck-1","city-2-loc-15","city-2-loc-5")),11) occurs(action(("drive","truck-3","city-1-loc-12","city-2-loc-5")),11) occurs(action(("drive","truck-4","city-2-loc-6","city-2-loc-8")),11) occurs(action(("drive","truck-2","city-2-loc-5","city-2-loc-15")),11) occurs(action(("drive","truck-3","city-2-loc-5","city-2-loc-6")),12) occurs(action(("drive","truck-4","city-2-loc-8","city-2-loc-4")),12) occurs(action(("drive","truck-1","city-2-loc-5","city-1-loc-12")),12) occurs(action(("drive","truck-2","city-2-loc-15","city-2-loc-2")),12) occurs(action(("drop","truck-4","city-2-loc-4","package-1","capacity-1","capacity-2")),13) occurs(action(("drive","truck-2","city-2-loc-2","city-2-loc-12")),13) occurs(action(("drive","truck-3","city-2-loc-6","city-2-loc-8")),13) occurs(action(("drive","truck-1","city-1-loc-12","city-1-loc-3")),13) occurs(action(("drop","truck-2","city-2-loc-12","package-7","capacity-1","capacity-2")),14) occurs(action(("drive","truck-4","city-2-loc-4","city-2-loc-8")),14) occurs(action(("drive","truck-3","city-2-loc-8","city-2-loc-4")),14) occurs(action(("drive","truck-1","city-1-loc-3","city-1-loc-10")),14) occurs(action(("drop","truck-3","city-2-loc-4","package-11",
SATISFIABLE
Models : 1+
Calls : 18
Time : 353.370s (Solving: 313.20s 1st Model: 12.74s Unsat: 1.20s)
CPU Time : 353.392s
Choices : 9126891 (Domain: 9126399)
Conflicts : 148088 (Analyzed: 148087)
Restarts : 1391 (Average: 106.46 Last: 337)
Model-Level : 9126.5
Problems : 18 (Average Length: 32.00 Splits: 0)
Lemmas : 148087 (Deleted: 131245)
Binary : 5656 (Ratio: 3.82%)
Ternary : 949 (Ratio: 0.64%)
Conflict : 148087 (Average Length: 4158.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 148087 (Average: 32.51 Max: 9924 Sum: 4813657)
Executed : 147817 (Average: 32.47 Max: 9924 Sum: 4808039 Ratio: 99.88%)
Bounded : 270 (Average: 20.81 Max: 52 Sum: 5618 Ratio: 0.12%)
Rules : 1265892 (Original: 1265872)
Atoms : 288467
Bodies : 658812 (Original: 658791)
Count : 519 (Original: 526)
Equivalences : 338406 (Atom=Atom: 33 Body=Body: 0 Other: 338373)
Tight : Yes
Variables : 923135 (Eliminated: 0 Frozen: 810456)
Constraints : 9096756 (Binary: 99.2% Ternary: 0.4% Other: 0.4%)
Memory Peak : 1532MB
Max. Length : 60 steps
Sol. Length : 60 steps
Models : 2