tplp-planning-benchmark/gc-ta5-tt1/ipc-2002_driverlog-strips-automatic_13.out

210 lines
8.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-13.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-13.pddl
Parsing...
Parsing: [0.030s CPU, 0.032s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
Preparing model... [0.030s CPU, 0.026s wall-clock]
Generated 35 rules.
Computing model... [0.210s CPU, 0.210s wall-clock]
1675 relevant atoms
1119 auxiliary atoms
2794 final queue length
3819 total queue pushes
Completing instantiation... [0.220s CPU, 0.225s wall-clock]
Instantiating: [0.480s CPU, 0.493s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.019s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.023s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.060s CPU, 0.062s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.002s 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.240s CPU, 0.243s wall-clock]
72 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.130s CPU, 0.131s wall-clock]
Reordering and filtering variables...
13 of 14 variables necessary.
3 of 14 mutex groups necessary.
1076 of 1148 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.033s wall-clock]
Translator variables: 13
Translator derived variables: 0
Translator facts: 197
Translator goal facts: 8
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 1076
Translator axioms: 0
Translator task size: 4547
Translator peak memory: 39628 KB
Writing output... [0.090s CPU, 0.100s wall-clock]
Done! [1.110s CPU, 1.111s wall-clock]
planner.py version 0.0.1
Time: 0.18s
Memory: 60MB
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: 60MB (+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.05s
Memory: 60MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 62MB (+2MB)
UNSAT
Iteration Time: 0.08s
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.06s
Memory: 66MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 69MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 75MB (+6MB)
Solving...
Solving Time: 0.18s
Memory: 75MB (+0MB)
UNSAT
Iteration Time: 0.44s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.06s
Memory: 75MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 1.85s
Memory: 79MB (+4MB)
UNKNOWN
Iteration Time: 1.94s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.06s
Memory: 84MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 2.37s
Memory: 96MB (+12MB)
UNKNOWN
Iteration Time: 2.47s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.06s
Memory: 101MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 1.68s
Memory: 105MB (+4MB)
UNKNOWN
Iteration Time: 1.79s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.08s
Memory: 106MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.40s
Memory: 107MB (+1MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 107MB (+0MB)
Answer: 2
occurs(action(("load-truck","package6","truck3","s2")),1) occurs(action(("walk","driver1","s0","p0-2")),2) occurs(action(("walk","driver1","p0-2","s2")),3) occurs(action(("board-truck","driver1","truck3","s2")),4) occurs(action(("drive-truck","truck3","s2","s5","driver1")),5) occurs(action(("unload-truck","package6","truck3","s5")),6) occurs(action(("board-truck","driver2","truck2","s9")),7) occurs(action(("drive-truck","truck2","s9","s8","driver2")),8) occurs(action(("drive-truck","truck3","s5","s10","driver1")),9) occurs(action(("drive-truck","truck3","s10","s6","driver1")),10) occurs(action(("load-truck","package4","truck3","s6")),11) occurs(action(("drive-truck","truck3","s6","s10","driver1")),12) occurs(action(("drive-truck","truck3","s10","s0","driver1")),13) occurs(action(("unload-truck","package4","truck3","s0")),14) occurs(action(("drive-truck","truck3","s0","s10","driver1")),15) occurs(action(("drive-truck","truck3","s10","s6","driver1")),16) occurs(action(("load-truck","package2","truck3","s6")),17) occurs(action(("drive-truck","truck3","s6","s10","driver1")),18) occurs(action(("drive-truck","truck3","s10","s0","driver1")),19) occurs(action(("unload-truck","package2","truck3","s0")),20) occurs(action(("drive-truck","truck3","s0","s4","driver1")),21) occurs(action(("load-truck","package1","truck3","s4")),22) occurs(action(("drive-truck","truck3","s4","s5","driver1")),23) occurs(action(("unload-truck","package1","truck3","s5")),24) occurs(action(("load-truck","package3","truck3","s5")),25) occurs(action(("drive-truck","truck3","s5","s4","driver1")),26) occurs(action(("unload-truck","package3","truck3","s4")),27) occurs(action(("disembark-truck","driver1","truck3","s4")),28) occurs(action(("walk","driver1","s4","p11-4")),29) occurs(action(("walk","driver1","p11-4","s11")),30)
SATISFIABLE
Models : 1+
Calls : 8
Time : 7.280s (Solving: 6.46s 1st Model: 0.40s Unsat: 0.18s)
CPU Time : 7.272s
Choices : 240568 (Domain: 240567)
Conflicts : 29867 (Analyzed: 29865)
Restarts : 342 (Average: 87.32 Last: 105)
Model-Level : 501.0
Problems : 8 (Average Length: 16.38 Splits: 0)
Lemmas : 29865 (Deleted: 22808)
Binary : 446 (Ratio: 1.49%)
Ternary : 115 (Ratio: 0.39%)
Conflict : 29865 (Average Length: 529.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 29865 (Average: 5.70 Max: 718 Sum: 170228)
Executed : 29801 (Average: 5.68 Max: 718 Sum: 169755 Ratio: 99.72%)
Bounded : 64 (Average: 7.39 Max: 27 Sum: 473 Ratio: 0.28%)
Rules : 15081
Atoms : 15071
Bodies : 21 (Original: 20)
Count : 10
Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20)
Tight : Yes
Variables : 43138 (Eliminated: 0 Frozen: 33285)
Constraints : 181313 (Binary: 94.0% Ternary: 3.6% Other: 2.4%)
Memory Peak : 111MB
Max. Length : 30 steps
Sol. Length : 30 steps
Models : 2