130 lines
5.8 KiB
Plaintext
130 lines
5.8 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-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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-9.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.016s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.026s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.013s wall-clock]
|
|
Generated 42 rules.
|
|
Computing model... [0.280s CPU, 0.281s wall-clock]
|
|
2607 relevant atoms
|
|
1254 auxiliary atoms
|
|
3861 final queue length
|
|
8243 total queue pushes
|
|
Completing instantiation... [0.850s CPU, 0.841s wall-clock]
|
|
Instantiating: [1.170s CPU, 1.169s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.032s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.020s CPU, 0.017s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
1 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.060s CPU, 0.065s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.040s CPU, 0.033s wall-clock]
|
|
Translating task: [0.600s CPU, 0.597s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
29 propositions removed
|
|
Detecting unreachable propositions: [0.300s CPU, 0.299s wall-clock]
|
|
Reordering and filtering variables...
|
|
27 of 27 variables necessary.
|
|
0 of 27 mutex groups necessary.
|
|
2280 of 2280 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.100s CPU, 0.097s wall-clock]
|
|
Translator variables: 27
|
|
Translator derived variables: 0
|
|
Translator facts: 205
|
|
Translator goal facts: 2
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 2280
|
|
Translator axioms: 0
|
|
Translator task size: 13818
|
|
Translator peak memory: 42328 KB
|
|
Writing output... [0.210s CPU, 0.235s wall-clock]
|
|
Done! [2.490s CPU, 2.514s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 8.02s
|
|
Memory: 427MB
|
|
|
|
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.04s
|
|
Memory: 427MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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: 0.29s
|
|
Memory: 442MB (+15MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("overcome","jealousy","excitement","guava","earth","uranus")),1) occurs(action(("feast","excitement","guava","apple","manitoba","kentucky")),1) occurs(action(("overcome","anger","intoxication","haroset","earth","uranus")),2) occurs(action(("feast","excitement","apple","hotdog","bavaria","arizona")),2) occurs(action(("feast","intoxication","haroset","hamburger","bavaria","arizona")),3) occurs(action(("feast","excitement","hotdog","wurst","bosnia","bavaria")),3) occurs(action(("succumb","jealousy","excitement","wurst","earth","uranus")),4) occurs(action(("overcome","sciatica","entertainment","flounder","saturn","venus")),4) occurs(action(("feast","entertainment","flounder","hamburger","bavaria","arizona")),4) occurs(action(("feast","excitement","wurst","flounder","bosnia","bavaria")),4) occurs(action(("succumb","sciatica","entertainment","hamburger","saturn","venus")),5) occurs(action(("overcome","dread","excitement","flounder","earth","uranus")),5) occurs(action(("feast","excitement","flounder","wurst","bosnia","bavaria")),5)
|
|
Solving Time: 0.02s
|
|
Memory: 449MB (+7MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 2
|
|
Time : 8.582s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
|
CPU Time : 8.530s
|
|
|
|
Choices : 61
|
|
Conflicts : 21 (Analyzed: 21)
|
|
Restarts : 0
|
|
Model-Level : 39.0
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
|
Lemmas : 50 (Deleted: 0)
|
|
Binary : 30 (Ratio: 60.00%)
|
|
Ternary : 0 (Ratio: 0.00%)
|
|
Conflict : 21 (Average Length: 45.9 Ratio: 42.00%)
|
|
Loop : 29 (Average Length: 2.0 Ratio: 58.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 21 (Average: 1.38 Max: 4 Sum: 29)
|
|
Executed : 21 (Average: 1.38 Max: 4 Sum: 29 Ratio: 100.00%)
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
|
|
|
Rules : 3922316
|
|
Atoms : 3922316
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 11092 (Eliminated: 0 Frozen: 9835)
|
|
Constraints : 39549 (Binary: 96.8% Ternary: 1.5% Other: 1.7%)
|
|
|
|
Memory Peak : 449MB
|
|
Max. Length : 5 steps
|
|
Sol. Length : 5 steps
|
|
|
|
|