178 lines
11 KiB
Plaintext
178 lines
11 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-9.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-9.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.021s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.030s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
|
Generated 51 rules.
|
|
Computing model... [0.720s CPU, 0.717s wall-clock]
|
|
5594 relevant atoms
|
|
3649 auxiliary atoms
|
|
9243 final queue length
|
|
19899 total queue pushes
|
|
Completing instantiation... [1.680s CPU, 1.668s wall-clock]
|
|
Instantiating: [2.450s CPU, 2.444s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
5 initial candidates
|
|
Finding invariants: [0.160s CPU, 0.158s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
12 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.006s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.180s CPU, 0.183s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.003s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.070s CPU, 0.073s wall-clock]
|
|
Translating task: [1.430s CPU, 1.432s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
12 propositions removed
|
|
Detecting unreachable propositions: [0.670s CPU, 0.663s wall-clock]
|
|
Reordering and filtering variables...
|
|
24 of 24 variables necessary.
|
|
12 of 24 mutex groups necessary.
|
|
4884 of 4884 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.200s CPU, 0.202s wall-clock]
|
|
Translator variables: 24
|
|
Translator derived variables: 0
|
|
Translator facts: 168
|
|
Translator goal facts: 24
|
|
Translator mutex groups: 12
|
|
Translator total mutex groups size: 144
|
|
Translator operators: 4884
|
|
Translator axioms: 0
|
|
Translator task size: 24912
|
|
Translator peak memory: 54220 KB
|
|
Writing output... [0.440s CPU, 0.492s wall-clock]
|
|
Done! [5.470s CPU, 5.512s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 1.08s
|
|
Memory: 118MB
|
|
|
|
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: 118MB (+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: 118MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.34s
|
|
Memory: 118MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 122MB (+4MB)
|
|
UNSAT
|
|
Iteration Time: 0.53s
|
|
|
|
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: 126.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.31s
|
|
Memory: 134MB (+12MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.99s
|
|
Memory: 147MB (+13MB)
|
|
UNSAT
|
|
Iteration Time: 1.47s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 172.0MB
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.33s
|
|
Memory: 160MB (+13MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 2.78s
|
|
Memory: 179MB (+19MB)
|
|
UNKNOWN
|
|
Iteration Time: 3.29s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 15
|
|
Expected Memory: 211.0MB
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.40s
|
|
Memory: 199MB (+20MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.05s
|
|
Memory: 209MB (+10MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.79s
|
|
Memory: 209MB (+0MB)
|
|
Answer: 1
|
|
occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-1","car-out-1")),1) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-in-2","car-out-3")),1) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-in-3","car-out-4")),1) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-in-4","car-out-5")),1) occurs(action(("rotate-2","seg-in-1","seg-out-5","car-out-1","car-in-4")),2) occurs(action(("rotate-2","seg-in-6","seg-out-1","car-in-6","car-in-1")),2) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-out-5","car-in-2")),2) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-in-5","car-in-3")),2) occurs(action(("rotate-2","seg-in-3","seg-out-2","car-out-4","car-out-2")),2) occurs(action(("rotate-2","seg-in-2","seg-out-6","car-out-3","car-out-6")),2) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-4","car-in-6")),3) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-out-6","car-in-5")),3) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-in-3","car-out-1")),3) occurs(action(("rotate-2","seg-in-4","seg-out-6","car-in-2","car-out-3")),3) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-2","car-out-5")),3) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-6","car-in-4")),4) occurs(action(("rotate-2","seg-in-6","seg-out-5","car-in-1","car-in-3")),4) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-out-1","car-out-2")),4) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-4","car-out-4")),5) occurs(action(("rotate-2","seg-in-3","seg-out-1","car-out-5","car-in-6")),5) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-in-5","car-out-1")),5) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-4","car-out-5")),6) occurs(action(("rotate-2","seg-in-4","seg-out-2","car-out-3","car-in-4")),6) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-out-2","car-in-5")),6) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-5","car-out-3")),7) occurs(action(("rotate-2","seg-in-6","seg-out-1","car-in-3","car-out-4")),7) occurs(action(("rotate-2","seg-in-4","seg-out-6","car-in-4","car-in-2")),7) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-3","car-in-3")),8) occurs(action(("rotate-2","seg-in-6","seg-out-6","car-out-4","car-in-4")),8) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-1","car-out-5")),8) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-3","car-out-3")),9) occurs(action(("rotate-2","seg-in-6","seg-out-5","car-in-4","car-in-1")),9) occurs(action(("rotate-2","seg-in-5","seg-out-2","car-in-5","car-out-1")),9) occurs(action(("rotate-2","seg-in-3","seg-out-6","car-in-6","car-out-4")),9) occurs(action(("rotate-2","seg-in-1","seg-out-4","car-out-3","car-out-6")),10) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-out-5","car-in-3")),10) occurs(action(("rotate-2","seg-in-6","seg-out-6","car-in-1","car-in-6")),10) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-out-1","car-in-4")),10) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-6","car-out-5")),11) occurs(action(("rotate-2","seg-in-2","seg-out-6","car-in-3","car-in-1")),11) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-out-5","car-out-2")),12) occurs(action(("rotate-2","seg-in-5","seg-out-6","car-in-4","car-in-3")),12) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-2","car-out-6")),13) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-4","car-out-5")),13) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-6","car-in-5")),14) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-in-3","car-out-4")),14) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-5","car-out-2")),15) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-out-4","car-out-3")),15) occurs(action(("rotate-2","seg-in-4","seg-out-2","car-in-2","car-out-6")),15) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-2","car-in-2")),16) occurs(action(("rotate-2","seg-in-3","seg-out-1","car-out-5","car-in-5")),16) occurs(action(("rotate-2","seg-in-4","seg-out-6","car-out-6","car-in-4")),16) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-2","car-out-5")),17) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-in-5","car-in-3")),17) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-5","car-in-2")),18) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-out-3","car-in-5")),18) occurs(action(("rotate-2","seg-in-1","seg-out-5","car-in-2","car-out-1")),19) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-in-1","car-out-5")),19) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-1","car-in-1")),20) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-out-5","car-in-2")),20)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 5
|
|
Time : 7.042s (Solving: 3.76s 1st Model: 0.02s Unsat: 0.98s)
|
|
CPU Time : 7.000s
|
|
|
|
Choices : 102800 (Domain: 102788)
|
|
Conflicts : 13425 (Analyzed: 13423)
|
|
Restarts : 163 (Average: 82.35 Last: 132)
|
|
Model-Level : 619.0
|
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
|
Lemmas : 13423 (Deleted: 8982)
|
|
Binary : 195 (Ratio: 1.45%)
|
|
Ternary : 204 (Ratio: 1.52%)
|
|
Conflict : 13423 (Average Length: 421.2 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 13423 (Average: 6.77 Max: 225 Sum: 90858)
|
|
Executed : 13404 (Average: 6.77 Max: 225 Sum: 90817 Ratio: 99.95%)
|
|
Bounded : 19 (Average: 2.16 Max: 12 Sum: 41 Ratio: 0.05%)
|
|
|
|
Rules : 79646
|
|
Atoms : 79646
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 99671 (Eliminated: 0 Frozen: 2880)
|
|
Constraints : 729621 (Binary: 99.1% Ternary: 0.4% Other: 0.5%)
|
|
|
|
Memory Peak : 252MB
|
|
Max. Length : 20 steps
|
|
Sol. Length : 20 steps
|
|
Models : 1
|
|
|
|
|