116 lines
4.3 KiB
Plaintext
116 lines
4.3 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.026s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.160s CPU, 0.158s wall-clock]
|
||
|
|
1376 relevant atoms
|
||
|
|
903 auxiliary atoms
|
||
|
|
2279 final queue length
|
||
|
|
3128 total queue pushes
|
||
|
|
Completing instantiation... [0.170s CPU, 0.168s wall-clock]
|
||
|
|
Instantiating: [0.370s CPU, 0.376s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.016s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 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.044s 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.010s CPU, 0.009s wall-clock]
|
||
|
|
Translating task: [0.180s CPU, 0.178s wall-clock]
|
||
|
|
60 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
11 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.100s CPU, 0.098s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
14 of 14 variables necessary.
|
||
|
|
3 of 14 mutex groups necessary.
|
||
|
|
948 of 948 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Translator variables: 14
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 176
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 9
|
||
|
|
Translator operators: 948
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 4037
|
||
|
|
Translator peak memory: 35928 KB
|
||
|
|
Writing output... [0.070s CPU, 0.081s wall-clock]
|
||
|
|
Done! [0.830s CPU, 0.841s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.92s
|
||
|
|
Memory: 97MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [(0,0,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 97MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
PLAN NOT FOUND
|
||
|
|
|
||
|
|
Models : 0
|
||
|
|
Calls : 1
|
||
|
|
Time : 0.936s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.920s
|
||
|
|
|
||
|
|
Choices : 0
|
||
|
|
Conflicts : 0 (Analyzed: 0)
|
||
|
|
Restarts : 0
|
||
|
|
Problems : 1 (Average Length: 2.00 Splits: 0)
|
||
|
|
Lemmas : 0 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
|
||
|
|
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
|
||
|
|
|
||
|
|
Rules : 500737
|
||
|
|
Atoms : 500737
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 0 (Eliminated: 0 Frozen: 0)
|
||
|
|
Constraints : 0 (Binary: 0.0% Ternary: 0.0% Other: 0.0%)
|
||
|
|
|
||
|
|
Memory Peak : 100MB
|
||
|
|
Max. Length : 0 steps
|
||
|
|
|
||
|
|
|