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

150 lines
5.8 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-3.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-3.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-3.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-3.pddl
Parsing...
Parsing: [0.030s CPU, 0.037s wall-clock]
Normalizing task... [0.010s CPU, 0.004s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.010s CPU, 0.006s wall-clock]
Generated 53 rules.
Computing model... [0.000s CPU, 0.004s wall-clock]
41 relevant atoms
0 auxiliary atoms
41 final queue length
60 total queue pushes
Completing instantiation... [0.010s CPU, 0.006s wall-clock]
Instantiating: [0.030s CPU, 0.033s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.060s CPU, 0.055s 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...
4 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.060s CPU, 0.057s 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.000s CPU, 0.007s wall-clock]
10 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
6 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.005s wall-clock]
Reordering and filtering variables...
8 of 10 variables necessary.
0 of 6 mutex groups necessary.
18 of 22 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.003s wall-clock]
Translator variables: 8
Translator derived variables: 0
Translator facts: 18
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 18
Translator axioms: 0
Translator task size: 126
Translator peak memory: 36044 KB
Writing output... [0.000s CPU, 0.005s wall-clock]
Done! [0.140s CPU, 0.153s 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.01s
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: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.00s
Memory: 50MB (+0MB)
Answer: 1
occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff1-yes"),2) occurs(action("wait_cb1-condeff0-yes"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("close_cb1"),4) occurs(action("open-sd4"),4) occurs(action("open-sd1"),4) occurs(action("wait_cb1"),5) occurs(action("wait_cb1-condeff1-no-0"),6) occurs(action("wait_cb1-condeff0-no-0"),6) occurs(action("wait_cb1-condeff1-no-0"),7) occurs(action("wait_cb1-condeff1-no-0"),8) occurs(action("wait_cb1-condeff1-no-0"),9) occurs(action("wait_cb1-condeff0-no-0"),9) occurs(action("wait_cb1-endof-condeffs"),10)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.039s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.036s
Choices : 29 (Domain: 25)
Conflicts : 8 (Analyzed: 7)
Restarts : 0
Model-Level : 29.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 7 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 7 (Average Length: 34.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7 (Average: 3.00 Max: 14 Sum: 21)
Executed : 6 (Average: 1.71 Max: 14 Sum: 12 Ratio: 57.14%)
Bounded : 1 (Average: 9.00 Max: 9 Sum: 9 Ratio: 42.86%)
Rules : 411
Atoms : 411
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 474 (Eliminated: 0 Frozen: 0)
Constraints : 1447 (Binary: 86.7% Ternary: 10.6% Other: 2.8%)
Memory Peak : 50MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1