150 lines
6.7 KiB
Plaintext
150 lines
6.7 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-13.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-13.pddl
|
|
Parsing...
|
|
Parsing: [0.510s CPU, 0.505s wall-clock]
|
|
Normalizing task... [0.010s CPU, 0.013s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.120s CPU, 0.118s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
|
Preparing model... [0.850s CPU, 0.851s wall-clock]
|
|
Generated 23 rules.
|
|
Computing model... [2.160s CPU, 2.161s wall-clock]
|
|
12365 relevant atoms
|
|
22116 auxiliary atoms
|
|
34481 final queue length
|
|
39643 total queue pushes
|
|
Completing instantiation... [1.180s CPU, 1.172s wall-clock]
|
|
Instantiating: [4.350s CPU, 4.353s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
9 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.034s wall-clock]
|
|
Checking invariant weight... [0.030s CPU, 0.029s wall-clock]
|
|
Instantiating groups... [0.040s CPU, 0.037s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
0 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.004s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.120s CPU, 0.119s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.040s CPU, 0.038s wall-clock]
|
|
Translating task: [0.740s CPU, 0.742s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
10 propositions removed
|
|
Detecting unreachable propositions: [0.370s CPU, 0.366s wall-clock]
|
|
Reordering and filtering variables...
|
|
10 of 10 variables necessary.
|
|
0 of 10 mutex groups necessary.
|
|
2742 of 2742 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.110s CPU, 0.108s wall-clock]
|
|
Translator variables: 10
|
|
Translator derived variables: 0
|
|
Translator facts: 204
|
|
Translator goal facts: 8
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 2742
|
|
Translator axioms: 0
|
|
Translator task size: 13804
|
|
Translator peak memory: 52956 KB
|
|
Writing output... [0.240s CPU, 0.272s wall-clock]
|
|
Done! [6.490s CPU, 6.519s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.59s
|
|
Memory: 89MB
|
|
|
|
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: 89MB (+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: 89MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.17s
|
|
Memory: 89MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 90MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.27s
|
|
|
|
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: 91.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.17s
|
|
Memory: 95MB (+5MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 103MB (+8MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.47s
|
|
Memory: 105MB (+2MB)
|
|
Answer: 1
|
|
occurs(action(("drive","t0","l2","l3","level116","level16","level132")),1) occurs(action(("drive","t0","l3","l0","level98","level18","level116")),2) occurs(action(("load","p3","t0","l0")),3) occurs(action(("drive","t0","l0","l1","level86","level12","level98")),3) occurs(action(("unload","p3","t0","l1")),4) occurs(action(("load","p1","t0","l1")),4) occurs(action(("load","p5","t0","l1")),4) occurs(action(("drive","t0","l1","l4","level73","level13","level86")),4) occurs(action(("load","p7","t0","l1")),4) occurs(action(("unload","p5","t0","l4")),5) occurs(action(("load","p0","t0","l4")),5) occurs(action(("load","p2","t0","l4")),5) occurs(action(("drive","t0","l4","l2","level61","level12","level73")),5) occurs(action(("drive","t0","l2","l7","level43","level18","level61")),6) occurs(action(("unload","p2","t0","l7")),7) occurs(action(("drive","t0","l7","l5","level33","level10","level43")),7) occurs(action(("load","p6","t0","l7")),7) occurs(action(("unload","p1","t0","l5")),8) occurs(action(("drive","t0","l5","l6","level15","level18","level33")),8) occurs(action(("unload","p6","t0","l6")),9) occurs(action(("unload","p7","t0","l6")),9) occurs(action(("load","p4","t0","l6")),9) occurs(action(("drive","t0","l6","l1","level12","level3","level15")),9) occurs(action(("unload","p0","t0","l1")),10) occurs(action(("unload","p4","t0","l1")),10) occurs(action(("drive","t0","l1","l0","level0","level12","level12")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 1.179s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 1.144s
|
|
|
|
Choices : 63 (Domain: 61)
|
|
Conflicts : 20 (Analyzed: 19)
|
|
Restarts : 0
|
|
Model-Level : 41.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 19 (Deleted: 0)
|
|
Binary : 1 (Ratio: 5.26%)
|
|
Ternary : 2 (Ratio: 10.53%)
|
|
Conflict : 19 (Average Length: 875.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 19 (Average: 1.89 Max: 7 Sum: 36)
|
|
Executed : 17 (Average: 1.79 Max: 7 Sum: 34 Ratio: 94.44%)
|
|
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 5.56%)
|
|
|
|
Rules : 44361
|
|
Atoms : 44361
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 27950 (Eliminated: 0 Frozen: 1845)
|
|
Constraints : 142463 (Binary: 98.3% Ternary: 0.9% Other: 0.8%)
|
|
|
|
Memory Peak : 127MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 1
|
|
|
|
|