169 lines
6.4 KiB
Plaintext
169 lines
6.4 KiB
Plaintext
|
INFO Running translator.
|
||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-32.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-2000/domains/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-32.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.020s CPU, 0.018s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.000s CPU, 0.011s wall-clock]
|
||
|
Preparing model... [0.020s CPU, 0.014s wall-clock]
|
||
|
Generated 18 rules.
|
||
|
Computing model... [0.060s CPU, 0.050s wall-clock]
|
||
|
393 relevant atoms
|
||
|
259 auxiliary atoms
|
||
|
652 final queue length
|
||
|
821 total queue pushes
|
||
|
Completing instantiation... [0.030s CPU, 0.038s wall-clock]
|
||
|
Instantiating: [0.120s CPU, 0.121s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
6 initial candidates
|
||
|
Finding invariants: [0.010s CPU, 0.006s wall-clock]
|
||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
Choosing groups...
|
||
|
14 uncovered facts
|
||
|
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
||
|
Building translation key... [0.010s CPU, 0.001s wall-clock]
|
||
|
Computing fact groups: [0.020s CPU, 0.009s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s 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.000s wall-clock]
|
||
|
Translating task...
|
||
|
Processing axioms...
|
||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
||
|
Translating task: [0.030s CPU, 0.033s wall-clock]
|
||
|
7 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
1 propositions removed
|
||
|
Detecting unreachable propositions: [0.020s CPU, 0.020s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
15 of 15 variables necessary.
|
||
|
0 of 1 mutex groups necessary.
|
||
|
196 of 196 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
|
||
|
Translator variables: 15
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 42
|
||
|
Translator goal facts: 7
|
||
|
Translator mutex groups: 0
|
||
|
Translator total mutex groups size: 0
|
||
|
Translator operators: 196
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 666
|
||
|
Translator peak memory: 33368 KB
|
||
|
Writing output... [0.010s CPU, 0.016s wall-clock]
|
||
|
Done! [0.230s CPU, 0.227s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.04s
|
||
|
Memory: 47MB
|
||
|
|
||
|
Iteration 1
|
||
|
Queue: [0]
|
||
|
Grounded Until: 0
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 47MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.00s
|
||
|
|
||
|
Iteration 2
|
||
|
Queue: [5]
|
||
|
Grounded Until: 0
|
||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 47MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 48MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
Iteration 3
|
||
|
Queue: [10]
|
||
|
Grounded Until: 5
|
||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 48MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.01s
|
||
|
Memory: 49MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
Iteration 4
|
||
|
Queue: [15]
|
||
|
Grounded Until: 10
|
||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 49MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.11s
|
||
|
Memory: 50MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.13s
|
||
|
|
||
|
Iteration 5
|
||
|
Queue: [20]
|
||
|
Grounded Until: 15
|
||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
Grounding Time: 0.01s
|
||
|
Memory: 51MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("up","f0","f6")),1) occurs(action(("board","f6","p5")),2) occurs(action(("up","f6","f13")),3) occurs(action(("board","f13","p3")),4) occurs(action(("down","f13","f4")),5) occurs(action(("depart","f4","p5")),6) occurs(action(("down","f4","f2")),7) occurs(action(("depart","f2","p3")),8) occurs(action(("board","f2","p2")),8) occurs(action(("up","f2","f7")),9) occurs(action(("depart","f7","p2")),10) occurs(action(("board","f7","p1")),10) occurs(action(("up","f7","f10")),11) occurs(action(("depart","f10","p1")),12) occurs(action(("down","f10","f8")),13) occurs(action(("board","f8","p0")),14) occurs(action(("up","f8","f9")),15) occurs(action(("board","f9","p4")),16) occurs(action(("down","f9","f1")),17) occurs(action(("depart","f1","p0")),18) occurs(action(("board","f1","p6")),18) occurs(action(("up","f1","f5")),19) occurs(action(("depart","f5","p4")),20) occurs(action(("depart","f5","p6")),20)
|
||
|
Solving Time: 0.10s
|
||
|
Memory: 52MB (+1MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 5
|
||
|
Time : 0.349s (Solving: 0.21s 1st Model: 0.10s Unsat: 0.11s)
|
||
|
CPU Time : 0.350s
|
||
|
|
||
|
Choices : 4852
|
||
|
Conflicts : 3154 (Analyzed: 3151)
|
||
|
Restarts : 36 (Average: 87.53 Last: 53)
|
||
|
Model-Level : 30.0
|
||
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||
|
Lemmas : 3151 (Deleted: 0)
|
||
|
Binary : 114 (Ratio: 3.62%)
|
||
|
Ternary : 313 (Ratio: 9.93%)
|
||
|
Conflict : 3151 (Average Length: 11.9 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 3151 (Average: 1.51 Max: 31 Sum: 4762)
|
||
|
Executed : 3134 (Average: 1.48 Max: 31 Sum: 4648 Ratio: 97.61%)
|
||
|
Bounded : 17 (Average: 6.71 Max: 17 Sum: 114 Ratio: 2.39%)
|
||
|
|
||
|
Rules : 2603
|
||
|
Atoms : 2603
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 5346 (Eliminated: 0 Frozen: 3771)
|
||
|
Constraints : 24462 (Binary: 95.5% Ternary: 3.0% Other: 1.5%)
|
||
|
|
||
|
Memory Peak : 52MB
|
||
|
Max. Length : 20 steps
|
||
|
Sol. Length : 20 steps
|
||
|
|
||
|
|