216 lines
9.8 KiB
Plaintext
216 lines
9.8 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-19.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/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-19.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [1.390s CPU, 1.400s wall-clock]
|
||
|
|
Normalizing task... [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.330s CPU, 0.327s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Preparing model... [2.700s CPU, 2.700s wall-clock]
|
||
|
|
Generated 23 rules.
|
||
|
|
Computing model... [6.610s CPU, 6.601s wall-clock]
|
||
|
|
36086 relevant atoms
|
||
|
|
63968 auxiliary atoms
|
||
|
|
100054 final queue length
|
||
|
|
117929 total queue pushes
|
||
|
|
Completing instantiation... [4.070s CPU, 4.067s wall-clock]
|
||
|
|
Instantiating: [13.840s CPU, 13.821s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
9 initial candidates
|
||
|
|
Finding invariants: [0.090s CPU, 0.094s wall-clock]
|
||
|
|
Checking invariant weight... [0.080s CPU, 0.084s wall-clock]
|
||
|
|
Instantiating groups... [0.110s CPU, 0.102s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Computing fact groups: [0.320s CPU, 0.320s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.120s CPU, 0.130s wall-clock]
|
||
|
|
Translating task: [2.660s CPU, 2.659s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
16 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.420s CPU, 1.429s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
16 of 16 variables necessary.
|
||
|
|
0 of 16 mutex groups necessary.
|
||
|
|
9350 of 9350 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.380s CPU, 0.370s wall-clock]
|
||
|
|
Translator variables: 16
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 449
|
||
|
|
Translator goal facts: 14
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 9350
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 46837
|
||
|
|
Translator peak memory: 88932 KB
|
||
|
|
Writing output... [0.860s CPU, 0.936s wall-clock]
|
||
|
|
Done! [21.020s CPU, 21.093s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 2.16s
|
||
|
|
Memory: 187MB
|
||
|
|
|
||
|
|
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.01s
|
||
|
|
Memory: 188MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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: 188MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.62s
|
||
|
|
Memory: 188MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.09s
|
||
|
|
Memory: 196MB (+8MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.08s
|
||
|
|
|
||
|
|
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: 204.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.72s
|
||
|
|
Memory: 207MB (+11MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.09s
|
||
|
|
Memory: 232MB (+25MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.19s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 268.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.67s
|
||
|
|
Memory: 245MB (+13MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 7.12s
|
||
|
|
Memory: 306MB (+61MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 8.14s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 380.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.83s
|
||
|
|
Memory: 367MB (+61MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 25.67s
|
||
|
|
Memory: 532MB (+165MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 26.88s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 758.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.66s
|
||
|
|
Memory: 532MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 24.48s
|
||
|
|
Memory: 680MB (+148MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 25.54s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 25
|
||
|
|
Expected Memory: 906.0MB
|
||
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
|
Grounding Time: 0.68s
|
||
|
|
Memory: 680MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 22.84s
|
||
|
|
Memory: 814MB (+134MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 23.94s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 16.93s
|
||
|
|
Memory: 905MB (+91MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 1.68s
|
||
|
|
Memory: 905MB (+0MB)
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("drive","t0","l1","l2","level221","level3","level224")),1) occurs(action(("load","p7","t0","l1")),1) occurs(action(("drive","t0","l2","l12","level208","level13","level221")),2) occurs(action(("load","p0","t0","l12")),3) occurs(action(("load","p1","t0","l12")),3) occurs(action(("drive","t0","l12","l11","level194","level14","level208")),3) occurs(action(("load","p11","t0","l11")),4) occurs(action(("load","p5","t0","l11")),4) occurs(action(("drive","t0","l11","l0","level172","level22","level194")),4) occurs(action(("unload","p1","t0","l0")),5) occurs(action(("unload","p5","t0","l0")),5) occurs(action(("drive","t0","l0","l4","level162","level10","level172")),5) occurs(action(("unload","p0","t0","l4")),6) occurs(action(("load","p3","t0","l4")),6) occurs(action(("load","p4","t0","l4")),6) occurs(action(("drive","t0","l4","l0","level152","level10","level162")),6) occurs(action(("drive","t0","l0","l10","level143","level9","level152")),7) occurs(action(("drive","t0","l10","l7","level141","level2","level143")),8) occurs(action(("load","p6","t0","l10")),8) occurs(action(("unload","p4","t0","l7")),9) occurs(action(("load","p13","t0","l7")),9) occurs(action(("load","p2","t0","l7")),9) occurs(action(("load","p8","t0","l7")),9) occurs(action(("drive","t0","l7","l10","level139","level2","level141")),9) occurs(action(("drive","t0","l10","l5","level133","level6","level139")),10) occurs(action(("unload","p7","t0","l5")),11) occurs(action(("drive","t0","l5","l1","level128","level5","level133")),11) occurs(action(("drive","t0","l1","l3","level116","level12","level128")),12) occurs(action(("drive","t0","l3","l6","level91","level25","level116")),13) occurs(action(("load","p9","t0","l3")),13) occurs(action(("unload","p3","t0","l6")),14) occurs(action(("unload","p8","t0","l6")),14) occurs(action(("load","p10","t0","l6")),14) occurs(action(("load","p12","t0","l6")),14) occurs(action(("drive","t0","l6","l3","level66","level25","level91")),14) occurs(action(("drive","t0","l3","l2","level45","level21","level66")),15) occurs(action(("unload","p11","t0","l2")),16) occurs(action(("drive","t0","l2","l0","level27","level18","level45")),16) occurs(action(("unload","p6","t0","l0")),17) occurs(action(("unload","p9","t0","l0")),17) occurs(action(("drive","t0","l0","l9","level26","level1","level27")),17) occurs(action(("drive","t0","l9","l8","level12","level14","level26")),18) occurs(action(("unload","p10","t0","l8")),19) occurs(action(("unload","p2","t0","l8")),19) occurs(action(("drive","t0","l8","l13","level2","level10","level12")),19) occurs(action(("unload","p12","t0","l13")),20) occurs(action(("unload","p13","t0","l13")),20)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 8
|
||
|
|
Time : 106.067s (Solving: 96.80s 1st Model: 16.87s Unsat: 7.14s)
|
||
|
|
CPU Time : 105.960s
|
||
|
|
|
||
|
|
Choices : 134187 (Domain: 134187)
|
||
|
|
Conflicts : 36679 (Analyzed: 36676)
|
||
|
|
Restarts : 410 (Average: 89.45 Last: 100)
|
||
|
|
Model-Level : 205.0
|
||
|
|
Problems : 8 (Average Length: 18.88 Splits: 0)
|
||
|
|
Lemmas : 36676 (Deleted: 31976)
|
||
|
|
Binary : 86 (Ratio: 0.23%)
|
||
|
|
Ternary : 22 (Ratio: 0.06%)
|
||
|
|
Conflict : 36676 (Average Length: 16288.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 36676 (Average: 1.54 Max: 180 Sum: 56653)
|
||
|
|
Executed : 36643 (Average: 1.53 Max: 180 Sum: 56205 Ratio: 99.21%)
|
||
|
|
Bounded : 33 (Average: 13.58 Max: 32 Sum: 448 Ratio: 0.79%)
|
||
|
|
|
||
|
|
Rules : 150315
|
||
|
|
Atoms : 150315
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 288037 (Eliminated: 0 Frozen: 12939)
|
||
|
|
Constraints : 1831674 (Binary: 99.0% Ternary: 0.6% Other: 0.4%)
|
||
|
|
|
||
|
|
Memory Peak : 905MB
|
||
|
|
Max. Length : 30 steps
|
||
|
|
Sol. Length : 20 steps
|
||
|
|
Models : 1
|
||
|
|
|
||
|
|
|