tplp-planning-benchmark/gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_18.out

164 lines
7.8 KiB
Plaintext
Raw Permalink Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-18.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/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-18.pddl
Parsing...
Parsing: [0.490s CPU, 0.497s wall-clock]
Normalizing task... [0.020s CPU, 0.011s wall-clock]
Instantiating...
Generating Datalog program... [0.110s CPU, 0.117s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.830s CPU, 0.830s wall-clock]
Generated 23 rules.
Computing model... [2.510s CPU, 2.510s wall-clock]
14411 relevant atoms
24285 auxiliary atoms
38696 final queue length
47795 total queue pushes
Completing instantiation... [1.990s CPU, 1.991s wall-clock]
Instantiating: [5.500s CPU, 5.504s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.050s CPU, 0.057s wall-clock]
Checking invariant weight... [0.030s CPU, 0.030s wall-clock]
Instantiating groups... [0.060s CPU, 0.057s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.007s wall-clock]
Building translation key... [0.010s CPU, 0.004s wall-clock]
Computing fact groups: [0.170s CPU, 0.172s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.070s CPU, 0.066s wall-clock]
Translating task: [1.290s CPU, 1.289s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
15 propositions removed
Detecting unreachable propositions: [0.650s CPU, 0.651s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
0 of 15 mutex groups necessary.
4874 of 4874 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.200s CPU, 0.193s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 326
Translator goal facts: 13
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 4874
Translator axioms: 0
Translator task size: 24386
Translator peak memory: 57640 KB
Writing output... [0.440s CPU, 0.485s wall-clock]
Done! [8.820s CPU, 8.869s wall-clock]
planner.py version 0.0.1
Time: 1.04s
Memory: 120MB
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: 120MB (+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
Expected Memory: 120MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.34s
Memory: 120MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 122MB (+2MB)
UNSAT
Iteration Time: 0.54s
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: 124.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.31s
Memory: 132MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 147MB (+15MB)
UNSAT
Iteration Time: 0.55s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 172.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.33s
Memory: 155MB (+8MB)
Unblocking actions...
Solving...
Solving Time: 1.42s
Memory: 192MB (+37MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.89s
Memory: 192MB (+0MB)
Answer: 1
occurs(action(("drive","t0","l9","l5","level112","level18","level130")),1) occurs(action(("load","p1","t0","l5")),2) occurs(action(("load","p11","t0","l5")),2) occurs(action(("load","p12","t0","l5")),2) occurs(action(("load","p3","t0","l5")),2) occurs(action(("load","p6","t0","l5")),2) occurs(action(("load","p7","t0","l5")),2) occurs(action(("drive","t0","l5","l0","level108","level4","level112")),2) occurs(action(("unload","p12","t0","l0")),3) occurs(action(("unload","p3","t0","l0")),3) occurs(action(("drive","t0","l0","l7","level107","level1","level108")),3) occurs(action(("load","p9","t0","l7")),4) occurs(action(("drive","t0","l7","l8","level89","level18","level107")),4) occurs(action(("unload","p9","t0","l8")),5) occurs(action(("drive","t0","l8","l12","level82","level7","level89")),5) occurs(action(("load","p0","t0","l12")),6) occurs(action(("drive","t0","l12","l3","level76","level6","level82")),6) occurs(action(("load","p2","t0","l12")),6) occurs(action(("unload","p0","t0","l3")),7) occurs(action(("load","p10","t0","l3")),7) occurs(action(("load","p4","t0","l3")),7) occurs(action(("drive","t0","l3","l11","level56","level20","level76")),7) occurs(action(("drive","t0","l11","l1","level55","level1","level56")),8) occurs(action(("unload","p11","t0","l1")),9) occurs(action(("unload","p6","t0","l1")),9) occurs(action(("unload","p7","t0","l1")),9) occurs(action(("drive","t0","l1","l2","level45","level10","level55")),9) occurs(action(("drive","t0","l2","l4","level31","level14","level45")),10) occurs(action(("load","p8","t0","l2")),10) occurs(action(("unload","p4","t0","l4")),11) occurs(action(("load","p5","t0","l4")),11) occurs(action(("drive","t0","l4","l9","level28","level3","level31")),11) occurs(action(("unload","p1","t0","l9")),12) occurs(action(("unload","p5","t0","l9")),12) occurs(action(("drive","t0","l9","l5","level10","level18","level28")),12) occurs(action(("drive","t0","l5","l0","level6","level4","level10")),13) occurs(action(("unload","p2","t0","l0")),14) occurs(action(("unload","p8","t0","l0")),14) occurs(action(("drive","t0","l0","l7","level5","level1","level6")),14) occurs(action(("unload","p10","t0","l7")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 4.106s (Solving: 1.45s 1st Model: 1.39s Unsat: 0.05s)
CPU Time : 4.060s
Choices : 4502 (Domain: 4501)
Conflicts : 1723 (Analyzed: 1721)
Restarts : 19 (Average: 90.58 Last: 41)
Model-Level : 51.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 1721 (Deleted: 0)
Binary : 11 (Ratio: 0.64%)
Ternary : 10 (Ratio: 0.58%)
Conflict : 1721 (Average Length: 5365.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1721 (Average: 2.20 Max: 85 Sum: 3782)
Executed : 1712 (Average: 2.15 Max: 85 Sum: 3703 Ratio: 97.91%)
Bounded : 9 (Average: 8.78 Max: 17 Sum: 79 Ratio: 2.09%)
Rules : 78363
Atoms : 78363
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 75046 (Eliminated: 0 Frozen: 4567)
Constraints : 432808 (Binary: 98.6% Ternary: 0.8% Other: 0.5%)
Memory Peak : 253MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1