169 lines
6.7 KiB
Plaintext
169 lines
6.7 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-30.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-30.pddl
|
|
Parsing...
|
|
Parsing: [0.010s CPU, 0.013s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.000s CPU, 0.011s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.050s CPU, 0.051s wall-clock]
|
|
301 relevant atoms
|
|
198 auxiliary atoms
|
|
499 final queue length
|
|
620 total queue pushes
|
|
Completing instantiation... [0.040s CPU, 0.037s wall-clock]
|
|
Instantiating: [0.120s CPU, 0.120s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
6 initial candidates
|
|
Finding invariants: [0.010s CPU, 0.007s 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...
|
|
12 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.010s CPU, 0.011s 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.031s wall-clock]
|
|
6 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.018s wall-clock]
|
|
Reordering and filtering variables...
|
|
13 of 13 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
144 of 144 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
|
|
Translator variables: 13
|
|
Translator derived variables: 0
|
|
Translator facts: 36
|
|
Translator goal facts: 6
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 144
|
|
Translator axioms: 0
|
|
Translator task size: 499
|
|
Translator peak memory: 33112 KB
|
|
Writing output... [0.020s CPU, 0.015s wall-clock]
|
|
Done! [0.210s CPU, 0.216s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.03s
|
|
Memory: 46MB
|
|
|
|
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: 46MB (+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
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.02s
|
|
Memory: 47MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 47MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.02s
|
|
|
|
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
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.02s
|
|
Memory: 48MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 48MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.02s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.02s
|
|
Memory: 49MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.07s
|
|
Memory: 49MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 15
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.01s
|
|
Memory: 50MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f2")),1) occurs(action(("board","f2","p1")),2) occurs(action(("board","f2","p5")),2) occurs(action(("down","f2","f1")),3) occurs(action(("depart","f1","p5")),4) occurs(action(("up","f1","f6")),5) occurs(action(("board","f6","p2")),6) occurs(action(("up","f6","f10")),7) occurs(action(("depart","f10","p2")),8) occurs(action(("down","f10","f0")),9) occurs(action(("depart","f0","p1")),10) occurs(action(("up","f0","f3")),11) occurs(action(("board","f3","p0")),12) occurs(action(("up","f3","f6")),13) occurs(action(("depart","f6","p0")),14) occurs(action(("up","f6","f11")),15) occurs(action(("board","f11","p3")),16) occurs(action(("down","f11","f9")),17) occurs(action(("depart","f9","p3")),18) occurs(action(("board","f9","p4")),18) occurs(action(("down","f9","f8")),19) occurs(action(("depart","f8","p4")),20)
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+0MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 5
|
|
Time : 0.187s (Solving: 0.07s 1st Model: 0.00s Unsat: 0.07s)
|
|
CPU Time : 0.190s
|
|
|
|
Choices : 3623 (Domain: 3622)
|
|
Conflicts : 1131 (Analyzed: 1128)
|
|
Restarts : 14 (Average: 80.57 Last: 47)
|
|
Model-Level : 76.0
|
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
|
Lemmas : 1128 (Deleted: 0)
|
|
Binary : 44 (Ratio: 3.90%)
|
|
Ternary : 50 (Ratio: 4.43%)
|
|
Conflict : 1128 (Average Length: 21.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1128 (Average: 3.19 Max: 33 Sum: 3600)
|
|
Executed : 1115 (Average: 3.12 Max: 33 Sum: 3521 Ratio: 97.81%)
|
|
Bounded : 13 (Average: 6.08 Max: 17 Sum: 79 Ratio: 2.19%)
|
|
|
|
Rules : 1944
|
|
Atoms : 1944
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 4141 (Eliminated: 0 Frozen: 2779)
|
|
Constraints : 18249 (Binary: 94.7% Ternary: 3.5% Other: 1.8%)
|
|
|
|
Memory Peak : 51MB
|
|
Max. Length : 20 steps
|
|
Sol. Length : 20 steps
|
|
|
|
|