1
0
Fork 0
tplp-planning-benchmark/fd-pc-e1-sh/ipc-2000_blocks-strips-type...

225 lines
10 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-33.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/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-33.pddl
Parsing...
Parsing: [0.010s CPU, 0.017s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 21 rules.
Computing model... [0.130s CPU, 0.133s wall-clock]
898 relevant atoms
592 auxiliary atoms
1490 final queue length
2549 total queue pushes
Completing instantiation... [0.150s CPU, 0.161s wall-clock]
Instantiating: [0.310s CPU, 0.323s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.030s CPU, 0.022s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
Choosing groups...
17 uncovered facts
Choosing groups: [0.000s CPU, 0.011s wall-clock]
Building translation key... [0.010s CPU, 0.004s wall-clock]
Computing fact groups: [0.080s CPU, 0.071s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.006s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.008s wall-clock]
Translating task: [0.170s CPU, 0.178s wall-clock]
752 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
32 propositions removed
Detecting unreachable propositions: [0.100s CPU, 0.100s wall-clock]
Reordering and filtering variables...
33 of 33 variables necessary.
17 of 33 mutex groups necessary.
512 of 512 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.055s wall-clock]
Translator variables: 33
Translator derived variables: 0
Translator facts: 306
Translator goal facts: 15
Translator mutex groups: 17
Translator total mutex groups size: 289
Translator operators: 512
Translator axioms: 0
Translator task size: 4435
Translator peak memory: 35672 KB
Writing output... [0.070s CPU, 0.076s wall-clock]
Done! [0.830s CPU, 0.842s wall-clock]
planner.py version 0.0.1
Time: 0.17s
Memory: 54MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.08s
Memory: 58MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+2MB)
UNSAT
Iteration Time: 0.10s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.03s
Memory: 60MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 61MB (+1MB)
UNSAT
Iteration Time: 0.04s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.04s
Memory: 63MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+0MB)
UNSAT
Iteration Time: 0.05s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.08s
Memory: 65MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 67MB (+2MB)
UNSAT
Iteration Time: 0.11s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.08s
Memory: 70MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 73MB (+3MB)
UNSAT
Iteration Time: 0.11s
Iteration 6
Queue: [27]
Grounded Until: 19
Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])]
Grounding Time: 0.15s
Memory: 82MB (+9MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 86MB (+4MB)
UNSAT
Iteration Time: 0.19s
Iteration 7
Queue: [39]
Grounded Until: 27
Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])]
Grounding Time: 0.20s
Memory: 96MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 100MB (+4MB)
UNSAT
Iteration Time: 0.30s
Iteration 8
Queue: [55]
Grounded Until: 39
Grounding... [('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 0.32s
Memory: 117MB (+17MB)
Unblocking actions...
Solving...
Solving Time: 1.77s
Memory: 142MB (+25MB)
UNSAT
Iteration Time: 2.19s
Iteration 9
Queue: [78]
Grounded Until: 55
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('check', [78])]
Grounding Time: 0.48s
Memory: 168MB (+26MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","f","l")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","l","m")),3) occurs(action(("put-down","l")),4) occurs(action(("unstack","m","j")),5) occurs(action(("put-down","m")),6) occurs(action(("unstack","j","p")),7) occurs(action(("stack","j","f")),8) occurs(action(("unstack","p","n")),9) occurs(action(("put-down","p")),10) occurs(action(("unstack","h","e")),11) occurs(action(("stack","h","p")),12) occurs(action(("unstack","n","i")),13) occurs(action(("put-down","n")),14) occurs(action(("unstack","i","b")),15) occurs(action(("put-down","i")),16) occurs(action(("unstack","b","d")),17) occurs(action(("put-down","b")),18) occurs(action(("unstack","o","g")),19) occurs(action(("put-down","o")),20) occurs(action(("unstack","d","c")),21) occurs(action(("put-down","d")),22) occurs(action(("unstack","c","k")),23) occurs(action(("stack","c","i")),24) occurs(action(("pick-up","e")),25) occurs(action(("stack","e","k")),26) occurs(action(("pick-up","o")),27) occurs(action(("stack","o","e")),28) occurs(action(("pick-up","m")),29) occurs(action(("stack","m","d")),30) occurs(action(("unstack","o","e")),31) occurs(action(("put-down","o")),32) occurs(action(("unstack","h","p")),33) occurs(action(("stack","h","l")),34) occurs(action(("unstack","c","i")),35) occurs(action(("stack","c","o")),36) occurs(action(("unstack","m","d")),37) occurs(action(("stack","m","c")),38) occurs(action(("unstack","h","l")),39) occurs(action(("stack","h","e")),40) occurs(action(("unstack","h","e")),41) occurs(action(("stack","h","g")),42) occurs(action(("unstack","e","k")),43) occurs(action(("stack","e","j")),44) occurs(action(("unstack","k","a")),45) occurs(action(("stack","k","i")),46) occurs(action(("unstack","e","j")),47) occurs(action(("stack","e","m")),48) occurs(action(("pick-up","n")),49) occurs(action(("stack","n","e")),50) occurs(action(("pick-up","a")),51) occurs(action(("stack","a","n")),52) occurs(action(("unstack","h","g")),53) occurs(action(("stack","h","a")),54) occurs(action(("unstack","j","f")),55) occurs(action(("stack","j","h")),56) occurs(action(("pick-up","l")),57) occurs(action(("stack","l","j")),58) occurs(action(("unstack","k","i")),59) occurs(action(("put-down","k")),60) occurs(action(("pick-up","i")),61) occurs(action(("stack","i","l")),62) occurs(action(("pick-up","k")),63) occurs(action(("stack","k","i")),64) occurs(action(("pick-up","g")),65) occurs(action(("stack","g","k")),66) occurs(action(("pick-up","f")),67) occurs(action(("stack","f","g")),68) occurs(action(("pick-up","p")),69) occurs(action(("put-down","p")),70) occurs(action(("pick-up","p")),71) occurs(action(("stack","p","f")),72) occurs(action(("pick-up","b")),73) occurs(action(("stack","b","p")),74) occurs(action(("pick-up","d")),75) occurs(action(("put-down","d")),76) occurs(action(("pick-up","d")),77) occurs(action(("stack","d","b")),78)
Solving Time: 0.31s
Memory: 179MB (+11MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 4.239s (Solving: 2.07s 1st Model: 0.28s Unsat: 1.79s)
CPU Time : 4.220s
Choices : 58401
Conflicts : 3941 (Analyzed: 3936)
Restarts : 39 (Average: 100.92 Last: 53)
Model-Level : 455.0
Problems : 9 (Average Length: 30.11 Splits: 0)
Lemmas : 3936 (Deleted: 899)
Binary : 242 (Ratio: 6.15%)
Ternary : 134 (Ratio: 3.40%)
Conflict : 3936 (Average Length: 1750.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3936 (Average: 15.38 Max: 953 Sum: 60533)
Executed : 3845 (Average: 14.41 Max: 953 Sum: 56712 Ratio: 93.69%)
Bounded : 91 (Average: 41.99 Max: 60 Sum: 3821 Ratio: 6.31%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 77992 (Eliminated: 0 Frozen: 61564)
Constraints : 517034 (Binary: 93.8% Ternary: 3.9% Other: 2.2%)
Memory Peak : 180MB
Max. Length : 78 steps
Sol. Length : 78 steps