130 lines
5.2 KiB
Plaintext
130 lines
5.2 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-17.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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-17.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [1.710s CPU, 1.714s wall-clock]
|
||
|
|
17564 relevant atoms
|
||
|
|
6015 auxiliary atoms
|
||
|
|
23579 final queue length
|
||
|
|
56133 total queue pushes
|
||
|
|
Completing instantiation... [6.290s CPU, 6.282s wall-clock]
|
||
|
|
Instantiating: [8.070s CPU, 8.064s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.110s CPU, 0.114s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.050s CPU, 0.052s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
2 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.230s CPU, 0.231s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s 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.004s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.240s CPU, 0.244s wall-clock]
|
||
|
|
Translating task: [4.740s CPU, 4.746s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
56 propositions removed
|
||
|
|
Detecting unreachable propositions: [2.410s CPU, 2.404s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
52 of 52 variables necessary.
|
||
|
|
0 of 52 mutex groups necessary.
|
||
|
|
16616 of 16616 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.700s CPU, 0.696s wall-clock]
|
||
|
|
Translator variables: 52
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 730
|
||
|
|
Translator goal facts: 1
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 16616
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 99223
|
||
|
|
Translator peak memory: 97936 KB
|
||
|
|
Writing output... [1.590s CPU, 1.749s wall-clock]
|
||
|
|
Done! [17.970s CPU, 18.120s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 3.68s
|
||
|
|
Memory: 312MB
|
||
|
|
|
||
|
|
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.02s
|
||
|
|
Memory: 312MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.02s
|
||
|
|
|
||
|
|
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
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 1.39s
|
||
|
|
Memory: 312MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("feast","satisfaction","potato","yogurt","guanabara","bosnia")),1) occurs(action(("overcome","abrasion-4","rest","ham","mercury","saturn")),2) occurs(action(("overcome","abrasion","satisfaction","yogurt","mercury","saturn")),3) occurs(action(("feast","satisfaction","yogurt","wonderbread","guanabara","bosnia")),4) occurs(action(("succumb","abrasion","satisfaction","wonderbread","mercury","saturn")),5)
|
||
|
|
Solving Time: 0.25s
|
||
|
|
Memory: 322MB (+10MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 6.401s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 6.180s
|
||
|
|
|
||
|
|
Choices : 72
|
||
|
|
Conflicts : 16 (Analyzed: 16)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 20.0
|
||
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
|
Lemmas : 16 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 12.50%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 16 (Average Length: 91.9 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 16 (Average: 3.69 Max: 29 Sum: 59)
|
||
|
|
Executed : 16 (Average: 3.69 Max: 29 Sum: 59 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 299743
|
||
|
|
Atoms : 299743
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 73274 (Eliminated: 0 Frozen: 69038)
|
||
|
|
Constraints : 195310 (Binary: 98.2% Ternary: 0.8% Other: 1.0%)
|
||
|
|
|
||
|
|
Memory Peak : 330MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
|
||
|
|
|