150 lines
6.5 KiB
Plaintext
150 lines
6.5 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-12.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-12.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.180s CPU, 0.178s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.040s CPU, 0.040s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Preparing model... [0.240s CPU, 0.237s wall-clock]
|
||
|
|
Generated 23 rules.
|
||
|
|
Computing model... [0.740s CPU, 0.739s wall-clock]
|
||
|
|
4336 relevant atoms
|
||
|
|
7399 auxiliary atoms
|
||
|
|
11735 final queue length
|
||
|
|
13900 total queue pushes
|
||
|
|
Completing instantiation... [0.500s CPU, 0.491s wall-clock]
|
||
|
|
Instantiating: [1.530s CPU, 1.531s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
9 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.025s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.070s CPU, 0.065s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.020s CPU, 0.017s wall-clock]
|
||
|
|
Translating task: [0.320s CPU, 0.316s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
9 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.160s CPU, 0.161s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
9 of 9 variables necessary.
|
||
|
|
0 of 9 mutex groups necessary.
|
||
|
|
1192 of 1192 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.050s CPU, 0.048s wall-clock]
|
||
|
|
Translator variables: 9
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 130
|
||
|
|
Translator goal facts: 7
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 1192
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 6008
|
||
|
|
Translator peak memory: 42188 KB
|
||
|
|
Writing output... [0.110s CPU, 0.121s wall-clock]
|
||
|
|
Done! [2.430s CPU, 2.442s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.25s
|
||
|
|
Memory: 66MB
|
||
|
|
|
||
|
|
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: 66MB (+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: 66MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 66MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 67MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.10s
|
||
|
|
|
||
|
|
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: 68.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.07s
|
||
|
|
Memory: 70MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 73MB (+3MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.20s
|
||
|
|
Memory: 85MB (+12MB)
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load","p5","t0","l5")),1) occurs(action(("drive","t0","l5","l4","level60","level12","level72")),1) occurs(action(("load","p2","t0","l4")),2) occurs(action(("drive","t0","l4","l3","level52","level8","level60")),2) occurs(action(("load","p6","t0","l4")),2) occurs(action(("load","p0","t0","l3")),3) occurs(action(("load","p1","t0","l3")),3) occurs(action(("drive","t0","l3","l1","level40","level12","level52")),3) occurs(action(("drive","t0","l1","l2","level37","level3","level40")),4) occurs(action(("unload","p0","t0","l2")),5) occurs(action(("unload","p1","t0","l2")),5) occurs(action(("load","p3","t0","l2")),5) occurs(action(("drive","t0","l2","l5","level24","level13","level37")),5) occurs(action(("drive","t0","l5","l0","level18","level6","level24")),6) occurs(action(("unload","p2","t0","l0")),7) occurs(action(("unload","p3","t0","l0")),7) occurs(action(("unload","p5","t0","l0")),7) occurs(action(("unload","p6","t0","l0")),7) occurs(action(("load","p4","t0","l0")),7) occurs(action(("drive","t0","l0","l3","level0","level18","level18")),7) occurs(action(("unload","p4","t0","l3")),8) occurs(action(("load","p4","t0","l3")),9) occurs(action(("unload","p4","t0","l3")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.517s (Solving: 0.04s 1st Model: 0.04s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.504s
|
||
|
|
|
||
|
|
Choices : 426 (Domain: 426)
|
||
|
|
Conflicts : 253 (Analyzed: 252)
|
||
|
|
Restarts : 3 (Average: 84.00 Last: 4)
|
||
|
|
Model-Level : 37.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 252 (Deleted: 0)
|
||
|
|
Binary : 3 (Ratio: 1.19%)
|
||
|
|
Ternary : 1 (Ratio: 0.40%)
|
||
|
|
Conflict : 252 (Average Length: 900.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 252 (Average: 1.71 Max: 20 Sum: 431)
|
||
|
|
Executed : 245 (Average: 1.53 Max: 20 Sum: 385 Ratio: 89.33%)
|
||
|
|
Bounded : 7 (Average: 6.57 Max: 12 Sum: 46 Ratio: 10.67%)
|
||
|
|
|
||
|
|
Rules : 19349
|
||
|
|
Atoms : 19349
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 12858 (Eliminated: 0 Frozen: 1178)
|
||
|
|
Constraints : 70496 (Binary: 97.6% Ternary: 1.3% Other: 1.1%)
|
||
|
|
|
||
|
|
Memory Peak : 85MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 1
|
||
|
|
|
||
|
|
|