Add benchmark result [gc-ta1-tt0 | ipc-2002 | driverlog-strips-automatic | 12]
This commit is contained in:
parent
21929cf88f
commit
3290c1484c
50
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.env
Normal file
50
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.env
Normal file
@ -0,0 +1,50 @@
|
|||||||
|
command:
|
||||||
|
- timeout
|
||||||
|
- -m=8000000
|
||||||
|
- -t=900
|
||||||
|
- python3
|
||||||
|
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
|
||||||
|
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.pddl
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -B 0.9
|
||||||
|
- --parallel=0
|
||||||
|
- --shallow
|
||||||
|
- --use-heuristic
|
||||||
|
- --test-until-not-sat
|
||||||
|
- --test=0
|
||||||
|
- --test-add=1
|
||||||
|
- --test-times=0
|
||||||
|
configuration:
|
||||||
|
id: gc-ta1-tt0
|
||||||
|
instanceSets:
|
||||||
|
- lpnmr-first-plan-not-serializable
|
||||||
|
options:
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -B 0.9
|
||||||
|
- --parallel=0
|
||||||
|
- --shallow
|
||||||
|
- --use-heuristic
|
||||||
|
- --test-until-not-sat
|
||||||
|
- --test=0
|
||||||
|
- --test-add=1
|
||||||
|
- --test-times=0
|
||||||
|
exitCode: 0
|
||||||
|
instance:
|
||||||
|
domain: driverlog-strips-automatic
|
||||||
|
instance: 12
|
||||||
|
ipc: ipc-2002
|
||||||
|
versions:
|
||||||
|
clingo: 5.2.2
|
||||||
|
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||||
|
planner: 61750c0521c6104870e5b881c8b0c237e2af4a96 (2017-11-27 07:44:27 +0100)
|
||||||
|
plasp: 3.1.1
|
||||||
|
python: 3.6.3
|
||||||
|
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
|
18
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.err
Normal file
18
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# configuration: {'id': 'gc-ta1-tt0', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=0'], 'instanceSets': ['lpnmr-first-plan-not-serializable']}
|
||||||
|
# instance: {'ipc': 'ipc-2002', 'domain': 'driverlog-strips-automatic', 'instance': 12}
|
||||||
|
# command: ['timeout', '-m=8000000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=0']
|
||||||
|
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
# exit code: 0
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:13:4-34: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(actionCosts))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:14:4-33: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(axiomRules))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:15:4-41: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(conditionalEffects))
|
||||||
|
|
||||||
|
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.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 -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_1.lp --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
|
||||||
|
FINISHED CPU 7.37 MEM 33472 MAXMEM 131856 STALE 0 MAXMEM_RSS 75892
|
||||||
|
<time name="ALL">7310</time>
|
||||||
|
|
239
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.out
Normal file
239
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.out
Normal file
@ -0,0 +1,239 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.030s CPU, 0.030s wall-clock]
|
||||||
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
|
||||||
|
Preparing model... [0.020s CPU, 0.024s wall-clock]
|
||||||
|
Generated 35 rules.
|
||||||
|
Computing model... [0.180s CPU, 0.180s wall-clock]
|
||||||
|
1376 relevant atoms
|
||||||
|
903 auxiliary atoms
|
||||||
|
2279 final queue length
|
||||||
|
3128 total queue pushes
|
||||||
|
Completing instantiation... [0.190s CPU, 0.187s wall-clock]
|
||||||
|
Instantiating: [0.420s CPU, 0.424s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
11 initial candidates
|
||||||
|
Finding invariants: [0.020s CPU, 0.020s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Instantiating groups... [0.020s CPU, 0.018s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
3 uncovered facts
|
||||||
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Computing fact groups: [0.050s CPU, 0.053s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.010s CPU, 0.011s wall-clock]
|
||||||
|
Translating task: [0.200s CPU, 0.201s wall-clock]
|
||||||
|
60 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
11 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.100s CPU, 0.109s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
14 of 14 variables necessary.
|
||||||
|
3 of 14 mutex groups necessary.
|
||||||
|
948 of 948 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.030s CPU, 0.028s wall-clock]
|
||||||
|
Translator variables: 14
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 176
|
||||||
|
Translator goal facts: 10
|
||||||
|
Translator mutex groups: 3
|
||||||
|
Translator total mutex groups size: 9
|
||||||
|
Translator operators: 948
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 4037
|
||||||
|
Translator peak memory: 39116 KB
|
||||||
|
Writing output... [0.080s CPU, 0.089s wall-clock]
|
||||||
|
Done! [0.930s CPU, 0.948s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.18s
|
||||||
|
Memory: 59MB
|
||||||
|
|
||||||
|
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: 59MB (+0MB)
|
||||||
|
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
|
||||||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||||
|
Grounding Time: 0.04s
|
||||||
|
Memory: 59MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 60MB (+1MB)
|
||||||
|
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
|
||||||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||||
|
Grounding Time: 0.05s
|
||||||
|
Memory: 63MB (+3MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.02s
|
||||||
|
Memory: 64MB (+1MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.13s
|
||||||
|
Memory: 71MB (+7MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.10s
|
||||||
|
Memory: 70MB (+-1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.32s
|
||||||
|
|
||||||
|
Iteration 4
|
||||||
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 10
|
||||||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||||
|
Grounding Time: 0.06s
|
||||||
|
Memory: 69MB (+-1MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.03s
|
||||||
|
Memory: 73MB (+4MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.13s
|
||||||
|
Memory: 79MB (+6MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.10s
|
||||||
|
Memory: 77MB (+-2MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.13s
|
||||||
|
Memory: 80MB (+3MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.09s
|
||||||
|
Memory: 80MB (+0MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.13s
|
||||||
|
Memory: 81MB (+1MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.29s
|
||||||
|
Memory: 81MB (+0MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.13s
|
||||||
|
Memory: 84MB (+3MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 2.17s
|
||||||
|
Memory: 84MB (+0MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 3.31s
|
||||||
|
|
||||||
|
Iteration 5
|
||||||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 15
|
||||||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||||
|
Grounding Time: 0.05s
|
||||||
|
Memory: 84MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.11s
|
||||||
|
Memory: 87MB (+3MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.14s
|
||||||
|
Memory: 89MB (+2MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.03s
|
||||||
|
Memory: 89MB (+0MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.13s
|
||||||
|
Memory: 89MB (+0MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.13s
|
||||||
|
Memory: 89MB (+0MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.13s
|
||||||
|
Memory: 90MB (+1MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.08s
|
||||||
|
Memory: 90MB (+0MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE
|
||||||
|
Testing Time: 0.12s
|
||||||
|
Memory: 91MB (+1MB)
|
||||||
|
Answer: 9
|
||||||
|
occurs(action(("load-truck","package4","truck1","s7")),1) occurs(action(("walk","driver2","s3","p3-9")),1) occurs(action(("walk","driver1","s1","p1-7")),1) occurs(action(("walk","driver2","p3-9","s9")),2) occurs(action(("walk","driver1","p1-7","s7")),2) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver1","s7","p2-7")),3) occurs(action(("drive-truck","truck2","s9","s8","driver2")),4) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("drive-truck","truck2","s8","s5","driver2")),5) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("drive-truck","truck3","s2","s4","driver1")),6) occurs(action(("disembark-truck","driver2","truck2","s5")),6) occurs(action(("load-truck","package2","truck3","s4")),7) occurs(action(("load-truck","package5","truck3","s4")),7) occurs(action(("walk","driver2","s5","p6-5")),7) occurs(action(("drive-truck","truck3","s4","s7","driver1")),8) occurs(action(("walk","driver2","p6-5","s6")),8) occurs(action(("unload-truck","package2","truck3","s7")),9) occurs(action(("walk","driver2","s6","p7-6")),9) occurs(action(("drive-truck","truck3","s7","s0","driver1")),10) occurs(action(("load-truck","package2","truck1","s7")),10) occurs(action(("walk","driver2","p7-6","s7")),10) occurs(action(("unload-truck","package5","truck3","s0")),11) occurs(action(("board-truck","driver2","truck1","s7")),11) occurs(action(("disembark-truck","driver1","truck3","s0")),11) occurs(action(("drive-truck","truck1","s7","s9","driver2")),12) occurs(action(("walk","driver1","s0","p6-0")),12) occurs(action(("drive-truck","truck1","s9","s3","driver2")),13) occurs(action(("walk","driver1","p6-0","s6")),13) occurs(action(("load-truck","package1","truck1","s3")),14) occurs(action(("walk","driver1","s6","p6-5")),14) occurs(action(("drive-truck","truck1","s3","s1","driver2")),15) occurs(action(("walk","driver1","p6-5","s5")),15) occurs(action(("unload-truck","package4","truck1","s1")),16) occurs(action(("load-truck","package6","truck1","s1")),16) occurs(action(("walk","driver1","s5","p5-3")),16) occurs(action(("drive-truck","truck1","s1","s2","driver2")),17) occurs(action(("walk","driver1","p5-3","s3")),17) occurs(action(("unload-truck","package1","truck1","s2")),18) occurs(action(("unload-truck","package2","truck1","s2")),18) occurs(action(("unload-truck","package6","truck1","s2")),18) occurs(action(("walk","driver1","s3","p3-4")),18) occurs(action(("walk","driver1","p3-4","s4")),19) occurs(action(("drive-truck","truck1","s2","s9","driver2")),19) occurs(action(("disembark-truck","driver2","truck1","s9")),20)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 13
|
||||||
|
Time : 3.769s (Solving: 3.10s 1st Model: 0.83s Unsat: 0.09s)
|
||||||
|
CPU Time : 3.760s
|
||||||
|
|
||||||
|
Choices : 52253 (Domain: 52248)
|
||||||
|
Conflicts : 14418 (Analyzed: 14417)
|
||||||
|
Restarts : 157 (Average: 91.83 Last: 81)
|
||||||
|
Model-Level : 231.7
|
||||||
|
Problems : 13 (Average Length: 15.85 Splits: 0)
|
||||||
|
Lemmas : 14417 (Deleted: 10009)
|
||||||
|
Binary : 67 (Ratio: 0.46%)
|
||||||
|
Ternary : 32 (Ratio: 0.22%)
|
||||||
|
Conflict : 14417 (Average Length: 385.4 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 14417 (Average: 2.91 Max: 207 Sum: 41941)
|
||||||
|
Executed : 14364 (Average: 2.86 Max: 207 Sum: 41231 Ratio: 98.31%)
|
||||||
|
Bounded : 53 (Average: 13.40 Max: 22 Sum: 710 Ratio: 1.69%)
|
||||||
|
|
||||||
|
Rules : 38216 (Original: 38195)
|
||||||
|
Atoms : 14781
|
||||||
|
Bodies : 23142 (Original: 23120)
|
||||||
|
Count : 191 (Original: 194)
|
||||||
|
Equivalences : 12987 (Atom=Atom: 134 Body=Body: 0 Other: 12853)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 23839 (Eliminated: 0 Frozen: 16573)
|
||||||
|
Constraints : 121213 (Binary: 95.0% Ternary: 2.6% Other: 2.3%)
|
||||||
|
|
||||||
|
Memory Peak : 93MB
|
||||||
|
Max. Length : 20 steps
|
||||||
|
Sol. Length : 20 steps
|
||||||
|
Models : 9
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user