1
0
tplp-planning-benchmark/gc-ta3-tt1/ipc-2002_driverlog-strips-automatic_14.out

157 lines
7.6 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-14.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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-14.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.016s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 35 rules.
Computing model... [0.180s CPU, 0.185s wall-clock]
1580 relevant atoms
947 auxiliary atoms
2527 final queue length
3598 total queue pushes
Completing instantiation... [0.230s CPU, 0.230s wall-clock]
Instantiating: [0.450s CPU, 0.459s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.018s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.018s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.053s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.013s wall-clock]
Translating task: [0.250s CPU, 0.249s wall-clock]
90 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [0.130s CPU, 0.133s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
3 of 15 mutex groups necessary.
1158 of 1158 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.034s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 195
Translator goal facts: 9
Translator mutex groups: 3
Translator total mutex groups size: 12
Translator operators: 1158
Translator axioms: 0
Translator task size: 4965
Translator peak memory: 39628 KB
Writing output... [0.100s CPU, 0.108s wall-clock]
Done! [1.060s CPU, 1.073s wall-clock]
planner.py version 0.0.1
Time: 0.21s
Memory: 61MB
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: 61MB (+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
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.06s
Memory: 61MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+2MB)
UNSAT
Iteration Time: 0.09s
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.07s
Memory: 68MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 70MB (+2MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.51s
Memory: 166MB (+96MB)
Solving...
Solving Time: 0.05s
Memory: 167MB (+1MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 167MB (+0MB)
Answer: 2
occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("walk","driver3","s2","p1-2")),1) occurs(action(("board-truck","driver2","truck1","s2")),1) occurs(action(("walk","driver1","s9","p7-9")),1) occurs(action(("walk","driver3","p1-2","s1")),2) occurs(action(("drive-truck","truck1","s2","s0","driver2")),2) occurs(action(("walk","driver1","p7-9","s7")),2) occurs(action(("board-truck","driver3","truck2","s1")),3) occurs(action(("drive-truck","truck1","s0","s8","driver2")),3) occurs(action(("walk","driver1","s7","p3-7")),3) occurs(action(("drive-truck","truck1","s8","s6","driver2")),4) occurs(action(("drive-truck","truck2","s1","s3","driver3")),4) occurs(action(("walk","driver1","p3-7","s3")),4) occurs(action(("unload-truck","package5","truck2","s3")),5) occurs(action(("load-truck","package4","truck2","s3")),5) occurs(action(("drive-truck","truck2","s3","s9","driver3")),5) occurs(action(("walk","driver1","s3","p8-3")),5) occurs(action(("load-truck","package3","truck2","s9")),6) occurs(action(("drive-truck","truck2","s9","s4","driver3")),6) occurs(action(("walk","driver1","p8-3","s8")),6) occurs(action(("unload-truck","package3","truck2","s4")),7) occurs(action(("unload-truck","package4","truck2","s4")),7) occurs(action(("load-truck","package6","truck2","s4")),7) occurs(action(("drive-truck","truck2","s4","s5","driver3")),7) occurs(action(("board-truck","driver1","truck3","s8")),7) occurs(action(("unload-truck","package6","truck2","s5")),8) occurs(action(("load-truck","package1","truck2","s5")),8) occurs(action(("load-truck","package2","truck2","s5")),8) occurs(action(("drive-truck","truck2","s5","s0","driver3")),8) occurs(action(("drive-truck","truck3","s8","s1","driver1")),8) occurs(action(("disembark-truck","driver2","truck1","s6")),8) occurs(action(("unload-truck","package1","truck2","s0")),9) occurs(action(("unload-truck","package2","truck2","s0")),9) occurs(action(("drive-truck","truck3","s1","s3","driver1")),9) occurs(action(("drive-truck","truck2","s0","s1","driver3")),9) occurs(action(("disembark-truck","driver3","truck2","s1")),10) occurs(action(("board-truck","driver2","truck1","s6")),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 1.828s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 1.816s
Choices : 763 (Domain: 700)
Conflicts : 120 (Analyzed: 120)
Restarts : 1 (Average: 120.00 Last: 20)
Model-Level : 127.0
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 120 (Deleted: 0)
Binary : 11 (Ratio: 9.17%)
Ternary : 1 (Ratio: 0.83%)
Conflict : 120 (Average Length: 152.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 120 (Average: 4.07 Max: 54 Sum: 488)
Executed : 120 (Average: 4.07 Max: 54 Sum: 488 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 785374
Atoms : 775650
Bodies : 19599 (Original: 19598)
Equivalences : 34908 (Atom=Atom: 9092 Body=Body: 6207 Other: 19609)
Tight : No (SCCs: 339 Non-Hcfs: 0 Nodes: 17027 Gammas: 0)
Variables : 20878 (Eliminated: 0 Frozen: 11937)
Constraints : 41983 (Binary: 94.1% Ternary: 3.7% Other: 2.2%)
Memory Peak : 169MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2