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

150 lines
5.6 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-6.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-6.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-6.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-6.pddl
Parsing...
Parsing: [0.030s CPU, 0.032s wall-clock]
Normalizing task... [0.000s CPU, 0.004s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.000s CPU, 0.005s wall-clock]
Generated 48 rules.
Computing model... [0.000s CPU, 0.004s wall-clock]
42 relevant atoms
0 auxiliary atoms
42 final queue length
57 total queue pushes
Completing instantiation... [0.010s CPU, 0.005s wall-clock]
Instantiating: [0.030s CPU, 0.028s wall-clock]
Computing fact groups...
Finding invariants...
20 initial candidates
Finding invariants: [0.040s CPU, 0.036s 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...
3 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.040s CPU, 0.039s 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.010s CPU, 0.007s wall-clock]
6 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
8 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.005s wall-clock]
Reordering and filtering variables...
6 of 11 variables necessary.
0 of 8 mutex groups necessary.
11 of 21 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.002s wall-clock]
Translator variables: 6
Translator derived variables: 0
Translator facts: 13
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 11
Translator axioms: 0
Translator task size: 81
Translator peak memory: 36044 KB
Writing output... [0.010s CPU, 0.004s wall-clock]
Done! [0.120s CPU, 0.123s wall-clock]
planner.py version 0.0.1
Time: 0.01s
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-condeff0-yes"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("close_cb1"),4) occurs(action("open-sd1"),4) occurs(action("wait_cb1"),5) occurs(action("wait_cb1-condeff0-no-0"),6) occurs(action("wait_cb1-condeff0-no-0"),7) occurs(action("wait_cb1-condeff0-no-0"),8) occurs(action("wait_cb1-condeff0-no-0"),9) occurs(action("wait_cb1-endof-condeffs"),10)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.032s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.032s
Choices : 6 (Domain: 6)
Conflicts : 2 (Analyzed: 1)
Restarts : 0
Model-Level : 17.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 1 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 1 (Average Length: 15.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1 (Average: 1.00 Max: 1 Sum: 1)
Executed : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 265
Atoms : 265
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 334 (Eliminated: 0 Frozen: 0)
Constraints : 929 (Binary: 84.3% Ternary: 13.2% Other: 2.5%)
Memory Peak : 50MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1