174 lines
8.7 KiB
Plaintext
174 lines
8.7 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-3.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/scanalyzer-3d-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-3.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.024s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.035s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
|
Generated 51 rules.
|
|
Computing model... [0.230s CPU, 0.231s wall-clock]
|
|
1226 relevant atoms
|
|
1561 auxiliary atoms
|
|
2787 final queue length
|
|
4963 total queue pushes
|
|
Completing instantiation... [0.340s CPU, 0.337s wall-clock]
|
|
Instantiating: [0.620s CPU, 0.625s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
5 initial candidates
|
|
Finding invariants: [0.140s CPU, 0.146s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.000s CPU, 0.004s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
8 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.003s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.160s CPU, 0.158s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.020s CPU, 0.015s wall-clock]
|
|
Translating task: [0.270s CPU, 0.272s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
8 propositions removed
|
|
Detecting unreachable propositions: [0.130s CPU, 0.131s wall-clock]
|
|
Reordering and filtering variables...
|
|
16 of 16 variables necessary.
|
|
8 of 16 mutex groups necessary.
|
|
952 of 952 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.040s CPU, 0.042s wall-clock]
|
|
Translator variables: 16
|
|
Translator derived variables: 0
|
|
Translator facts: 80
|
|
Translator goal facts: 16
|
|
Translator mutex groups: 8
|
|
Translator total mutex groups size: 64
|
|
Translator operators: 952
|
|
Translator axioms: 0
|
|
Translator task size: 4992
|
|
Translator peak memory: 40140 KB
|
|
Writing output... [0.090s CPU, 0.099s wall-clock]
|
|
Done! [1.350s CPU, 1.369s 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.05s
|
|
Memory: 62MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 62MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.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: 62MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.06s
|
|
Memory: 66MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.13s
|
|
Memory: 68MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.23s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 74.0MB
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.06s
|
|
Memory: 72MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 75MB (+3MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.24s
|
|
Memory: 83MB (+8MB)
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 81MB (+-2MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 81MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-1","car-out-1")),1) occurs(action(("rotate-2","seg-in-4","seg-out-2","car-in-4","car-out-2")),1) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-in-2","car-out-3")),1) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-out-1","car-in-2")),2) occurs(action(("rotate-2","seg-in-3","seg-out-1","car-in-3","car-in-1")),2) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-3","car-in-4")),2) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-2","car-in-3")),3) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-out-2","car-out-1")),3) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-3","car-in-2")),4) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-in-1","car-out-2")),4) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-2","car-out-3")),5) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-in-4","car-in-3")),5) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-3","car-in-4")),6) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-in-3","car-in-1")),6) occurs(action(("rotate-2","seg-in-1","seg-out-4","car-in-4","car-out-4")),7) occurs(action(("rotate-2","seg-in-4","seg-out-1","car-out-1","car-out-3")),7) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-4","car-out-1")),8) occurs(action(("rotate-2","seg-in-4","seg-out-2","car-out-3","car-in-2")),8) occurs(action(("rotate-2","seg-in-1","seg-out-4","car-out-1","car-in-4")),9) occurs(action(("rotate-2","seg-in-3","seg-out-1","car-out-2","car-out-4")),9) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-in-1","car-out-3")),9) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-4","car-out-2")),10) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-out-3","car-out-1")),10) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-2","car-in-4")),11) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-out-4","car-out-3")),11) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-1","car-in-1")),11) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-4","car-out-1")),12) occurs(action(("rotate-2","seg-in-4","seg-out-1","car-in-2","car-out-2")),12) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-3","car-in-3")),12) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-1","car-in-2")),13) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-in-1","car-in-4")),13) occurs(action(("rotate-2","seg-in-4","seg-out-4","car-out-2","car-out-4")),13) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-2","car-in-1")),14) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-in-4","car-out-2")),14) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-2","car-in-2")),15) occurs(action(("rotate-2","seg-in-4","seg-out-4","car-out-4","car-in-4")),15)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 5
|
|
Time : 0.730s (Solving: 0.14s 1st Model: 0.01s Unsat: 0.13s)
|
|
CPU Time : 0.720s
|
|
|
|
Choices : 6392 (Domain: 6384)
|
|
Conflicts : 1908 (Analyzed: 1906)
|
|
Restarts : 24 (Average: 79.42 Last: 42)
|
|
Model-Level : 181.0
|
|
Problems : 5 (Average Length: 11.00 Splits: 0)
|
|
Lemmas : 1906 (Deleted: 0)
|
|
Binary : 81 (Ratio: 4.25%)
|
|
Ternary : 86 (Ratio: 4.51%)
|
|
Conflict : 1906 (Average Length: 65.8 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1906 (Average: 3.09 Max: 39 Sum: 5897)
|
|
Executed : 1898 (Average: 3.08 Max: 39 Sum: 5878 Ratio: 99.68%)
|
|
Bounded : 8 (Average: 2.38 Max: 12 Sum: 19 Ratio: 0.32%)
|
|
|
|
Rules : 43727 (Original: 43679)
|
|
Atoms : 18113
|
|
Bodies : 13086 (Original: 13038)
|
|
Count : 112 (Original: 120)
|
|
Equivalences : 12940 (Atom=Atom: 15 Body=Body: 0 Other: 12925)
|
|
Tight : Yes
|
|
Variables : 16115 (Eliminated: 0 Frozen: 13838)
|
|
Constraints : 132618 (Binary: 98.0% Ternary: 0.8% Other: 1.2%)
|
|
|
|
Memory Peak : 83MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
Models : 2
|
|
|
|
|