1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-1998_grid-round-2-strips_4.out

233 lines
9.8 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-4.pddl
Parsing...
Parsing: [0.050s CPU, 0.048s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.013s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.025s wall-clock]
Preparing model... [0.040s CPU, 0.041s wall-clock]
Generated 46 rules.
Computing model... [1.280s CPU, 1.284s wall-clock]
12552 relevant atoms
4521 auxiliary atoms
17073 final queue length
37368 total queue pushes
Completing instantiation... [3.860s CPU, 3.869s wall-clock]
Instantiating: [5.240s CPU, 5.248s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.027s wall-clock]
Checking invariant weight... [0.000s CPU, 0.007s wall-clock]
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.006s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.020s CPU, 0.020s wall-clock]
Building translation key... [0.010s CPU, 0.011s wall-clock]
Computing fact groups: [0.130s CPU, 0.133s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.005s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.010s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.180s CPU, 0.176s wall-clock]
Translating task: [3.400s CPU, 3.397s wall-clock]
768 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
189 propositions removed
Detecting unreachable propositions: [1.690s CPU, 1.684s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
1 of 22 mutex groups necessary.
10382 of 10382 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.480s CPU, 0.480s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 862
Translator goal facts: 3
Translator mutex groups: 1
Translator total mutex groups size: 13
Translator operators: 10382
Translator axioms: 0
Translator task size: 61607
Translator peak memory: 76948 KB
Writing output... [1.060s CPU, 1.140s wall-clock]
Done! [12.210s CPU, 12.294s wall-clock]
planner.py version 0.0.1
Time: 2.33s
Memory: 203MB
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.01s
Memory: 203MB (+0MB)
UNSAT
Iteration Time: 0.01s
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.85s
Memory: 203MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 207MB (+4MB)
UNSAT
Iteration Time: 1.41s
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.78s
Memory: 228MB (+21MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 257MB (+29MB)
UNSAT
Iteration Time: 1.40s
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.00s
Memory: 287MB (+30MB)
Unblocking actions...
Solving...
Solving Time: 2.03s
Memory: 318MB (+31MB)
UNSAT
Iteration Time: 3.47s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.82s
Memory: 356MB (+38MB)
Unblocking actions...
Solving...
Solving Time: 18.77s
Memory: 459MB (+103MB)
UNSAT
Iteration Time: 20.05s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.83s
Memory: 459MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 36.21s
Memory: 632MB (+173MB)
UNKNOWN
Iteration Time: 37.55s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.86s
Memory: 632MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 41.04s
Memory: 700MB (+68MB)
UNKNOWN
Iteration Time: 42.43s
Iteration 8
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), (17,85,0,True), (18,90,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 42.86s
Memory: 700MB (+0MB)
UNKNOWN
Iteration Time: 42.90s
Iteration 9
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), (17,85,0,True), (18,90,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 45.82s
Memory: 700MB (+0MB)
UNKNOWN
Iteration Time: 45.85s
Iteration 10
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), (17,85,0,True), (18,90,0,True)]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.88s
Memory: 700MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.46s
Memory: 708MB (+8MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 2.23s
Memory: 733MB (+25MB)
Answer: 1
occurs(action(("move","node4-4","node5-4")),1) occurs(action(("move","node5-4","node5-5")),2) occurs(action(("move","node5-5","node6-5")),3) occurs(action(("move","node6-5","node5-5")),4) occurs(action(("move","node5-5","node4-5")),5) occurs(action(("move","node4-5","node3-5")),6) occurs(action(("move","node3-5","node2-5")),7) occurs(action(("move","node2-5","node2-6")),8) occurs(action(("move","node2-6","node1-6")),9) occurs(action(("pickup","node1-6","key0")),10) occurs(action(("move","node1-6","node1-5")),10) occurs(action(("move","node1-5","node1-4")),11) occurs(action(("move","node1-4","node1-3")),12) occurs(action(("move","node1-3","node1-2")),13) occurs(action(("move","node1-2","node1-1")),14) occurs(action(("pickup-and-loose","node1-1","key9","key0")),15) occurs(action(("move","node1-1","node1-2")),15) occurs(action(("move","node1-2","node0-2")),16) occurs(action(("move","node0-2","node0-3")),17) occurs(action(("pickup-and-loose","node0-3","key3","key9")),18) occurs(action(("move","node0-3","node0-2")),18) occurs(action(("move","node0-2","node0-1")),19) occurs(action(("move","node0-1","node0-0")),20) occurs(action(("move","node0-0","node1-0")),21) occurs(action(("move","node1-0","node2-0")),22) occurs(action(("move","node2-0","node3-0")),23) occurs(action(("putdown","node3-0","key3")),24) occurs(action(("move","node3-0","node4-0")),24) occurs(action(("move","node4-0","node5-0")),25) occurs(action(("pickup","node5-0","key11")),26) occurs(action(("putdown","node5-0","key11")),27) occurs(action(("unlock","node5-0","node5-1","key11","square")),27) occurs(action(("move","node5-0","node5-1")),28) occurs(action(("pickup","node5-1","key4")),29) occurs(action(("move","node5-1","node4-1")),29) occurs(action(("move","node4-1","node4-2")),30) occurs(action(("move","node4-2","node4-3")),31) occurs(action(("move","node4-3","node4-4")),32) occurs(action(("move","node4-4","node5-4")),33) occurs(action(("move","node5-4","node6-4")),34) occurs(action(("putdown","node6-4","key4")),35)
SATISFIABLE
Models : 1+
Calls : 10
Time : 199.276s (Solving: 186.69s 1st Model: 0.34s Unsat: 20.72s)
CPU Time : 199.284s
Choices : 365617 (Domain: 365614)
Conflicts : 46283 (Analyzed: 46280)
Restarts : 501 (Average: 92.38 Last: 116)
Model-Level : 1504.0
Problems : 10 (Average Length: 22.00 Splits: 0)
Lemmas : 46280 (Deleted: 41765)
Binary : 691 (Ratio: 1.49%)
Ternary : 452 (Ratio: 0.98%)
Conflict : 46280 (Average Length: 13972.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 46280 (Average: 5.01 Max: 958 Sum: 231739)
Executed : 46229 (Average: 4.99 Max: 958 Sum: 230879 Ratio: 99.63%)
Bounded : 51 (Average: 16.86 Max: 22 Sum: 860 Ratio: 0.37%)
Rules : 186897
Atoms : 186897
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 402737 (Eliminated: 0 Frozen: 28130)
Constraints : 2533996 (Binary: 98.1% Ternary: 0.9% Other: 1.0%)
Memory Peak : 758MB
Max. Length : 35 steps
Sol. Length : 35 steps
Models : 1