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

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

Browse Source
This commit is contained in:
Potassco Bot
2017-12-04 20:42:52 +01:00
parent d742051200
commit 47b5569d11
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_7.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-7.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: 7
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_7.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': 7}
# 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-7.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-7.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 42.61 MEM 33472 MAXMEM 531400 STALE 1 MAXMEM_RSS 471416
<time name="ALL">42500</time>

177
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_7.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-7.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-7.pddl
Parsing...
Parsing: [1.780s CPU, 1.782s wall-clock]
Normalizing task... [0.040s CPU, 0.042s wall-clock]
Instantiating...
Generating Datalog program... [0.410s CPU, 0.408s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [3.580s CPU, 3.577s wall-clock]
Generated 23 rules.
Computing model... [7.820s CPU, 7.820s wall-clock]
42642 relevant atoms
77428 auxiliary atoms
120070 final queue length
137204 total queue pushes
Completing instantiation... [4.330s CPU, 4.331s wall-clock]
Instantiating: [16.290s CPU, 16.286s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.100s CPU, 0.094s wall-clock]
Checking invariant weight... [0.110s CPU, 0.108s wall-clock]
Instantiating groups... [0.090s CPU, 0.093s 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.010s CPU, 0.005s wall-clock]
Computing fact groups: [0.340s CPU, 0.335s 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.010s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.120s CPU, 0.124s wall-clock]
Translating task: [2.430s CPU, 2.434s 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.380s CPU, 1.378s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
0 of 14 mutex groups necessary.
8914 of 8914 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.360s CPU, 0.358s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 420
Translator goal facts: 12
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 8914
Translator axioms: 0
Translator task size: 44728
Translator peak memory: 96900 KB
Writing output... [0.810s CPU, 0.885s wall-clock]
Done! [23.550s CPU, 23.623s wall-clock]
planner.py version 0.0.1
Time: 1.98s
Memory: 181MB
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: 182MB (+1MB)
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: 182MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.59s
Memory: 182MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 189MB (+7MB)
UNSAT
Iteration Time: 1.03s
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: 196.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.69s
Memory: 202MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 224MB (+22MB)
UNSAT
Iteration Time: 1.17s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 259.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.63s
Memory: 237MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 8.77s
Memory: 311MB (+74MB)
UNSAT
Iteration Time: 9.76s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 398.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.81s
Memory: 368MB (+57MB)
Unblocking actions...
Solving...
Solving Time: 0.25s
Memory: 398MB (+30MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.53s
Memory: 398MB (+0MB)
Answer: 1
occurs(action(("drive","t0","l4","l2","level246","level7","level253")),1) occurs(action(("load","p10","t0","l4")),1) occurs(action(("drive","t0","l2","l8","level230","level16","level246")),2) occurs(action(("load","p0","t0","l8")),3) occurs(action(("load","p1","t0","l8")),3) occurs(action(("drive","t0","l8","l2","level214","level16","level230")),3) occurs(action(("unload","p1","t0","l2")),4) occurs(action(("drive","t0","l2","l9","level196","level18","level214")),4) occurs(action(("drive","t0","l9","l1","level188","level8","level196")),5) occurs(action(("load","p11","t0","l9")),5) occurs(action(("load","p5","t0","l9")),5) occurs(action(("unload","p0","t0","l1")),6) occurs(action(("load","p2","t0","l1")),6) occurs(action(("load","p6","t0","l1")),6) occurs(action(("drive","t0","l1","l9","level180","level8","level188")),6) occurs(action(("unload","p2","t0","l9")),7) occurs(action(("unload","p6","t0","l9")),7) occurs(action(("drive","t0","l9","l2","level162","level18","level180")),7) occurs(action(("drive","t0","l2","l7","level152","level10","level162")),8) occurs(action(("drive","t0","l7","l5","level141","level11","level152")),9) occurs(action(("load","p9","t0","l7")),9) occurs(action(("unload","p10","t0","l5")),10) occurs(action(("load","p3","t0","l5")),10) occurs(action(("drive","t0","l5","l7","level130","level11","level141")),10) occurs(action(("drive","t0","l7","l2","level120","level10","level130")),11) occurs(action(("drive","t0","l2","l11","level115","level5","level120")),12) occurs(action(("drive","t0","l11","l2","level110","level5","level115")),13) occurs(action(("load","p4","t0","l11")),13) occurs(action(("load","p7","t0","l11")),13) occurs(action(("load","p8","t0","l11")),13) occurs(action(("drive","t0","l2","l4","level103","level7","level110")),14) occurs(action(("unload","p3","t0","l4")),15) occurs(action(("unload","p4","t0","l4")),15) occurs(action(("drive","t0","l4","l2","level96","level7","level103")),15) occurs(action(("drive","t0","l2","l9","level78","level18","level96")),16) occurs(action(("unload","p7","t0","l9")),17) occurs(action(("unload","p8","t0","l9")),17) occurs(action(("drive","t0","l9","l6","level65","level13","level78")),17) occurs(action(("unload","p11","t0","l6")),18) occurs(action(("drive","t0","l6","l3","level46","level19","level65")),18) occurs(action(("unload","p5","t0","l3")),19) occurs(action(("unload","p9","t0","l3")),19) occurs(action(("drive","t0","l3","l0","level44","level2","level46")),20)
SATISFIABLE
Models : 1+
Calls : 5
Time : 15.514s (Solving: 8.99s 1st Model: 0.19s Unsat: 8.79s)
CPU Time : 15.384s
Choices : 11200 (Domain: 11199)
Conflicts : 6354 (Analyzed: 6351)
Restarts : 70 (Average: 90.73 Last: 74)
Model-Level : 243.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 6351 (Deleted: 2562)
Binary : 70 (Ratio: 1.10%)
Ternary : 23 (Ratio: 0.36%)
Conflict : 6351 (Average Length: 5323.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 6351 (Average: 1.47 Max: 83 Sum: 9344)
Executed : 6328 (Average: 1.43 Max: 83 Sum: 9096 Ratio: 97.35%)
Bounded : 23 (Average: 10.78 Max: 17 Sum: 248 Ratio: 2.65%)
Rules : 143522
Atoms : 143522
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 177326 (Eliminated: 0 Frozen: 7845)
Constraints : 960495 (Binary: 98.9% Ternary: 0.6% Other: 0.5%)
Memory Peak : 481MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 1