tplp-planning-benchmark/m-mp/ipc-2011_parc-printer-sequential-satisficing_9.out

58 lines
4.1 KiB
Plaintext
Raw Permalink Normal View History

Madagascar 0.99999 25/02/2015 09:46:27 amd64 1-core (no VSIDS)
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/domains/domain-9.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-9.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: etipp
Problem: printjob
Parser: 802 ground actions and 420 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 11 0.01 secs
Goal: conjunctive
Simplified: 442 ground actions and 377 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 11)
Plan type: E-step
Allocated 32 MB permanent (total 125 MB)
Horizon 0: 377 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 5372 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 10367 variables
10 UNSAT (0 decisions 0 conflicts)
Horizon 15: 15362 variables
15 UNSAT (0 decisions 0 conflicts)
Horizon 20: 20357 variables
SAT (38 decisions 0 conflicts)
PLAN FOUND: 20 steps
STEP 0: initialize()
STEP 1: fe1-feed-letter(sheet1) fe1-feed-letter(sheet4) fe1-feedmsi-letter(sheet2) fe1-feedmsi-letter(sheet3) fe1-feedmsi-letter(sheet5) fe1-feedmsi-letter(sheet6) fe1-feedmsi-letter(sheet7) fe1-feedmsi-letter(sheet8) fe1-feedmsi-letter(sheet9)
STEP 2: hw1-leftentrytobottomleftexit-letter(sheet1) hw1-leftentrytobottomleftexit-letter(sheet2) hw1-leftentrytobottomleftexit-letter(sheet3) hw1-leftentrytobottomleftexit-letter(sheet4) hw1-leftentrytobottomleftexit-letter(sheet5) hw1-leftentrytobottomleftexit-letter(sheet6) hw1-leftentrytobottomleftexit-letter(sheet7) hw1-leftentrytobottomleftexit-letter(sheet8) hw1-leftentrytobottomleftexit-letter(sheet9)
STEP 3: lc1-inverttoime-letter(sheet1,back,front) lc1-inverttoime-letter(sheet2,back,front) lc1-inverttoime-letter(sheet3,back,front) lc1-inverttoime-letter(sheet4,back,front) lc1-inverttoime-letter(sheet5,back,front) lc1-inverttoime-letter(sheet6,back,front) lc1-inverttoime-letter(sheet7,back,front) lc1-inverttoime-letter(sheet8,back,front) lc1-inverttoime-letter(sheet9,back,front)
STEP 4: lime-simplex-letter(sheet2,front,image-2) lime-simplex-letter(sheet3,front,image-3) lime-simplex-letter(sheet4,front,image-4) lime-simplex-letter(sheet5,front,image-5) lime-simplex-letter(sheet6,front,image-6) lime-simplex-letter(sheet7,front,image-7) lime-simplex-letter(sheet8,front,image-8) lime-simplex-letter(sheet9,front,image-9) lime-simplexmono-letter(sheet1,front,image-1)
STEP 5: lc1-fromime-letter(sheet1) lc1-fromime-letter(sheet2) lc1-fromime-letter(sheet3) lc1-fromime-letter(sheet5) lc1-fromime-letter(sheet6) lc1-fromime-letter(sheet7) lc1-fromime-letter(sheet8) lc1-fromime-letter(sheet9) lc1-invertfromime-letter(sheet4,front,back)
STEP 6: hw1-bottomrightentrytobottomleftexit-letter(sheet4) hw1-bottomrightentrytorightexit-letter(sheet2) hw1-bottomrightentrytorightexit-letter(sheet3) hw1-bottomrightentrytorightexit-letter(sheet5) hw1-bottomrightentrytorightexit-letter(sheet6) hw1-bottomrightentrytorightexit-letter(sheet7) hw1-bottomrightentrytorightexit-letter(sheet8) hw1-bottomrightentrytorightexit-letter(sheet9) hw1-bottomrightentrytotopleftexit-letter(sheet1)
STEP 7: lc1-toime-letter(sheet4) uc1-inverttoime-letter(sheet1,front,back)
STEP 8: lime-simplex-letter(sheet4,back,image-4b) uime-simplex-letter(sheet1,back,image-1b)
STEP 9: lc1-invertfromime-letter(sheet4,back,front) uc1-invertfromime-letter(sheet1,back,front)
STEP 10: hw1-bottomrightentrytorightexit-letter(sheet4) hw1-toprightentrytorightexit-letter(sheet1)
STEP 11: sys-stack-letter(sheet1,dummy-sheet)
STEP 12: sys-stack-letter(sheet2,sheet1)
STEP 13: sys-stack-letter(sheet3,sheet2)
STEP 14: sys-stack-letter(sheet4,sheet3)
STEP 15: sys-stack-letter(sheet5,sheet4)
STEP 16: sys-stack-letter(sheet6,sheet5)
STEP 17: sys-stack-letter(sheet7,sheet6)
STEP 18: sys-stack-letter(sheet8,sheet7)
STEP 19: sys-stack-letter(sheet9,sheet8)
72 actions in the plan.
Cost of the plan is 2486464.
total time 0.04 preprocess 0.01
total size 586.000 MB
max. learned clause length 0
t val conflicts decisions
0 0 0 0
5 0 0 0
10 0 0 0
15 0 0 0
20 1 0 38