tplp-planning-benchmark/gc-ta1-tt1/ipc-1998_gripper-round-1-strips_2.out

148 lines
6.2 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-2.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/gripper-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-2.pddl
Parsing...
Parsing: [0.000s CPU, 0.010s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.000s CPU, 0.006s wall-clock]
Generated 24 rules.
Computing model... [0.020s CPU, 0.016s wall-clock]
111 relevant atoms
80 auxiliary atoms
191 final queue length
248 total queue pushes
Completing instantiation... [0.020s CPU, 0.017s wall-clock]
Instantiating: [0.060s CPU, 0.052s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.000s CPU, 0.009s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.002s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
0 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.010s CPU, 0.015s 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.015s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
3 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.008s wall-clock]
Reordering and filtering variables...
9 of 9 variables necessary.
6 of 9 mutex groups necessary.
50 of 50 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock]
Translator variables: 9
Translator derived variables: 0
Translator facts: 34
Translator goal facts: 6
Translator mutex groups: 6
Translator total mutex groups size: 24
Translator operators: 50
Translator axioms: 0
Translator task size: 343
Translator peak memory: 36300 KB
Writing output... [0.010s CPU, 0.009s wall-clock]
Done! [0.110s CPU, 0.116s wall-clock]
planner.py version 0.0.1
Time: 0.03s
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
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.01s
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
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...
SERIALIZABLE
Testing Time: 0.01s
Memory: 51MB (+0MB)
Answer: 1
occurs(action(("pick","ball3","rooma","right")),1) occurs(action(("pick","ball1","rooma","left")),1) occurs(action(("move","rooma","roomb")),1) occurs(action(("drop","ball3","roomb","right")),2) occurs(action(("drop","ball1","roomb","left")),2) occurs(action(("move","roomb","rooma")),2) occurs(action(("pick","ball4","rooma","right")),3) occurs(action(("pick","ball2","rooma","left")),3) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball4","roomb","right")),4) occurs(action(("drop","ball2","roomb","left")),4) occurs(action(("move","roomb","rooma")),4) occurs(action(("pick","ball6","rooma","right")),5) occurs(action(("pick","ball5","rooma","left")),5) occurs(action(("move","rooma","roomb")),5) occurs(action(("drop","ball6","roomb","right")),6) occurs(action(("drop","ball5","roomb","left")),6) occurs(action(("move","roomb","rooma")),6) occurs(action(("move","rooma","roomb")),7) occurs(action(("move","roomb","rooma")),8) occurs(action(("move","rooma","roomb")),9) occurs(action(("move","roomb","rooma")),10)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.063s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.01s)
CPU Time : 0.060s
Choices : 755 (Domain: 755)
Conflicts : 429 (Analyzed: 428)
Restarts : 6 (Average: 71.33 Last: 24)
Model-Level : 75.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 428 (Deleted: 0)
Binary : 2 (Ratio: 0.47%)
Ternary : 2 (Ratio: 0.47%)
Conflict : 428 (Average Length: 18.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 428 (Average: 1.56 Max: 8 Sum: 669)
Executed : 426 (Average: 1.56 Max: 8 Sum: 667 Ratio: 99.70%)
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.30%)
Rules : 1074
Atoms : 1074
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 1209 (Eliminated: 0 Frozen: 140)
Constraints : 4920 (Binary: 86.1% Ternary: 11.6% Other: 2.4%)
Memory Peak : 51MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1