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-29.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-29.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.015s 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.020s CPU, 0.025s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.012s wall-clock]
|
|
Generated 42 rules.
|
|
Computing model... [0.170s CPU, 0.177s wall-clock]
|
|
1534 relevant atoms
|
|
892 auxiliary atoms
|
|
2426 final queue length
|
|
4719 total queue pushes
|
|
Completing instantiation... [0.440s CPU, 0.434s wall-clock]
|
|
Instantiating: [0.650s CPU, 0.655s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.026s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.014s wall-clock]
|
|
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
1 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.050s CPU, 0.054s 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.020s CPU, 0.017s wall-clock]
|
|
Translating task: [0.320s CPU, 0.317s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
24 propositions removed
|
|
Detecting unreachable propositions: [0.160s CPU, 0.160s wall-clock]
|
|
Reordering and filtering variables...
|
|
22 of 22 variables necessary.
|
|
0 of 22 mutex groups necessary.
|
|
1224 of 1224 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.060s CPU, 0.055s wall-clock]
|
|
Translator variables: 22
|
|
Translator derived variables: 0
|
|
Translator facts: 177
|
|
Translator goal facts: 2
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 1224
|
|
Translator axioms: 0
|
|
Translator task size: 7377
|
|
Translator peak memory: 37976 KB
|
|
Writing output... [0.120s CPU, 0.130s wall-clock]
|
|
Done! [1.390s CPU, 1.405s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.30s
|
|
Memory: 64MB
|
|
|
|
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: 64MB (+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
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.11s
|
|
Memory: 64MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("feast","achievement","scallop","pork","bavaria","oregon")),1) occurs(action(("feast","excitement","pork","pear","manitoba","bavaria")),1) occurs(action(("overcome","jealousy","achievement","pork","neptune","uranus")),2) occurs(action(("feast","achievement","pork","broccoli","quebec","manitoba")),3) occurs(action(("feast","achievement","broccoli","shrimp","pennsylvania","alsace")),4) occurs(action(("succumb","jealousy","achievement","shrimp","neptune","uranus")),5)
|
|
Solving Time: 0.01s
|
|
Memory: 67MB (+3MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 2
|
|
Time : 0.499s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
|
CPU Time : 0.470s
|
|
|
|
Choices : 52 (Domain: 41)
|
|
Conflicts : 11 (Analyzed: 11)
|
|
Restarts : 0
|
|
Model-Level : 30.0
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
|
Lemmas : 11 (Deleted: 0)
|
|
Binary : 1 (Ratio: 9.09%)
|
|
Ternary : 1 (Ratio: 9.09%)
|
|
Conflict : 11 (Average Length: 8.1 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 11 (Average: 2.64 Max: 5 Sum: 29)
|
|
Executed : 11 (Average: 2.64 Max: 5 Sum: 29 Ratio: 100.00%)
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
|
|
|
Rules : 24958
|
|
Atoms : 24958
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 6773 (Eliminated: 0 Frozen: 5591)
|
|
Constraints : 27134 (Binary: 96.2% Ternary: 1.4% Other: 2.3%)
|
|
|
|
Memory Peak : 67MB
|
|
Max. Length : 5 steps
|
|
Sol. Length : 5 steps
|
|
|
|
|