150 lines
6.4 KiB
Plaintext
150 lines
6.4 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-11.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-11.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.120s CPU, 0.121s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.030s CPU, 0.032s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Preparing model... [0.170s CPU, 0.167s wall-clock]
|
||
|
|
Generated 23 rules.
|
||
|
|
Computing model... [0.540s CPU, 0.540s wall-clock]
|
||
|
|
3208 relevant atoms
|
||
|
|
5394 auxiliary atoms
|
||
|
|
8602 final queue length
|
||
|
|
10192 total queue pushes
|
||
|
|
Completing instantiation... [0.340s CPU, 0.338s wall-clock]
|
||
|
|
Instantiating: [1.100s CPU, 1.100s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
9 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.050s CPU, 0.052s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.010s CPU, 0.012s wall-clock]
|
||
|
|
Translating task: [0.240s CPU, 0.234s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
8 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.120s CPU, 0.120s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
8 of 8 variables necessary.
|
||
|
|
0 of 8 mutex groups necessary.
|
||
|
|
880 of 880 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.030s CPU, 0.034s wall-clock]
|
||
|
|
Translator variables: 8
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 106
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 880
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 4448
|
||
|
|
Translator peak memory: 40652 KB
|
||
|
|
Writing output... [0.080s CPU, 0.090s wall-clock]
|
||
|
|
Done! [1.750s CPU, 1.767s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.25s
|
||
|
|
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: 62MB (+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: 62MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.05s
|
||
|
|
Memory: 62MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 62MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.07s
|
||
|
|
|
||
|
|
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: 62MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 65MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.06s
|
||
|
|
Memory: 67MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.15s
|
||
|
|
Memory: 77MB (+10MB)
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load","p0","t0","l2")),1) occurs(action(("load","p1","t0","l2")),1) occurs(action(("drive","t0","l2","l1","level58","level3","level61")),1) occurs(action(("load","p2","t0","l1")),2) occurs(action(("drive","t0","l1","l5","level47","level11","level58")),2) occurs(action(("load","p5","t0","l5")),3) occurs(action(("drive","t0","l5","l4","level30","level17","level47")),3) occurs(action(("unload","p1","t0","l4")),4) occurs(action(("unload","p5","t0","l4")),4) occurs(action(("drive","t0","l4","l3","level25","level5","level30")),4) occurs(action(("unload","p0","t0","l3")),5) occurs(action(("unload","p2","t0","l3")),5) occurs(action(("load","p3","t0","l3")),5) occurs(action(("load","p4","t0","l3")),5) occurs(action(("drive","t0","l3","l4","level20","level5","level25")),5) occurs(action(("drive","t0","l4","l2","level4","level16","level20")),6) occurs(action(("unload","p3","t0","l2")),7) occurs(action(("unload","p4","t0","l2")),7) occurs(action(("load","p4","t0","l2")),8) occurs(action(("unload","p4","t0","l2")),9) occurs(action(("drive","t0","l2","l1","level1","level3","level4")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.479s (Solving: 0.06s 1st Model: 0.05s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.468s
|
||
|
|
|
||
|
|
Choices : 574 (Domain: 574)
|
||
|
|
Conflicts : 402 (Analyzed: 401)
|
||
|
|
Restarts : 3 (Average: 133.67 Last: 120)
|
||
|
|
Model-Level : 22.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 401 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 0.50%)
|
||
|
|
Ternary : 6 (Ratio: 1.50%)
|
||
|
|
Conflict : 401 (Average Length: 861.7 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 401 (Average: 1.35 Max: 27 Sum: 543)
|
||
|
|
Executed : 395 (Average: 1.27 Max: 27 Sum: 509 Ratio: 93.74%)
|
||
|
|
Bounded : 6 (Average: 5.67 Max: 12 Sum: 34 Ratio: 6.26%)
|
||
|
|
|
||
|
|
Rules : 14333
|
||
|
|
Atoms : 14333
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 9705 (Eliminated: 0 Frozen: 905)
|
||
|
|
Constraints : 55508 (Binary: 97.3% Ternary: 1.5% Other: 1.2%)
|
||
|
|
|
||
|
|
Memory Peak : 77MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 1
|
||
|
|
|
||
|
|
|