tplp-planning-benchmark/fd-pb-es/ipc-1998_mystery-round-1-strips_9.out

143 lines
5.9 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.017s 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.030s CPU, 0.028s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 42 rules.
Computing model... [0.290s CPU, 0.286s wall-clock]
2607 relevant atoms
1254 auxiliary atoms
3861 final queue length
8243 total queue pushes
Completing instantiation... [0.840s CPU, 0.837s wall-clock]
Instantiating: [1.170s CPU, 1.175s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.031s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.016s 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.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.070s CPU, 0.063s 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.030s CPU, 0.033s wall-clock]
Translating task: [0.610s CPU, 0.598s 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.298s 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.090s CPU, 0.100s 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.234s wall-clock]
Done! [2.500s CPU, 2.519s wall-clock]
planner.py version 0.0.1
Time: 0.51s
Memory: 82MB
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: 82MB (+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.18s
Memory: 82MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 83MB (+1MB)
UNSAT
Iteration Time: 0.28s
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
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.17s
Memory: 89MB (+6MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","sciatica","entertainment","flounder","saturn","venus")),1) occurs(action(("feast","entertainment","flounder","hamburger","bavaria","arizona")),2) occurs(action(("succumb","sciatica","entertainment","hamburger","saturn","venus")),3) occurs(action(("overcome","sciatica","entertainment","hamburger","saturn","venus")),4) occurs(action(("overcome","jealousy","excitement","guava","earth","uranus")),5) occurs(action(("feast","excitement","guava","apple","manitoba","kentucky")),6) occurs(action(("feast","excitement","apple","hotdog","bavaria","arizona")),7) occurs(action(("feast","excitement","hotdog","wurst","bosnia","bavaria")),8) occurs(action(("succumb","jealousy","excitement","wurst","earth","uranus")),9) occurs(action(("succumb","sciatica","entertainment","hamburger","saturn","venus")),10)
Solving Time: 0.06s
Memory: 96MB (+7MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 1.163s (Solving: 0.06s 1st Model: 0.05s Unsat: 0.01s)
CPU Time : 1.110s
Choices : 850
Conflicts : 451 (Analyzed: 450)
Restarts : 4 (Average: 112.50 Last: 69)
Model-Level : 24.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 450 (Deleted: 0)
Binary : 43 (Ratio: 9.56%)
Ternary : 36 (Ratio: 8.00%)
Conflict : 450 (Average Length: 101.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 450 (Average: 2.07 Max: 28 Sum: 931)
Executed : 435 (Average: 1.84 Max: 28 Sum: 826 Ratio: 88.72%)
Bounded : 15 (Average: 7.00 Max: 12 Sum: 105 Ratio: 11.28%)
Rules : 41800
Atoms : 41800
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 24638 (Eliminated: 0 Frozen: 22090)
Constraints : 143557 (Binary: 97.6% Ternary: 1.1% Other: 1.3%)
Memory Peak : 96MB
Max. Length : 10 steps
Sol. Length : 10 steps