208 lines
8.5 KiB
Plaintext
208 lines
8.5 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-54.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-54.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.030s CPU, 0.034s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
||
|
Preparing model... [0.030s CPU, 0.030s wall-clock]
|
||
|
Generated 18 rules.
|
||
|
Computing model... [0.100s CPU, 0.101s wall-clock]
|
||
|
881 relevant atoms
|
||
|
583 auxiliary atoms
|
||
|
1464 final queue length
|
||
|
1905 total queue pushes
|
||
|
Completing instantiation... [0.080s CPU, 0.079s wall-clock]
|
||
|
Instantiating: [0.230s CPU, 0.235s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
6 initial candidates
|
||
|
Finding invariants: [0.010s CPU, 0.005s 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...
|
||
|
22 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.010s 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.004s wall-clock]
|
||
|
Translating task: [0.070s CPU, 0.077s wall-clock]
|
||
|
11 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
1 propositions removed
|
||
|
Detecting unreachable propositions: [0.050s CPU, 0.044s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
23 of 23 variables necessary.
|
||
|
0 of 1 mutex groups necessary.
|
||
|
484 of 484 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
|
||
|
Translator variables: 23
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 66
|
||
|
Translator goal facts: 11
|
||
|
Translator mutex groups: 0
|
||
|
Translator total mutex groups size: 0
|
||
|
Translator operators: 484
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 1574
|
||
|
Translator peak memory: 34136 KB
|
||
|
Writing output... [0.030s CPU, 0.036s wall-clock]
|
||
|
Done! [0.440s CPU, 0.453s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.08s
|
||
|
Memory: 49MB
|
||
|
|
||
|
Iteration 1
|
||
|
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
|
||
|
Grounded Until: 0
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 49MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.00s
|
||
|
|
||
|
Iteration 2
|
||
|
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
|
||
|
Grounded Until: 0
|
||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
Grounding Time: 0.04s
|
||
|
Memory: 50MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 51MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.05s
|
||
|
|
||
|
Iteration 3
|
||
|
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
|
||
|
Grounded Until: 5
|
||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 52MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.01s
|
||
|
Memory: 53MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.05s
|
||
|
|
||
|
Iteration 4
|
||
|
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
|
||
|
Grounded Until: 10
|
||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 55MB (+2MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.23s
|
||
|
Memory: 57MB (+2MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.27s
|
||
|
|
||
|
Iteration 5
|
||
|
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
|
||
|
Grounded Until: 15
|
||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 58MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.90s
|
||
|
Memory: 59MB (+1MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.93s
|
||
|
|
||
|
Iteration 6
|
||
|
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20]
|
||
|
Grounded Until: 20
|
||
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 60MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 1.11s
|
||
|
Memory: 62MB (+2MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 1.15s
|
||
|
|
||
|
Iteration 7
|
||
|
Queue: [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20, 25]
|
||
|
Grounded Until: 25
|
||
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 63MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 1.13s
|
||
|
Memory: 65MB (+2MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 1.17s
|
||
|
|
||
|
Iteration 8
|
||
|
Queue: [35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20, 25, 30]
|
||
|
Grounded Until: 30
|
||
|
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||
|
Grounding Time: 0.04s
|
||
|
Memory: 67MB (+2MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("up","f0","f6")),1) occurs(action(("board","f6","p1")),2) occurs(action(("board","f6","p6")),2) occurs(action(("up","f6","f8")),3) occurs(action(("board","f8","p8")),4) occurs(action(("up","f8","f9")),5) occurs(action(("depart","f9","p8")),6) occurs(action(("board","f9","p5")),6) occurs(action(("up","f9","f10")),7) occurs(action(("depart","f10","p6")),8) occurs(action(("up","f10","f17")),9) occurs(action(("board","f17","p3")),10) occurs(action(("down","f17","f1")),11) occurs(action(("board","f1","p2")),12) occurs(action(("up","f1","f14")),13) occurs(action(("board","f14","p10")),14) occurs(action(("board","f14","p9")),14) occurs(action(("down","f14","f12")),15) occurs(action(("depart","f12","p3")),16) occurs(action(("down","f12","f1")),17) occurs(action(("board","f1","p2")),18) occurs(action(("board","f1","p2")),19) occurs(action(("up","f1","f21")),20) occurs(action(("depart","f21","p1")),21) occurs(action(("down","f21","f15")),22) occurs(action(("board","f15","p4")),23) occurs(action(("down","f15","f13")),24) occurs(action(("board","f13","p0")),25) occurs(action(("up","f13","f19")),26) occurs(action(("depart","f19","p0")),27) occurs(action(("down","f19","f18")),28) occurs(action(("depart","f18","p4")),29) occurs(action(("board","f18","p7")),29) occurs(action(("down","f18","f8")),30) occurs(action(("depart","f8","p2")),31) occurs(action(("depart","f8","p5")),31) occurs(action(("board","f8","p8")),31) occurs(action(("down","f8","f4")),32) occurs(action(("depart","f4","p9")),33) occurs(action(("up","f4","f11")),34) occurs(action(("depart","f11","p10")),35) occurs(action(("depart","f11","p7")),35)
|
||
|
Solving Time: 0.64s
|
||
|
Memory: 69MB (+2MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 8
|
||
|
Time : 4.412s (Solving: 4.00s 1st Model: 0.64s Unsat: 0.23s)
|
||
|
CPU Time : 4.410s
|
||
|
|
||
|
Choices : 47665
|
||
|
Conflicts : 32118 (Analyzed: 32115)
|
||
|
Restarts : 375 (Average: 85.64 Last: 115)
|
||
|
Model-Level : 67.0
|
||
|
Problems : 8 (Average Length: 19.50 Splits: 0)
|
||
|
Lemmas : 32115 (Deleted: 23466)
|
||
|
Binary : 282 (Ratio: 0.88%)
|
||
|
Ternary : 1684 (Ratio: 5.24%)
|
||
|
Conflict : 32115 (Average Length: 18.4 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 32115 (Average: 1.36 Max: 57 Sum: 43560)
|
||
|
Executed : 32096 (Average: 1.35 Max: 57 Sum: 43424 Ratio: 99.69%)
|
||
|
Bounded : 19 (Average: 7.16 Max: 22 Sum: 136 Ratio: 0.31%)
|
||
|
|
||
|
Rules : 6199
|
||
|
Atoms : 6199
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 20839 (Eliminated: 0 Frozen: 16534)
|
||
|
Constraints : 104789 (Binary: 97.1% Ternary: 2.1% Other: 0.9%)
|
||
|
|
||
|
Memory Peak : 70MB
|
||
|
Max. Length : 35 steps
|
||
|
Sol. Length : 35 steps
|
||
|
|
||
|
|