patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [gc-ta1-tt1 | ipc-2011 | no-mystery-sequential-satisficing | 8]

Browse Source
This commit is contained in:
Potassco Bot
2017-12-04 20:43:34 +01:00
parent 47b5569d11
commit 6dbb917a4c
3 changed files with 240 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

163
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_8.out Normal file
View File

@@ -0,0 +1,163 @@
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-8.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-8.pddl
Parsing...
Parsing: [0.900s CPU, 0.901s 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.010s CPU, 0.016s wall-clock]
Preparing model... [1.640s CPU, 1.643s wall-clock]
Generated 23 rules.
Computing model... [4.240s CPU, 4.235s wall-clock]
23891 relevant atoms
41757 auxiliary atoms
65648 final queue length
78347 total queue pushes
Completing instantiation... [2.830s CPU, 2.830s wall-clock]
Instantiating: [9.040s CPU, 9.037s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.070s CPU, 0.071s wall-clock]
Checking invariant weight... [0.050s CPU, 0.054s wall-clock]
Instantiating groups... [0.080s CPU, 0.075s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.230s CPU, 0.232s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.100s CPU, 0.093s wall-clock]
Translating task: [1.900s CPU, 1.897s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
15 propositions removed
Detecting unreachable propositions: [1.040s CPU, 1.042s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
0 of 15 mutex groups necessary.
6698 of 6698 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.270s CPU, 0.266s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 374
Translator goal facts: 13
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 6698
Translator axioms: 0
Translator task size: 33554
Translator peak memory: 70304 KB
Writing output... [0.610s CPU, 0.671s wall-clock]
Done! [14.100s CPU, 14.158s wall-clock]
planner.py version 0.0.1
Time: 1.53s
Memory: 148MB
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: 148MB (+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: 148MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.45s
Memory: 148MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 154MB (+6MB)
UNSAT
Iteration Time: 0.76s
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: 160.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.45s
Memory: 156MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 175MB (+19MB)
UNSAT
Iteration Time: 0.77s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 196.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.52s
Memory: 190MB (+15MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 216MB (+26MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.21s
Memory: 216MB (+0MB)
Answer: 1
occurs(action(("drive","t0","l9","l5","level160","level18","level178")),1) occurs(action(("load","p1","t0","l5")),2) occurs(action(("load","p11","t0","l5")),2) occurs(action(("load","p12","t0","l5")),2) occurs(action(("load","p3","t0","l5")),2) occurs(action(("load","p6","t0","l5")),2) occurs(action(("load","p7","t0","l5")),2) occurs(action(("drive","t0","l5","l0","level156","level4","level160")),2) occurs(action(("unload","p12","t0","l0")),3) occurs(action(("unload","p3","t0","l0")),3) occurs(action(("drive","t0","l0","l7","level155","level1","level156")),3) occurs(action(("load","p9","t0","l7")),4) occurs(action(("drive","t0","l7","l8","level137","level18","level155")),4) occurs(action(("unload","p9","t0","l8")),5) occurs(action(("drive","t0","l8","l12","level130","level7","level137")),5) occurs(action(("load","p0","t0","l12")),6) occurs(action(("drive","t0","l12","l3","level124","level6","level130")),6) occurs(action(("load","p2","t0","l12")),6) occurs(action(("unload","p0","t0","l3")),7) occurs(action(("load","p10","t0","l3")),7) occurs(action(("load","p4","t0","l3")),7) occurs(action(("drive","t0","l3","l11","level104","level20","level124")),7) occurs(action(("drive","t0","l11","l1","level103","level1","level104")),8) occurs(action(("unload","p11","t0","l1")),9) occurs(action(("unload","p6","t0","l1")),9) occurs(action(("unload","p7","t0","l1")),9) occurs(action(("drive","t0","l1","l2","level93","level10","level103")),9) occurs(action(("drive","t0","l2","l4","level79","level14","level93")),10) occurs(action(("load","p8","t0","l2")),10) occurs(action(("unload","p4","t0","l4")),11) occurs(action(("load","p5","t0","l4")),11) occurs(action(("drive","t0","l4","l9","level76","level3","level79")),11) occurs(action(("unload","p1","t0","l9")),12) occurs(action(("unload","p5","t0","l9")),12) occurs(action(("drive","t0","l9","l5","level58","level18","level76")),12) occurs(action(("drive","t0","l5","l0","level54","level4","level58")),13) occurs(action(("unload","p2","t0","l0")),14) occurs(action(("unload","p8","t0","l0")),14) occurs(action(("drive","t0","l0","l7","level53","level1","level54")),14) occurs(action(("unload","p10","t0","l7")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 4.042s (Solving: 0.11s 1st Model: 0.06s Unsat: 0.04s)
CPU Time : 3.932s
Choices : 237 (Domain: 235)
Conflicts : 130 (Analyzed: 128)
Restarts : 0
Model-Level : 47.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 128 (Deleted: 0)
Binary : 6 (Ratio: 4.69%)
Ternary : 4 (Ratio: 3.12%)
Conflict : 128 (Average Length: 2595.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 128 (Average: 1.91 Max: 20 Sum: 244)
Executed : 124 (Average: 1.62 Max: 20 Sum: 207 Ratio: 84.84%)
Bounded : 4 (Average: 9.25 Max: 12 Sum: 37 Ratio: 15.16%)
Rules : 107739
Atoms : 107739
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 100102 (Eliminated: 0 Frozen: 5191)
Constraints : 547316 (Binary: 98.8% Ternary: 0.7% Other: 0.5%)
Memory Peak : 278MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1