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

178 lines
11 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/domains/domain-20.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-20.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-20.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-20.pddl
Parsing...
Parsing: [0.070s CPU, 0.072s wall-clock]
Normalizing task... [0.010s CPU, 0.006s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.045s wall-clock]
Preparing model... [0.040s CPU, 0.040s wall-clock]
Generated 211 rules.
Computing model... [0.220s CPU, 0.217s wall-clock]
1526 relevant atoms
1644 auxiliary atoms
3170 final queue length
4886 total queue pushes
Completing instantiation... [0.300s CPU, 0.297s wall-clock]
Instantiating: [0.610s CPU, 0.616s wall-clock]
Computing fact groups...
Finding invariants...
20 initial candidates
Finding invariants: [0.030s CPU, 0.036s wall-clock]
Checking invariant weight... [0.010s CPU, 0.006s wall-clock]
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
405 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.010s CPU, 0.017s wall-clock]
Computing fact groups: [0.110s CPU, 0.115s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.005s 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.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.015s wall-clock]
Translating task: [0.290s CPU, 0.290s wall-clock]
601 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [0.160s CPU, 0.161s wall-clock]
Reordering and filtering variables...
117 of 416 variables necessary.
0 of 12 mutex groups necessary.
781 of 781 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.090s CPU, 0.086s wall-clock]
Translator variables: 117
Translator derived variables: 0
Translator facts: 354
Translator goal facts: 72
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 781
Translator axioms: 0
Translator task size: 5541
Translator peak memory: 40652 KB
Writing output... [0.090s CPU, 0.104s wall-clock]
Done! [1.460s CPU, 1.475s wall-clock]
planner.py version 0.0.1
Time: 0.22s
Memory: 62MB
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: 62MB (+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: 62MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.06s
Memory: 62MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 64MB (+2MB)
UNSAT
Iteration Time: 0.09s
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: 66.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.07s
Memory: 68MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 70MB (+2MB)
UNSAT
Iteration Time: 0.11s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 76.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.07s
Memory: 74MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 77MB (+3MB)
UNSAT
Iteration Time: 0.12s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 84.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.07s
Memory: 79MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 83MB (+4MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.17s
Memory: 83MB (+0MB)
Answer: 1
occurs(action("initialize"),1) occurs(action(("fe1-feedmsi-letter","sheet12")),2) occurs(action(("fe1-feedmsi-letter","sheet11")),2) occurs(action(("fe1-feed-letter","sheet10")),2) occurs(action(("fe1-feed-letter","sheet9")),2) occurs(action(("fe1-feedmsi-letter","sheet8")),2) occurs(action(("fe1-feed-letter","sheet7")),2) occurs(action(("fe1-feed-letter","sheet6")),2) occurs(action(("fe1-feedmsi-letter","sheet5")),2) occurs(action(("fe1-feed-letter","sheet4")),2) occurs(action(("fe1-feed-letter","sheet3")),2) occurs(action(("fe1-feed-letter","sheet2")),2) occurs(action(("fe1-feed-letter","sheet1")),2) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet12")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet11")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet10")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet9")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet8")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet7")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet6")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet5")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet4")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet3")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet2")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet1")),3) occurs(action(("uc1-inverttoime-letter","sheet12","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet11","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet10","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet9","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet7","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet6","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet5","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet4","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet3","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet2","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet1","back","front")),4) occurs(action(("lc1-toime-letter","sheet8")),4) occurs(action(("lime-simplex-letter","sheet1","front","image-1")),5) occurs(action(("lime-simplex-letter","sheet2","front","image-2")),5) occurs(action(("uime-simplex-letter","sheet3","front","image-3")),5) occurs(action(("uime-simplex-letter","sheet4","front","image-4")),5) occurs(action(("uime-simplex-letter","sheet5","front","image-5")),5) occurs(action(("lime-simplex-letter","sheet6","front","image-6")),5) occurs(action(("uime-simplex-letter","sheet7","front","image-7")),5) occurs(action(("lime-simplex-letter","sheet8","back","image-8b")),5) occurs(action(("uime-simplex-letter","sheet9","front","image-9")),5) occurs(action(("uime-simplex-letter","sheet10","front","image-10")),5) occurs(action(("uime-simplex-letter","sheet11","front","image-11")),5) occurs(action(("uime-simplex-letter","sheet12","front","image-12")),5) occurs(action(("lc1-invertfromime-letter","sheet8","back","front")),6) occurs(action(("uc1-fromime-letter","sheet12")),6) occurs(action(("uc1-fromime-letter","sheet11")),6) occurs(action(("uc1-fromime-letter","sheet10")),6) occurs(action(("uc1-fromime-letter","sheet9")),6) occurs(action(("uc1-fromime-letter","sheet7")),6) occurs(action(("lc1-fromime-letter","sheet6")),6) occurs(action(("uc1-fromime-letter","sheet5")),6) occurs(action(("uc1-fromime-letter","sheet4")),6) occurs(action(("uc1-fromime-letter","sheet3")),6) occurs(action(("lc1-fromime-letter","sheet2")),6) occurs(action(("lc1-fromime-letter","sheet1")),6) occurs(action(("hw1-toprightentrytorightexit-letter","sheet11")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet10")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet9")),7) occurs(action(("hw1-bottomrightentrytobottomleftexit-letter","sheet8")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet7")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet6")),7) occurs(
SATISFIABLE
Models : 1+
Calls : 5
Time : 0.684s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.676s
Choices : 2290 (Domain: 2190)
Conflicts : 22 (Analyzed: 22)
Restarts : 0
Model-Level : 782.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 22 (Deleted: 0)
Binary : 9 (Ratio: 40.91%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 22 (Average Length: 48.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 22 (Average: 69.55 Max: 406 Sum: 1530)
Executed : 22 (Average: 69.55 Max: 406 Sum: 1530 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 16574
Atoms : 16574
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 28068 (Eliminated: 0 Frozen: 2701)
Constraints : 127131 (Binary: 93.9% Ternary: 3.5% Other: 2.6%)
Memory Peak : 90MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 1