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-12.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-12.pddl
Parsing...
Parsing: [0.000s CPU, 0.010s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.009s wall-clock]
Preparing model... [0.010s CPU, 0.004s wall-clock]
Generated 21 rules.
Computing model... [0.020s CPU, 0.026s wall-clock]
205 relevant atoms
133 auxiliary atoms
338 final queue length
550 total queue pushes
Completing instantiation... [0.040s CPU, 0.036s wall-clock]
Instantiating: [0.080s CPU, 0.077s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
8 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.030s CPU, 0.032s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.001s 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.034s wall-clock]
140 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.021s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
8 of 15 mutex groups necessary.
98 of 98 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 72
Translator goal facts: 6
Translator mutex groups: 8
Translator total mutex groups size: 64
Translator operators: 98
Translator axioms: 0
Translator task size: 871
Translator peak memory: 33368 KB
Writing output... [0.020s CPU, 0.016s wall-clock]
Done! [0.200s CPU, 0.207s wall-clock]
planner.py version 0.0.1
Time: 0.05s
Memory: 47MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.01s
Memory: 48MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+0MB)
UNSAT
Iteration Time: 0.02s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.01s
Memory: 48MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+0MB)
UNSAT
Iteration Time: 0.01s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.02s
Memory: 50MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.02s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.03s
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.03s
Memory: 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 54MB (+1MB)
UNSAT
Iteration Time: 0.10s
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.05s
Memory: 57MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 58MB (+1MB)
UNSAT
Iteration Time: 0.12s
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.06s
Memory: 62MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 64MB (+2MB)
UNSAT
Iteration Time: 0.16s
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.10s
Memory: 70MB (+6MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","b","c")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","c","g")),3) occurs(action(("stack","c","b")),4) occurs(action(("unstack","g","e")),5) occurs(action(("stack","g","c")),6) occurs(action(("unstack","e","f")),7) occurs(action(("put-down","e")),8) occurs(action(("unstack","a","d")),9) occurs(action(("stack","a","e")),10) occurs(action(("pick-up","d")),11) occurs(action(("stack","d","f")),12) occurs(action(("unstack","g","c")),13) occurs(action(("stack","g","d")),14) occurs(action(("unstack","a","e")),15) occurs(action(("put-down","a")),16) occurs(action(("unstack","g","d")),17) occurs(action(("stack","g","a")),18) occurs(action(("unstack","g","a")),19) occurs(action(("stack","g","c")),20) occurs(action(("unstack","g","c")),21) occurs(action(("stack","g","e")),22) occurs(action(("unstack","g","e")),23) occurs(action(("stack","g","d")),24) occurs(action(("pick-up","e")),25) occurs(action(("stack","e","a")),26) occurs(action(("unstack","c","b")),27) occurs(action(("stack","c","b")),28) occurs(action(("unstack","g","d")),29) occurs(action(("stack","g","c")),30) occurs(action(("unstack","g","c")),31) occurs(action(("stack","g","d")),32) occurs(action(("unstack","g","d")),33) occurs(action(("stack","g","c")),34) occurs(action(("unstack","e","a")),35) occurs(action(("stack","e","g")),36) occurs(action(("unstack","e","g")),37) occurs(action(("stack","e","g")),38) occurs(action(("unstack","e","g")),39) occurs(action(("stack","e","d")),40) occurs(action(("unstack","g","c")),41) occurs(action(("put-down","g")),42) occurs(action(("unstack","e","d")),43) occurs(action(("stack","e","g")),44) occurs(action(("unstack","d","f")),45) occurs(action(("stack","d","e")),46) occurs(action(("unstack","d","e")),47) occurs(action(("stack","d","e")),48) occurs(action(("unstack","d","e")),49) occurs(action(("stack","d","e")),50) occurs(action(("unstack","d","e")),51) occurs(action(("put-down","d")),52) occurs(action(("pick-up","f")),53) occurs(action(("stack","f","a")),54) occurs(action(("unstack","c","b")),55) occurs(action(("stack","c","b")),56) occurs(action(("unstack","e","g")),57) occurs(action(("put-down","e")),58) occurs(action(("pick-up","e")),59) occurs(action(("put-down","e")),60) occurs(action(("unstack","c","b")),61) occurs(action(("stack","c","g")),62) occurs(action(("pick-up","e")),63) occurs(action(("stack","e","c")),64) occurs(action(("unstack","f","a")),65) occurs(action(("stack","f","b")),66) occurs(action(("unstack","e","c")),67) occurs(action(("put-down","e")),68) occurs(action(("pick-up","a")),69) occurs(action(("stack","a","c")),70) occurs(action(("pick-up","d")),71) occurs(action(("stack","d","a")),72) occurs(action(("unstack","f","b")),73) occurs(action(("stack","f","d")),74) occurs(action(("pick-up","b")),75) occurs(action(("stack","b","f")),76) occurs(action(("pick-up","e")),77) occurs(action(("stack","e","b")),78)
Solving Time: 0.02s
Memory: 72MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 0.694s (Solving: 0.22s 1st Model: 0.02s Unsat: 0.20s)
CPU Time : 0.690s
Choices : 5655
Conflicts : 3126 (Analyzed: 3119)
Restarts : 35 (Average: 89.11 Last: 54)
Model-Level : 134.0
Problems : 9 (Average Length: 30.11 Splits: 0)
Lemmas : 3119 (Deleted: 0)
Binary : 189 (Ratio: 6.06%)
Ternary : 127 (Ratio: 4.07%)
Conflict : 3119 (Average Length: 110.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3119 (Average: 1.96 Max: 51 Sum: 6107)
Executed : 3073 (Average: 1.76 Max: 51 Sum: 5498 Ratio: 90.03%)
Bounded : 46 (Average: 13.24 Max: 39 Sum: 609 Ratio: 9.97%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 18568 (Eliminated: 0 Frozen: 13588)
Constraints : 115612 (Binary: 90.4% Ternary: 4.6% Other: 5.0%)
Memory Peak : 72MB
Max. Length : 78 steps
Sol. Length : 78 steps