164 lines
7.6 KiB
Plaintext
164 lines
7.6 KiB
Plaintext
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-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-2011/domains/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-15.pddl
|
|
Parsing...
|
|
Parsing: [0.770s CPU, 0.776s wall-clock]
|
|
Normalizing task... [0.020s CPU, 0.017s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.180s CPU, 0.180s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
|
Preparing model... [1.420s CPU, 1.417s wall-clock]
|
|
Generated 23 rules.
|
|
Computing model... [3.440s CPU, 3.442s wall-clock]
|
|
19551 relevant atoms
|
|
34624 auxiliary atoms
|
|
54175 final queue length
|
|
63246 total queue pushes
|
|
Completing instantiation... [2.010s CPU, 2.011s wall-clock]
|
|
Instantiating: [7.130s CPU, 7.124s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
9 initial candidates
|
|
Finding invariants: [0.060s CPU, 0.055s wall-clock]
|
|
Checking invariant weight... [0.040s CPU, 0.047s wall-clock]
|
|
Instantiating groups... [0.060s CPU, 0.054s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
0 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.006s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.180s CPU, 0.181s 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.002s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.070s CPU, 0.067s wall-clock]
|
|
Translating task: [1.360s CPU, 1.365s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
12 propositions removed
|
|
Detecting unreachable propositions: [0.640s CPU, 0.639s wall-clock]
|
|
Reordering and filtering variables...
|
|
12 of 12 variables necessary.
|
|
0 of 12 mutex groups necessary.
|
|
4772 of 4772 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.190s CPU, 0.190s wall-clock]
|
|
Translator variables: 12
|
|
Translator derived variables: 0
|
|
Translator facts: 285
|
|
Translator goal facts: 10
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 4772
|
|
Translator axioms: 0
|
|
Translator task size: 23967
|
|
Translator peak memory: 63240 KB
|
|
Writing output... [0.440s CPU, 0.475s wall-clock]
|
|
Done! [10.800s CPU, 10.835s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 1.05s
|
|
Memory: 119MB
|
|
|
|
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 (+1MB)
|
|
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.30s
|
|
Memory: 120MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 121MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.50s
|
|
|
|
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: 122.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.33s
|
|
Memory: 130MB (+9MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 143MB (+13MB)
|
|
UNSAT
|
|
Iteration Time: 0.53s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 165.0MB
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.32s
|
|
Memory: 151MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.83s
|
|
Memory: 171MB (+20MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.83s
|
|
Memory: 171MB (+0MB)
|
|
Answer: 1
|
|
occurs(action(("drive","t0","l9","l3","level155","level10","level165")),1) occurs(action(("load","p0","t0","l3")),2) occurs(action(("load","p8","t0","l3")),2) occurs(action(("drive","t0","l3","l0","level153","level2","level155")),2) occurs(action(("load","p5","t0","l0")),3) occurs(action(("drive","t0","l0","l2","level140","level13","level153")),3) occurs(action(("load","p2","t0","l2")),4) occurs(action(("drive","t0","l2","l8","level120","level20","level140")),4) occurs(action(("load","p6","t0","l8")),5) occurs(action(("load","p7","t0","l8")),5) occurs(action(("drive","t0","l8","l2","level100","level20","level120")),5) occurs(action(("drive","t0","l2","l6","level88","level12","level100")),6) occurs(action(("unload","p6","t0","l6")),7) occurs(action(("drive","t0","l6","l1","level82","level6","level88")),7) occurs(action(("unload","p8","t0","l1")),8) occurs(action(("drive","t0","l1","l7","level64","level18","level82")),8) occurs(action(("unload","p0","t0","l7")),9) occurs(action(("unload","p5","t0","l7")),9) occurs(action(("drive","t0","l7","l4","level48","level16","level64")),9) occurs(action(("unload","p7","t0","l4")),10) occurs(action(("load","p1","t0","l4")),10) occurs(action(("drive","t0","l4","l5","level45","level3","level48")),10) occurs(action(("load","p3","t0","l4")),10) occurs(action(("load","p4","t0","l4")),10) occurs(action(("load","p9","t0","l4")),10) occurs(action(("unload","p1","t0","l5")),11) occurs(action(("unload","p2","t0","l5")),11) occurs(action(("drive","t0","l5","l3","level33","level12","level45")),11) occurs(action(("unload","p4","t0","l3")),12) occurs(action(("drive","t0","l3","l9","level23","level10","level33")),12) occurs(action(("unload","p9","t0","l9")),13) occurs(action(("drive","t0","l9","l3","level13","level10","level23")),13) occurs(action(("drive","t0","l3","l7","level2","level11","level13")),14) occurs(action(("unload","p3","t0","l7")),15)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 3.456s (Solving: 0.82s 1st Model: 0.81s Unsat: 0.01s)
|
|
CPU Time : 3.412s
|
|
|
|
Choices : 2757 (Domain: 2757)
|
|
Conflicts : 1080 (Analyzed: 1078)
|
|
Restarts : 14 (Average: 77.00 Last: 34)
|
|
Model-Level : 108.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 1078 (Deleted: 0)
|
|
Binary : 0 (Ratio: 0.00%)
|
|
Ternary : 1 (Ratio: 0.09%)
|
|
Conflict : 1078 (Average Length: 4390.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1078 (Average: 2.00 Max: 85 Sum: 2159)
|
|
Executed : 1070 (Average: 1.92 Max: 85 Sum: 2075 Ratio: 96.11%)
|
|
Bounded : 8 (Average: 10.50 Max: 17 Sum: 84 Ratio: 3.89%)
|
|
|
|
Rules : 76962
|
|
Atoms : 76962
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 72154 (Eliminated: 0 Frozen: 3944)
|
|
Constraints : 392026 (Binary: 98.7% Ternary: 0.8% Other: 0.6%)
|
|
|
|
Memory Peak : 232MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
Models : 1
|
|
|
|
|