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

164 lines
9.1 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-8.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-8.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-8.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-8.pddl
Parsing...
Parsing: [0.060s CPU, 0.065s 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.040s CPU, 0.045s wall-clock]
Preparing model... [0.030s CPU, 0.035s wall-clock]
Generated 211 rules.
Computing model... [0.130s CPU, 0.124s wall-clock]
790 relevant atoms
1094 auxiliary atoms
1884 final queue length
2580 total queue pushes
Completing instantiation... [0.120s CPU, 0.126s wall-clock]
Instantiating: [0.350s CPU, 0.344s wall-clock]
Computing fact groups...
Finding invariants...
20 initial candidates
Finding invariants: [0.030s CPU, 0.039s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
193 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.078s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s 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.000s CPU, 0.006s wall-clock]
Translating task: [0.120s CPU, 0.120s wall-clock]
225 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
10 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.072s wall-clock]
Reordering and filtering variables...
80 of 200 variables necessary.
0 of 8 mutex groups necessary.
345 of 345 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.038s wall-clock]
Translator variables: 80
Translator derived variables: 0
Translator facts: 240
Translator goal facts: 48
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 345
Translator axioms: 0
Translator task size: 2467
Translator peak memory: 38092 KB
Writing output... [0.050s CPU, 0.049s wall-clock]
Done! [0.780s CPU, 0.789s wall-clock]
planner.py version 0.0.1
Time: 0.09s
Memory: 54MB
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: 54MB (+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: 54MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.04s
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: 60.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.03s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+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: 63.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.03s
Memory: 62MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+1MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.07s
Memory: 63MB (+0MB)
Answer: 1
occurs(action("initialize"),1) occurs(action(("fe1-feed-letter","sheet8")),2) occurs(action(("fe1-feedmsi-letter","sheet7")),2) occurs(action(("fe1-feed-letter","sheet6")),2) occurs(action(("fe1-feedmsi-letter","sheet5")),2) occurs(action(("fe1-feedmsi-letter","sheet4")),2) occurs(action(("fe1-feedmsi-letter","sheet3")),2) occurs(action(("fe1-feed-letter","sheet2")),2) occurs(action(("fe1-feedmsi-letter","sheet1")),2) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet8")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet7")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet6")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet5")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet4")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet3")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet2")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet1")),3) occurs(action(("lc1-inverttoime-letter","sheet8","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet7","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet6","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet5","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet4","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet3","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet2","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet1","back","front")),4) occurs(action(("lime-simplex-letter","sheet1","front","image-1")),5) occurs(action(("uime-simplex-letter","sheet2","front","image-2")),5) occurs(action(("lime-simplex-letter","sheet3","front","image-3")),5) occurs(action(("lime-simplex-letter","sheet4","front","image-4")),5) occurs(action(("lime-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","front","image-8")),5) occurs(action(("lc1-fromime-letter","sheet8")),6) occurs(action(("uc1-fromime-letter","sheet7")),6) occurs(action(("lc1-fromime-letter","sheet6")),6) occurs(action(("lc1-fromime-letter","sheet5")),6) occurs(action(("lc1-fromime-letter","sheet4")),6) occurs(action(("lc1-fromime-letter","sheet3")),6) occurs(action(("uc1-fromime-letter","sheet2")),6) occurs(action(("lc1-fromime-letter","sheet1")),6) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet8")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet7")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet6")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet5")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet4")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet3")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet2")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet1")),7) occurs(action(("sys-stack-letter","sheet1","dummy-sheet")),8) occurs(action(("sys-stack-letter","sheet2","sheet1")),9) occurs(action(("sys-stack-letter","sheet3","sheet2")),10) occurs(action(("sys-stack-letter","sheet4","sheet3")),11) occurs(action(("sys-stack-letter","sheet5","sheet4")),12) occurs(action(("sys-stack-letter","sheet6","sheet5")),13) occurs(action(("sys-stack-letter","sheet7","sheet6")),14) occurs(action(("sys-stack-letter","sheet8","sheet7")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.249s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.240s
Choices : 262 (Domain: 214)
Conflicts : 0 (Analyzed: 0)
Restarts : 0
Model-Level : 279.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 0 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
Rules : 7550
Atoms : 7550
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 11427 (Eliminated: 0 Frozen: 1324)
Constraints : 39008 (Binary: 90.9% Ternary: 5.3% Other: 3.8%)
Memory Peak : 66MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1