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

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

Browse Source
This commit is contained in:
Potassco Bot
2017-12-04 20:51:07 +01:00
parent 0417fddbe3
commit 5484332688
3 changed files with 254 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_17.env Normal file
View File

@@ -0,0 +1,53 @@
command:
- timeout
- -m=9216000
- -t=900
- python3
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
- --domain=/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-17.pddl
- --stats
- --verbose
- --print-call
- -m 8192
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
configuration:
id: gc-ta1-tt1
instanceSets:
- lpnmr-first-plan-not-serializable
- rintanen-aij-2012
options:
- --stats
- --verbose
- --print-call
- -m 8192
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
exitCode: 0
instance:
domain: no-mystery-sequential-satisficing
instance: 17
ipc: ipc-2011
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 398fcb36ad9c5a23a8c35820fb4b021802dbc349 (2017-11-30 17:03:27 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

24
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_17.err Normal file
View File

@@ -0,0 +1,24 @@
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
# instance: {'ipc': 'ipc-2011', 'domain': 'no-mystery-sequential-satisficing', 'instance': 17}
# command: ['timeout', '-m=9216000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/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-17.pddl', '--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1']
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
# exit code: 0
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:15-28: info: atom does not occur in any rule head:
mutexGroup(G)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:30-45: info: atom does not occur in any rule head:
contains(G,X,V)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:67:15-28: info: atom does not occur in any rule head:
mutexGroup(G)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:74:41-56: info: atom does not occur in any rule head:
contains(G,X,V)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:84:41-56: info: atom does not occur in any rule head:
contains(G,X,V)
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /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-17.pddl && plasp-3.1.1 translate --parsing-mode=compatibility output.sas | /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/planner.py - /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp --stats --verbose -m 8192 -B 0.9 --test-until-not-sat --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 --test=- --test=/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/test.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/block_forall_t.lp --test-once --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
FINISHED CPU 38.25 MEM 0 MAXMEM 495172 STALE 1 MAXMEM_RSS 438768
<time name="ALL">38180</time>

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

@@ -0,0 +1,177 @@
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-17.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-17.pddl
Parsing...
Parsing: [0.960s CPU, 0.958s wall-clock]
Normalizing task... [0.020s CPU, 0.021s wall-clock]
Instantiating...
Generating Datalog program... [0.260s CPU, 0.257s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [1.800s CPU, 1.795s wall-clock]
Generated 23 rules.
Computing model... [4.520s CPU, 4.525s wall-clock]
24928 relevant atoms
44040 auxiliary atoms
68968 final queue length
81274 total queue pushes
Completing instantiation... [2.690s CPU, 2.691s wall-clock]
Instantiating: [9.360s CPU, 9.356s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.070s CPU, 0.068s wall-clock]
Checking invariant weight... [0.060s CPU, 0.059s wall-clock]
Instantiating groups... [0.070s CPU, 0.071s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.230s CPU, 0.229s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.090s CPU, 0.095s wall-clock]
Translating task: [1.860s CPU, 1.856s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [1.000s CPU, 1.009s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
0 of 14 mutex groups necessary.
6466 of 6466 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.260s CPU, 0.257s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 352
Translator goal facts: 12
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 6466
Translator axioms: 0
Translator task size: 32420
Translator peak memory: 71512 KB
Writing output... [0.590s CPU, 0.640s wall-clock]
Done! [14.370s CPU, 14.416s wall-clock]
planner.py version 0.0.1
Time: 1.40s
Memory: 145MB
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: 145MB (+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: 145MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.44s
Memory: 145MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 151MB (+6MB)
UNSAT
Iteration Time: 0.73s
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: 157.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.43s
Memory: 153MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 170MB (+17MB)
UNSAT
Iteration Time: 0.72s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 189.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.51s
Memory: 187MB (+17MB)
Unblocking actions...
Solving...
Solving Time: 10.92s
Memory: 275MB (+88MB)
UNSAT
Iteration Time: 11.68s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 380.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.45s
Memory: 275MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 5.56s
Memory: 363MB (+88MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.12s
Memory: 367MB (+4MB)
Answer: 1
occurs(action(("drive","t0","l4","l2","level178","level7","level185")),1) occurs(action(("load","p10","t0","l4")),1) occurs(action(("drive","t0","l2","l7","level168","level10","level178")),2) occurs(action(("drive","t0","l7","l5","level157","level11","level168")),3) occurs(action(("load","p9","t0","l7")),3) occurs(action(("unload","p10","t0","l5")),4) occurs(action(("load","p3","t0","l5")),4) occurs(action(("drive","t0","l5","l7","level146","level11","level157")),4) occurs(action(("drive","t0","l7","l2","level136","level10","level146")),5) occurs(action(("drive","t0","l2","l4","level129","level7","level136")),6) occurs(action(("unload","p3","t0","l4")),7) occurs(action(("drive","t0","l4","l2","level122","level7","level129")),7) occurs(action(("drive","t0","l2","l11","level117","level5","level122")),8) occurs(action(("drive","t0","l11","l2","level112","level5","level117")),9) occurs(action(("load","p4","t0","l11")),9) occurs(action(("load","p7","t0","l11")),9) occurs(action(("load","p8","t0","l11")),9) occurs(action(("drive","t0","l2","l4","level105","level7","level112")),10) occurs(action(("unload","p4","t0","l4")),11) occurs(action(("drive","t0","l4","l2","level98","level7","level105")),11) occurs(action(("drive","t0","l2","l8","level82","level16","level98")),12) occurs(action(("load","p0","t0","l8")),13) occurs(action(("load","p1","t0","l8")),13) occurs(action(("drive","t0","l8","l2","level66","level16","level82")),13) occurs(action(("unload","p1","t0","l2")),14) occurs(action(("drive","t0","l2","l9","level48","level18","level66")),14) occurs(action(("unload","p7","t0","l9")),15) occurs(action(("unload","p8","t0","l9")),15) occurs(action(("drive","t0","l9","l1","level40","level8","level48")),15) occurs(action(("load","p11","t0","l9")),15) occurs(action(("load","p5","t0","l9")),15) occurs(action(("unload","p0","t0","l1")),16) occurs(action(("load","p2","t0","l1")),16) occurs(action(("load","p6","t0","l1")),16) occurs(action(("drive","t0","l1","l9","level32","level8","level40")),16) occurs(action(("unload","p2","t0","l9")),17) occurs(action(("unload","p6","t0","l9")),17) occurs(action(("drive","t0","l9","l6","level19","level13","level32")),17) occurs(action(("unload","p11","t0","l6")),18) occurs(action(("drive","t0","l6","l3","level0","level19","level19")),18) occurs(action(("unload","p5","t0","l3")),19) occurs(action(("unload","p9","t0","l3")),20)
SATISFIABLE
Models : 1+
Calls : 5
Time : 20.869s (Solving: 16.45s 1st Model: 5.52s Unsat: 10.92s)
CPU Time : 20.812s
Choices : 27272 (Domain: 27272)
Conflicts : 12851 (Analyzed: 12848)
Restarts : 134 (Average: 95.88 Last: 49)
Model-Level : 198.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 12848 (Deleted: 8586)
Binary : 74 (Ratio: 0.58%)
Ternary : 18 (Ratio: 0.14%)
Conflict : 12848 (Average Length: 6654.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 12848 (Average: 1.50 Max: 91 Sum: 19214)
Executed : 12830 (Average: 1.48 Max: 91 Sum: 19030 Ratio: 99.04%)
Bounded : 18 (Average: 10.22 Max: 17 Sum: 184 Ratio: 0.96%)
Rules : 104082
Atoms : 104082
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 131541 (Eliminated: 0 Frozen: 6634)
Constraints : 776716 (Binary: 98.8% Ternary: 0.7% Other: 0.5%)
Memory Peak : 446MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 1