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-1.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-1.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.270s CPU, 0.276s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.050s CPU, 0.052s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Preparing model... [0.330s CPU, 0.328s wall-clock]
|
||
|
|
Generated 23 rules.
|
||
|
|
Computing model... [0.920s CPU, 0.918s wall-clock]
|
||
|
|
5416 relevant atoms
|
||
|
|
9396 auxiliary atoms
|
||
|
|
14812 final queue length
|
||
|
|
17207 total queue pushes
|
||
|
|
Completing instantiation... [0.550s CPU, 0.544s wall-clock]
|
||
|
|
Instantiating: [1.870s CPU, 1.871s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
9 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Checking invariant weight... [0.020s CPU, 0.013s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.018s 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.060s CPU, 0.066s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s 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.010s CPU, 0.018s wall-clock]
|
||
|
|
Translating task: [0.350s CPU, 0.348s 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.170s CPU, 0.172s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
8 of 8 variables necessary.
|
||
|
|
0 of 8 mutex groups necessary.
|
||
|
|
1294 of 1294 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.050s CPU, 0.051s wall-clock]
|
||
|
|
Translator variables: 8
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 129
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 1294
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 6541
|
||
|
|
Translator peak memory: 43212 KB
|
||
|
|
Writing output... [0.170s CPU, 0.180s wall-clock]
|
||
|
|
Done! [2.980s CPU, 2.989s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.29s
|
||
|
|
Memory: 68MB
|
||
|
|
|
||
|
|
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: 68MB (+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: 68MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.08s
|
||
|
|
Memory: 68MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 69MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.12s
|
||
|
|
|
||
|
|
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: 70.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.08s
|
||
|
|
Memory: 72MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 74MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.22s
|
||
|
|
Memory: 86MB (+12MB)
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load","p0","t0","l2")),1) occurs(action(("load","p1","t0","l2")),1) occurs(action(("drive","t0","l2","l5","level71","level13","level84")),1) occurs(action(("load","p5","t0","l5")),2) occurs(action(("drive","t0","l5","l4","level54","level17","level71")),2) occurs(action(("unload","p1","t0","l4")),3) occurs(action(("unload","p5","t0","l4")),3) occurs(action(("drive","t0","l4","l3","level49","level5","level54")),3) occurs(action(("unload","p0","t0","l3")),4) occurs(action(("load","p3","t0","l3")),4) occurs(action(("load","p4","t0","l3")),4) occurs(action(("drive","t0","l3","l4","level44","level5","level49")),4) occurs(action(("drive","t0","l4","l2","level28","level16","level44")),5) occurs(action(("unload","p3","t0","l2")),6) occurs(action(("unload","p4","t0","l2")),6) occurs(action(("drive","t0","l2","l1","level25","level3","level28")),6) occurs(action(("load","p2","t0","l1")),7) occurs(action(("drive","t0","l1","l4","level13","level12","level25")),7) occurs(action(("drive","t0","l4","l3","level8","level5","level13")),8) occurs(action(("unload","p2","t0","l3")),9) occurs(action(("drive","t0","l3","l4","level3","level5","level8")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.550s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.528s
|
||
|
|
|
||
|
|
Choices : 39 (Domain: 39)
|
||
|
|
Conflicts : 8 (Analyzed: 7)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 33.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 7 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 1 (Ratio: 14.29%)
|
||
|
|
Conflict : 7 (Average Length: 97.9 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 7 (Average: 3.71 Max: 8 Sum: 26)
|
||
|
|
Executed : 5 (Average: 2.57 Max: 6 Sum: 18 Ratio: 69.23%)
|
||
|
|
Bounded : 2 (Average: 4.00 Max: 7 Sum: 8 Ratio: 30.77%)
|
||
|
|
|
||
|
|
Rules : 21049
|
||
|
|
Atoms : 21049
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 13868 (Eliminated: 0 Frozen: 1112)
|
||
|
|
Constraints : 77882 (Binary: 97.7% Ternary: 1.3% Other: 1.1%)
|
||
|
|
|
||
|
|
Memory Peak : 86MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 1
|
||
|
|
|
||
|
|
|