tplp-planning-benchmark/gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_20.out

178 lines
8.9 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-20.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-2011/domains/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-20.pddl
Parsing...
Parsing: [0.860s CPU, 0.867s wall-clock]
Normalizing task... [0.020s CPU, 0.019s wall-clock]
Instantiating...
Generating Datalog program... [0.240s CPU, 0.242s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
Preparing model... [1.620s CPU, 1.630s wall-clock]
Generated 23 rules.
Computing model... [4.490s CPU, 4.499s wall-clock]
24812 relevant atoms
42782 auxiliary atoms
67594 final queue length
82160 total queue pushes
Completing instantiation... [3.240s CPU, 3.237s wall-clock]
Instantiating: [9.690s CPU, 9.697s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.080s CPU, 0.078s wall-clock]
Checking invariant weight... [0.050s CPU, 0.054s wall-clock]
Instantiating groups... [0.090s CPU, 0.085s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.009s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.250s CPU, 0.256s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.100s CPU, 0.106s wall-clock]
Translating task: [2.060s CPU, 2.065s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
17 propositions removed
Detecting unreachable propositions: [1.170s CPU, 1.171s wall-clock]
Reordering and filtering variables...
17 of 17 variables necessary.
0 of 17 mutex groups necessary.
7716 of 7716 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.310s CPU, 0.305s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 433
Translator goal facts: 15
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 7716
Translator axioms: 0
Translator task size: 38595
Translator peak memory: 72860 KB
Writing output... [0.710s CPU, 0.765s wall-clock]
Done! [15.190s CPU, 15.256s wall-clock]
planner.py version 0.0.1
Time: 1.73s
Memory: 163MB
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.01s
Memory: 163MB (+0MB)
UNSAT
Iteration Time: 0.01s
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: 163MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.53s
Memory: 163MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 165MB (+2MB)
UNSAT
Iteration Time: 0.89s
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: 167.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.59s
Memory: 178MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 199MB (+21MB)
UNSAT
Iteration Time: 0.95s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 233.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.54s
Memory: 207MB (+8MB)
Unblocking actions...
Solving...
Solving Time: 4.86s
Memory: 251MB (+44MB)
UNSAT
Iteration Time: 5.70s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 303.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.57s
Memory: 292MB (+41MB)
Unblocking actions...
Solving...
Solving Time: 1.48s
Memory: 323MB (+31MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.48s
Memory: 323MB (+0MB)
Answer: 1
occurs(action(("drive","t0","l3","l5","level175","level2","level177")),1) occurs(action(("load","p6","t0","l3")),1) occurs(action(("drive","t0","l5","l8","level168","level7","level175")),2) occurs(action(("load","p7","t0","l5")),2) occurs(action(("load","p9","t0","l8")),3) occurs(action(("drive","t0","l8","l11","level163","level5","level168")),3) occurs(action(("load","p10","t0","l11")),4) occurs(action(("drive","t0","l11","l12","level156","level7","level163")),4) occurs(action(("drive","t0","l12","l14","level141","level15","level156")),5) occurs(action(("load","p12","t0","l14")),6) occurs(action(("load","p13","t0","l14")),6) occurs(action(("load","p2","t0","l14")),6) occurs(action(("load","p4","t0","l14")),6) occurs(action(("load","p5","t0","l14")),6) occurs(action(("drive","t0","l14","l10","level131","level10","level141")),6) occurs(action(("unload","p7","t0","l10")),7) occurs(action(("unload","p9","t0","l10")),7) occurs(action(("drive","t0","l10","l14","level121","level10","level131")),7) occurs(action(("drive","t0","l14","l0","level101","level20","level121")),8) occurs(action(("unload","p5","t0","l0")),9) occurs(action(("drive","t0","l0","l5","level100","level1","level101")),9) occurs(action(("drive","t0","l5","l9","level97","level3","level100")),10) occurs(action(("load","p8","t0","l9")),11) occurs(action(("drive","t0","l9","l6","level79","level18","level97")),11) occurs(action(("unload","p10","t0","l6")),12) occurs(action(("unload","p8","t0","l6")),12) occurs(action(("load","p0","t0","l6")),12) occurs(action(("load","p3","t0","l6")),12) occurs(action(("drive","t0","l6","l1","level59","level20","level79")),12) occurs(action(("load","p1","t0","l1")),13) occurs(action(("load","p11","t0","l1")),13) occurs(action(("load","p14","t0","l1")),13) occurs(action(("drive","t0","l1","l13","level47","level12","level59")),13) occurs(action(("unload","p12","t0","l13")),14) occurs(action(("unload","p2","t0","l13")),14) occurs(action(("unload","p6","t0","l13")),14) occurs(action(("drive","t0","l13","l2","level45","level2","level47")),14) occurs(action(("unload","p3","t0","l2")),15) occurs(action(("drive","t0","l2","l5","level20","level25","level45")),15) occurs(action(("unload","p0","t0","l5")),16) occurs(action(("unload","p11","t0","l5")),16) occurs(action(("unload","p14","t0","l5")),16) occurs(action(("drive","t0","l5","l3","level18","level2","level20")),16) occurs(action(("unload","p4","t0","l3")),17) occurs(action(("drive","t0","l3","l5","level16","level2","level18")),17) occurs(action(("drive","t0","l5","l8","level9","level7","level16")),18) occurs(action(("unload","p1","t0","l8")),19) occurs(action(("unload","p13","t0","l8")),19) occurs(action(("drive","t0","l8","l11","level4","level5","level9")),19) occurs(action(("drive","t0","l11","l7","level2","level2","level4")),20)
SATISFIABLE
Models : 1+
Calls : 5
Time : 11.699s (Solving: 6.30s 1st Model: 1.43s Unsat: 4.86s)
CPU Time : 11.620s
Choices : 9481 (Domain: 9481)
Conflicts : 5009 (Analyzed: 5007)
Restarts : 55 (Average: 91.04 Last: 89)
Model-Level : 194.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 5007 (Deleted: 989)
Binary : 49 (Ratio: 0.98%)
Ternary : 24 (Ratio: 0.48%)
Conflict : 5007 (Average Length: 5304.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 5007 (Average: 1.57 Max: 67 Sum: 7860)
Executed : 4987 (Average: 1.51 Max: 67 Sum: 7568 Ratio: 96.28%)
Bounded : 20 (Average: 14.60 Max: 22 Sum: 292 Ratio: 3.72%)
Rules : 123939
Atoms : 123939
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 156740 (Eliminated: 0 Frozen: 8177)
Constraints : 927894 (Binary: 98.9% Ternary: 0.7% Other: 0.4%)
Memory Peak : 420MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 1