1
0
Fork 0
tplp-planning-benchmark/fd-ps-e1-sh/ipc-2000_elevator-strips-si...

339 lines
9.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-50.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-50.pddl
Parsing...
Parsing: [0.020s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.020s CPU, 0.022s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.075s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.060s CPU, 0.065s wall-clock]
Instantiating: [0.180s CPU, 0.182s 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...
20 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.003s wall-clock]
Translating task: [0.060s CPU, 0.061s wall-clock]
10 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.036s wall-clock]
Reordering and filtering variables...
21 of 21 variables necessary.
0 of 1 mutex groups necessary.
400 of 400 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
Translator variables: 21
Translator derived variables: 0
Translator facts: 60
Translator goal facts: 10
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 400
Translator axioms: 0
Translator task size: 1311
Translator peak memory: 33880 KB
Writing output... [0.030s CPU, 0.032s wall-clock]
Done! [0.350s CPU, 0.359s wall-clock]
planner.py version 0.0.1
Time: 0.07s
Memory: 48MB
Iteration 1
Queue: [0]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 48MB (+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.03s
Memory: 49MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+1MB)
UNSAT
Iteration Time: 0.04s
Iteration 3
Queue: [10]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.03s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.05s
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: 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 55MB (+2MB)
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.02s
Memory: 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.82s
Memory: 57MB (+1MB)
UNKNOWN
Iteration Time: 0.85s
Iteration 6
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 0.67s
Memory: 57MB (+0MB)
UNKNOWN
Iteration Time: 0.67s
Iteration 7
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 0.16s
Memory: 57MB (+0MB)
UNSAT
Iteration Time: 0.16s
Iteration 8
Queue: [25]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.02s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.83s
Memory: 60MB (+1MB)
UNKNOWN
Iteration Time: 0.87s
Iteration 9
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.75s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.75s
Iteration 10
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.62s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.62s
Iteration 11
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.55s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.55s
Iteration 12
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.45s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.45s
Iteration 13
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.47s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.47s
Iteration 14
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.43s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.43s
Iteration 15
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.44s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.44s
Iteration 16
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.40s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.40s
Iteration 17
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.41s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.41s
Iteration 18
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.42s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.42s
Iteration 19
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.40s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.40s
Iteration 20
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.39s
Memory: 60MB (+0MB)
UNKNOWN
Iteration Time: 0.39s
Iteration 21
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.40s
Memory: 61MB (+1MB)
UNKNOWN
Iteration Time: 0.40s
Iteration 22
Queue: [25]
Grounded Until: 25
Solving...
Solving Time: 0.33s
Memory: 61MB (+0MB)
UNSAT
Iteration Time: 0.33s
Iteration 23
Queue: [30]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.02s
Memory: 63MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f2")),2) occurs(action(("board","f2","p1")),3) occurs(action(("board","f2","p2")),3) occurs(action(("board","f2","p6")),3) occurs(action(("up","f2","f10")),4) occurs(action(("board","f10","p5")),5) occurs(action(("up","f10","f18")),6) occurs(action(("depart","f18","p2")),7) occurs(action(("board","f18","p7")),8) occurs(action(("board","f18","p7")),9) occurs(action(("board","f18","p7")),10) occurs(action(("down","f18","f3")),11) occurs(action(("board","f3","p9")),12) occurs(action(("up","f3","f9")),13) occurs(action(("depart","f9","p5")),14) occurs(action(("depart","f9","p9")),14) occurs(action(("board","f9","p4")),14) occurs(action(("up","f9","f15")),15) occurs(action(("board","f15","p0")),16) occurs(action(("down","f15","f11")),17) occurs(action(("depart","f11","p0")),18) occurs(action(("down","f11","f7")),19) occurs(action(("board","f7","p3")),20) occurs(action(("down","f7","f4")),21) occurs(action(("depart","f4","p4")),22) occurs(action(("up","f4","f13")),23) occurs(action(("depart","f13","p7")),24) occurs(action(("depart","f13","p8")),24) occurs(action(("up","f13","f19")),25) occurs(action(("depart","f19","p6")),26) occurs(action(("down","f19","f0")),27) occurs(action(("depart","f0","p1")),28) occurs(action(("up","f0","f5")),29) occurs(action(("depart","f5","p3")),30)
Solving Time: 0.05s
Memory: 63MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 23
Time : 9.373s (Solving: 9.03s 1st Model: 0.05s Unsat: 0.59s)
CPU Time : 9.380s
Choices : 182126
Conflicts : 138927 (Analyzed: 138922)
Restarts : 1727 (Average: 80.44 Last: 127)
Model-Level : 54.0
Problems : 23 (Average Length: 23.52 Splits: 0)
Lemmas : 138922 (Deleted: 115004)
Binary : 233 (Ratio: 0.17%)
Ternary : 1676 (Ratio: 1.21%)
Conflict : 138922 (Average Length: 13.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 138922 (Average: 1.23 Max: 58 Sum: 170654)
Executed : 138884 (Average: 1.23 Max: 58 Sum: 170466 Ratio: 99.89%)
Bounded : 38 (Average: 4.95 Max: 22 Sum: 188 Ratio: 0.11%)
Rules : 5156
Atoms : 5156
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 15027 (Eliminated: 0 Frozen: 11669)
Constraints : 74264 (Binary: 96.8% Ternary: 2.2% Other: 1.0%)
Memory Peak : 65MB
Max. Length : 30 steps
Sol. Length : 30 steps