tplp-planning-benchmark/gc-ta1-tt1/ipc-2011_parc-printer-sequential-satisficing_1.out

164 lines
9.1 KiB
Plaintext
Raw Permalink Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/domains/domain-1.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-1.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-2011/domains/parc-printer-sequential-satisficing/domains/domain-1.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-1.pddl
Parsing...
Parsing: [0.070s CPU, 0.063s wall-clock]
Normalizing task... [0.000s CPU, 0.005s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.042s wall-clock]
Preparing model... [0.040s CPU, 0.034s wall-clock]
Generated 212 rules.
Computing model... [0.110s CPU, 0.116s wall-clock]
843 relevant atoms
938 auxiliary atoms
1781 final queue length
2600 total queue pushes
Completing instantiation... [0.150s CPU, 0.141s wall-clock]
Instantiating: [0.350s CPU, 0.347s wall-clock]
Computing fact groups...
Finding invariants...
20 initial candidates
Finding invariants: [0.030s CPU, 0.034s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
169 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.008s wall-clock]
Computing fact groups: [0.070s CPU, 0.075s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.007s wall-clock]
Translating task: [0.140s CPU, 0.136s wall-clock]
309 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
9 propositions removed
Detecting unreachable propositions: [0.080s CPU, 0.077s wall-clock]
Reordering and filtering variables...
77 of 175 variables necessary.
0 of 7 mutex groups necessary.
365 of 365 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.042s wall-clock]
Translator variables: 77
Translator derived variables: 0
Translator facts: 266
Translator goal facts: 42
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 365
Translator axioms: 0
Translator task size: 2761
Translator peak memory: 38348 KB
Writing output... [0.070s CPU, 0.087s wall-clock]
Done! [0.840s CPU, 0.851s wall-clock]
planner.py version 0.0.1
Time: 0.13s
Memory: 55MB
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: 55MB (+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
Expected Memory: 55MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.04s
Memory: 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.05s
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
Expected Memory: 59.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.04s
Memory: 60MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 61MB (+1MB)
UNSAT
Iteration Time: 0.05s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 65.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.04s
Memory: 63MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 64MB (+1MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.07s
Memory: 65MB (+1MB)
Answer: 1
occurs(action("initialize"),1) occurs(action(("colorfeeder-feed-letter","sheet7")),2) occurs(action(("colorfeeder-feed-letter","sheet6")),2) occurs(action(("blackfeeder-feed-letter","sheet5")),2) occurs(action(("blackfeeder-feed-letter","sheet4")),2) occurs(action(("blackfeeder-feed-letter","sheet3")),2) occurs(action(("colorfeeder-feed-letter","sheet2")),2) occurs(action(("colorfeeder-feed-letter","sheet1")),2) occurs(action(("blackcontainer-toime-letter","sheet5")),3) occurs(action(("blackcontainer-toime-letter","sheet4")),3) occurs(action(("blackcontainer-toime-letter","sheet3")),3) occurs(action(("down-movebottom-letter","sheet1")),3) occurs(action(("down-movebottom-letter","sheet2")),3) occurs(action(("down-movebottom-letter","sheet6")),3) occurs(action(("down-movebottom-letter","sheet7")),3) occurs(action(("blackprinter-simplex-letter","sheet3","front","image-3")),4) occurs(action(("blackprinter-simplex-letter","sheet4","front","image-4")),4) occurs(action(("blackprinter-simplex-letter","sheet5","front","image-5")),4) occurs(action(("colorcontainer-toime-letter","sheet1")),4) occurs(action(("colorcontainer-toime-letter","sheet2")),4) occurs(action(("colorcontainer-toime-letter","sheet6")),4) occurs(action(("colorcontainer-toime-letter","sheet7")),4) occurs(action(("colorprinter-simplexmono-letter","sheet1","front","image-1")),5) occurs(action(("colorprinter-simplexmono-letter","sheet2","front","image-2")),5) occurs(action(("colorprinter-simplex-letter","sheet6","front","image-6")),5) occurs(action(("colorprinter-simplex-letter","sheet7","front","image-7")),5) occurs(action(("blackcontainer-fromime-letter","sheet3")),5) occurs(action(("blackcontainer-fromime-letter","sheet4")),5) occurs(action(("blackcontainer-fromime-letter","sheet5")),5) occurs(action(("colorcontainer-fromime-letter","sheet7")),6) occurs(action(("colorcontainer-fromime-letter","sheet6")),6) occurs(action(("colorcontainer-fromime-letter","sheet2")),6) occurs(action(("colorcontainer-fromime-letter","sheet1")),6) occurs(action(("endcap-move-letter","sheet3")),6) occurs(action(("endcap-move-letter","sheet4")),6) occurs(action(("endcap-move-letter","sheet5")),6) occurs(action(("up-moveup-letter","sheet7")),7) occurs(action(("up-moveup-letter","sheet6")),7) occurs(action(("up-moveup-letter","sheet2")),7) occurs(action(("up-moveup-letter","sheet1")),7) occurs(action(("htmoverblack-move-letter","sheet3")),7) occurs(action(("htmoverblack-move-letter","sheet4")),7) occurs(action(("htmoverblack-move-letter","sheet5")),7) occurs(action(("finisher1-stack-letter","sheet1","dummy-sheet")),8) occurs(action(("down-movetop-letter","sheet5")),8) occurs(action(("down-movetop-letter","sheet4")),8) occurs(action(("down-movetop-letter","sheet3")),8) occurs(action(("finisher1-stack-letter","sheet2","sheet1")),9) occurs(action(("htmovercolor-move-letter","sheet5")),9) occurs(action(("htmovercolor-move-letter","sheet4")),9) occurs(action(("htmovercolor-move-letter","sheet3")),9) occurs(action(("up-movetop-letter","sheet5")),10) occurs(action(("up-movetop-letter","sheet4")),10) occurs(action(("up-movetop-letter","sheet3")),10) occurs(action(("finisher1-stack-letter","sheet3","sheet2")),11) occurs(action(("finisher1-stack-letter","sheet4","sheet3")),12) occurs(action(("finisher1-stack-letter","sheet5","sheet4")),13) occurs(action(("finisher1-stack-letter","sheet6","sheet5")),14) occurs(action(("finisher1-stack-letter","sheet7","sheet6")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.307s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.296s
Choices : 226 (Domain: 204)
Conflicts : 3 (Analyzed: 3)
Restarts : 0
Model-Level : 236.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 3 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 1 (Ratio: 33.33%)
Conflict : 3 (Average Length: 14.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3 (Average: 2.33 Max: 5 Sum: 7)
Executed : 3 (Average: 2.33 Max: 5 Sum: 7 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 8362
Atoms : 8362
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 11113 (Eliminated: 0 Frozen: 1608)
Constraints : 42205 (Binary: 92.7% Ternary: 5.4% Other: 1.9%)
Memory Peak : 67MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1