tplp-planning-benchmark/gc-ta1-tt1/ipc-2004_psr-small-strips_39.out

188 lines
7.2 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-39.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-39.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-39.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-39.pddl
Parsing...
Parsing: [0.100s CPU, 0.106s wall-clock]
Normalizing task... [0.010s CPU, 0.011s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 192 rules.
Computing model... [0.010s CPU, 0.009s wall-clock]
133 relevant atoms
0 auxiliary atoms
133 final queue length
211 total queue pushes
Completing instantiation... [0.010s CPU, 0.015s wall-clock]
Instantiating: [0.070s CPU, 0.077s wall-clock]
Computing fact groups...
Finding invariants...
50 initial candidates
Finding invariants: [0.460s CPU, 0.454s 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...
10 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.470s CPU, 0.460s 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.024s wall-clock]
35 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
16 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.014s wall-clock]
Reordering and filtering variables...
21 of 26 variables necessary.
0 of 16 mutex groups necessary.
72 of 82 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
Translator variables: 21
Translator derived variables: 0
Translator facts: 50
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 72
Translator axioms: 0
Translator task size: 506
Translator peak memory: 37068 KB
Writing output... [0.000s CPU, 0.012s wall-clock]
Done! [0.700s CPU, 0.716s wall-clock]
planner.py version 0.0.1
Time: 0.02s
Memory: 50MB
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 (+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
Expected Memory: 50MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.01s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+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: 52.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.01s
Memory: 51MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.02s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 53.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.01s
Memory: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 52MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.02s
Memory: 53MB (+1MB)
Solving...
Solving Time: 0.01s
Memory: 53MB (+0MB)
UNSAT
Iteration Time: 0.05s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 54.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.01s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 54MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 54MB (+0MB)
Answer: 2
occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff0-yes"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("wait_cb3"),4) occurs(action("wait_cb3-condeff3-yes"),5) occurs(action("wait_cb3-condeff2-no-0"),5) occurs(action("wait_cb3-condeff1-no-0"),5) occurs(action("wait_cb3-condeff0-no-0"),5) occurs(action("wait_cb3-endof-condeffs"),6) occurs(action("wait_cb2"),7) occurs(action("open-sd12"),8) occurs(action("open-sd1"),8) occurs(action("close_cb1"),9) occurs(action("wait_cb1"),10) occurs(action("wait_cb1-condeff0-no-0"),11) occurs(action("wait_cb1-endof-condeffs"),12) occurs(action("close_cb3"),13) occurs(action("wait_cb3"),14) occurs(action("wait_cb3-condeff3-no-0"),15) occurs(action("wait_cb3-condeff2-no-0"),15) occurs(action("wait_cb3-condeff1-no-0"),15) occurs(action("wait_cb3-condeff0-no-0"),15) occurs(action("wait_cb3-endof-condeffs"),16) occurs(action("close_cb2"),17) occurs(action("wait_cb2"),18) occurs(action("close_cb2"),19) occurs(action("wait_cb2"),20)
SATISFIABLE
Models : 1+
Calls : 6
Time : 0.123s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.01s)
CPU Time : 0.108s
Choices : 853 (Domain: 853)
Conflicts : 333 (Analyzed: 330)
Restarts : 2 (Average: 165.00 Last: 48)
Model-Level : 55.0
Problems : 6 (Average Length: 12.83 Splits: 0)
Lemmas : 330 (Deleted: 0)
Binary : 7 (Ratio: 2.12%)
Ternary : 5 (Ratio: 1.52%)
Conflict : 330 (Average Length: 81.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 330 (Average: 2.70 Max: 23 Sum: 892)
Executed : 315 (Average: 2.34 Max: 23 Sum: 772 Ratio: 86.55%)
Bounded : 15 (Average: 8.00 Max: 14 Sum: 120 Ratio: 13.45%)
Rules : 5450 (Original: 5132)
Atoms : 2287
Bodies : 3330 (Original: 3139)
Count : 51 (Original: 133)
Equivalences : 981 (Atom=Atom: 124 Body=Body: 0 Other: 857)
Tight : Yes
Variables : 4025 (Eliminated: 0 Frozen: 1247)
Constraints : 19273 (Binary: 88.8% Ternary: 8.7% Other: 2.5%)
Memory Peak : 54MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 2