tplp-planning-benchmark/gc-ta1-tt1/ipc-2006_trucks-propositional-strips_9.out

226 lines
9.1 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-9.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-9.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-2006/domains/trucks-propositional-strips/domains/domain-9.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-9.pddl
Parsing...
Parsing: [2.600s CPU, 2.602s wall-clock]
Normalizing task... [0.470s CPU, 0.479s wall-clock]
Instantiating...
Generating Datalog program... [0.310s CPU, 0.311s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.870s CPU, 0.869s wall-clock]
Preparing model... [0.660s CPU, 0.655s wall-clock]
Generated 8401 rules.
Computing model... [0.280s CPU, 0.282s wall-clock]
3326 relevant atoms
0 auxiliary atoms
3326 final queue length
8415 total queue pushes
Completing instantiation... [0.560s CPU, 0.566s wall-clock]
Instantiating: [2.730s CPU, 2.723s wall-clock]
Computing fact groups...
Finding invariants...
492 initial candidates
Finding invariants: [54.440s CPU, 54.414s wall-clock]
Checking invariant weight... [0.080s CPU, 0.079s wall-clock]
Instantiating groups... [0.020s CPU, 0.027s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.009s wall-clock]
Choosing groups...
408 uncovered facts
Choosing groups: [0.060s CPU, 0.062s wall-clock]
Building translation key... [0.010s CPU, 0.014s wall-clock]
Computing fact groups: [54.740s CPU, 54.719s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.030s CPU, 0.028s wall-clock]
Building mutex information...
Building mutex information: [0.060s CPU, 0.054s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.036s wall-clock]
Translating task: [1.920s CPU, 1.922s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
5 propositions removed
Detecting unreachable propositions: [0.600s CPU, 0.597s wall-clock]
Reordering and filtering variables...
20 of 421 variables necessary.
424 of 440 mutex groups necessary.
2832 of 2832 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.160s CPU, 0.164s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 106
Translator goal facts: 8
Translator mutex groups: 424
Translator total mutex groups size: 2983
Translator operators: 2832
Translator axioms: 0
Translator task size: 15121
Translator peak memory: 88036 KB
Writing output... [0.280s CPU, 0.303s wall-clock]
Done! [63.620s CPU, 63.628s wall-clock]
planner.py version 0.0.1
Time: 0.33s
Memory: 64MB
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: 65MB (+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: 65MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.06s
Memory: 66MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 66MB (+0MB)
UNSAT
Iteration Time: 0.07s
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: 67.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.06s
Memory: 69MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.67s
Memory: 71MB (+2MB)
UNKNOWN
Iteration Time: 0.74s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 76.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.06s
Memory: 75MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.97s
Memory: 77MB (+2MB)
UNKNOWN
Iteration Time: 1.04s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 83.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.06s
Memory: 81MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 1.28s
Memory: 89MB (+8MB)
UNKNOWN
Iteration Time: 1.37s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 101.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.07s
Memory: 91MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 1.51s
Memory: 97MB (+6MB)
UNKNOWN
Iteration Time: 1.60s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 109.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.06s
Memory: 98MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 1.33s
Memory: 103MB (+5MB)
UNKNOWN
Iteration Time: 1.41s
Iteration 8
Queue: [(2,10,1,True), (3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 1.13s
Memory: 103MB (+0MB)
UNKNOWN
Iteration Time: 1.13s
Iteration 9
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 103MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.22s
Memory: 103MB (+0MB)
Answer: 1
occurs(action("drive_truck1_l3_l2_t0_t1"),1) occurs(action("load_package2_truck1_a1_l3"),1) occurs(action("load_package3_truck1_a2_l3"),1) occurs(action("load_package4_truck1_a3_l3"),1) occurs(action("unload_package2_truck1_a1_l2"),2) occurs(action("deliver_package2_l2_t1_t4"),3) occurs(action("unload_package3_truck1_a2_l2"),3) occurs(action("drive_truck1_l2_l1_t1_t2"),3) occurs(action("deliver_package3_l2_t2_t4"),4) occurs(action("unload_package4_truck1_a3_l1"),4) occurs(action("drive_truck1_l1_l3_t2_t3"),4) occurs(action("deliver_package4_l1_t3_t8"),5) occurs(action("drive_truck1_l3_l2_t3_t4"),5) occurs(action("load_package1_truck1_a2_l3"),5) occurs(action("load_package6_truck1_a3_l3"),5) occurs(action("unload_package1_truck1_a2_l2"),6) occurs(action("deliver_package1_l2_t4_t4"),7) occurs(action("drive_truck1_l2_l1_t4_t5"),7) occurs(action("unload_package6_truck1_a3_l1"),8) occurs(action("drive_truck1_l1_l2_t5_t6"),8) occurs(action("load_package8_truck1_a2_l1"),8) occurs(action("deliver_package6_l1_t6_t8"),9) occurs(action("unload_package8_truck1_a2_l2"),9) occurs(action("drive_truck1_l2_l1_t6_t7"),9) occurs(action("deliver_package8_l2_t7_t12"),10) occurs(action("drive_truck1_l1_l3_t7_t8"),10) occurs(action("load_package7_truck1_a2_l1"),10) occurs(action("unload_package7_truck1_a2_l3"),11) occurs(action("deliver_package7_l3_t8_t12"),12) occurs(action("drive_truck1_l3_l1_t8_t9"),12) occurs(action("load_package5_truck1_a3_l3"),12) occurs(action("drive_truck1_l1_l4_t9_t10"),13) occurs(action("unload_package5_truck1_a3_l1"),13) occurs(action("deliver_package5_l1_t10_t11"),14) occurs(action("drive_truck1_l4_l2_t10_t11"),14) occurs(action("drive_truck1_l2_l4_t11_t12"),15)
SATISFIABLE
Models : 1+
Calls : 9
Time : 7.761s (Solving: 6.91s 1st Model: 0.04s Unsat: 0.00s)
CPU Time : 7.756s
Choices : 122833 (Domain: 122831)
Conflicts : 49688 (Analyzed: 49687)
Restarts : 605 (Average: 82.13 Last: 119)
Model-Level : 285.0
Problems : 9 (Average Length: 20.33 Splits: 0)
Lemmas : 49687 (Deleted: 44843)
Binary : 151 (Ratio: 0.30%)
Ternary : 47 (Ratio: 0.09%)
Conflict : 49687 (Average Length: 454.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 49687 (Average: 1.40 Max: 100 Sum: 69687)
Executed : 49685 (Average: 1.40 Max: 100 Sum: 69669 Ratio: 99.97%)
Bounded : 2 (Average: 9.00 Max: 17 Sum: 18 Ratio: 0.03%)
Rules : 42223
Atoms : 42223
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 19722 (Eliminated: 0 Frozen: 2424)
Constraints : 111552 (Binary: 94.5% Ternary: 2.3% Other: 3.2%)
Memory Peak : 103MB
Max. Length : 30 steps
Sol. Length : 15 steps
Models : 1