1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2004_psr-small-strips_23.out

160 lines
6.0 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-23.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-23.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-2004/domains/psr-small-strips/domains/domain-23.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-23.pddl
Parsing...
Parsing: [0.120s CPU, 0.118s wall-clock]
Normalizing task... [0.010s CPU, 0.011s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.010s CPU, 0.017s wall-clock]
Generated 157 rules.
Computing model... [0.020s CPU, 0.012s wall-clock]
127 relevant atoms
0 auxiliary atoms
127 final queue length
182 total queue pushes
Completing instantiation... [0.010s CPU, 0.014s wall-clock]
Instantiating: [0.070s CPU, 0.075s wall-clock]
Computing fact groups...
Finding invariants...
56 initial candidates
Finding invariants: [0.120s CPU, 0.118s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
8 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.130s CPU, 0.125s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.001s wall-clock]
Translating task: [0.020s CPU, 0.021s wall-clock]
20 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
22 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.012s wall-clock]
Reordering and filtering variables...
17 of 30 variables necessary.
0 of 22 mutex groups necessary.
44 of 70 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.008s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 38
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 44
Translator axioms: 0
Translator task size: 332
Translator peak memory: 36556 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.380s CPU, 0.383s wall-clock]
planner.py version 0.0.1
Time: 0.02s
Memory: 49MB
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: 50MB (+1MB)
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
Expected Memory: 50MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.01s
Memory: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
UNSAT
Iteration Time: 0.02s
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
Expected Memory: 50MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.01s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.02s
Memory: 51MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 51MB (+0MB)
Answer: 2
occurs(action("wait_cb3"),1) occurs(action("wait_cb3-condeff1-yes"),2) occurs(action("wait_cb3-condeff0-no-0"),2) occurs(action("wait_cb3-endof-condeffs"),3) occurs(action("wait_cb2"),4) occurs(action("wait_cb1"),4) occurs(action("open-sd15"),5) occurs(action("close_cb3"),6) occurs(action("wait_cb3"),7) occurs(action("wait_cb3-condeff1-no-0"),8) occurs(action("wait_cb3-condeff0-no-0"),8) occurs(action("wait_cb3-condeff1-no-0"),9) occurs(action("wait_cb3-condeff0-no-0"),9) occurs(action("wait_cb3-endof-condeffs"),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.067s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.064s
Choices : 108 (Domain: 106)
Conflicts : 37 (Analyzed: 36)
Restarts : 0
Model-Level : 30.5
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 36 (Deleted: 0)
Binary : 4 (Ratio: 11.11%)
Ternary : 2 (Ratio: 5.56%)
Conflict : 36 (Average Length: 28.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 36 (Average: 2.67 Max: 17 Sum: 96)
Executed : 33 (Average: 1.97 Max: 17 Sum: 71 Ratio: 73.96%)
Bounded : 3 (Average: 8.33 Max: 12 Sum: 25 Ratio: 26.04%)
Rules : 2640 (Original: 2472)
Atoms : 1394
Bodies : 1377 (Original: 1287)
Count : 22 (Original: 69)
Equivalences : 467 (Atom=Atom: 80 Body=Body: 0 Other: 387)
Tight : Yes
Variables : 1325 (Eliminated: 0 Frozen: 232)
Constraints : 5617 (Binary: 87.3% Ternary: 10.2% Other: 2.5%)
Memory Peak : 51MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2