Add benchmark result [gc-ta4-tt1 | ipc-2002 | driverlog-strips-automatic | 11]
This commit is contained in:
parent
e1438a811a
commit
fbe7dfc7e6
50
gc-ta4-tt1/ipc-2002_driverlog-strips-automatic_11.env
Normal file
50
gc-ta4-tt1/ipc-2002_driverlog-strips-automatic_11.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-11.pddl
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -B 0.9
|
||||||
|
- --parallel=0
|
||||||
|
- --shallow
|
||||||
|
- --use-heuristic
|
||||||
|
- --test-until-not-sat
|
||||||
|
- --test=0
|
||||||
|
- --test-add=4
|
||||||
|
- --test-times=1
|
||||||
|
configuration:
|
||||||
|
id: gc-ta4-tt1
|
||||||
|
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=4
|
||||||
|
- --test-times=1
|
||||||
|
exitCode: 0
|
||||||
|
instance:
|
||||||
|
domain: driverlog-strips-automatic
|
||||||
|
instance: 11
|
||||||
|
ipc: ipc-2002
|
||||||
|
versions:
|
||||||
|
clingo: 5.2.2
|
||||||
|
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||||
|
planner: 517f2c0422a36582df17ecebb08e879b170cdfe2 (2017-11-21 02:23:06 +0100)
|
||||||
|
plasp: 3.1.1
|
||||||
|
python: 3.6.3
|
||||||
|
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
|
18
gc-ta4-tt1/ipc-2002_driverlog-strips-automatic_11.err
Normal file
18
gc-ta4-tt1/ipc-2002_driverlog-strips-automatic_11.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# configuration: {'id': 'gc-ta4-tt1', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=4', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable']}
|
||||||
|
# instance: {'ipc': 'ipc-2002', 'domain': 'driverlog-strips-automatic', 'instance': 11}
|
||||||
|
# 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-11.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=4', '--test-times=1']
|
||||||
|
# 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-11.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_exists_edge_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 2.84 MEM 33476 MAXMEM 119260 STALE 1 MAXMEM_RSS 54112
|
||||||
|
<time name="ALL">2770</time>
|
||||||
|
|
157
gc-ta4-tt1/ipc-2002_driverlog-strips-automatic_11.out
Normal file
157
gc-ta4-tt1/ipc-2002_driverlog-strips-automatic_11.out
Normal file
@ -0,0 +1,157 @@
|
|||||||
|
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-11.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-11.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.030s CPU, 0.026s wall-clock]
|
||||||
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||||||
|
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
||||||
|
Generated 35 rules.
|
||||||
|
Computing model... [0.130s CPU, 0.133s wall-clock]
|
||||||
|
917 relevant atoms
|
||||||
|
608 auxiliary atoms
|
||||||
|
1525 final queue length
|
||||||
|
2071 total queue pushes
|
||||||
|
Completing instantiation... [0.120s CPU, 0.123s wall-clock]
|
||||||
|
Instantiating: [0.300s CPU, 0.308s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
11 initial candidates
|
||||||
|
Finding invariants: [0.020s CPU, 0.018s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating groups... [0.020s CPU, 0.013s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
3 uncovered facts
|
||||||
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Building translation key... [0.010s CPU, 0.002s wall-clock]
|
||||||
|
Computing fact groups: [0.050s CPU, 0.043s 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.007s wall-clock]
|
||||||
|
Translating task: [0.130s CPU, 0.131s wall-clock]
|
||||||
|
42 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
11 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.070s CPU, 0.074s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
13 of 14 variables necessary.
|
||||||
|
3 of 14 mutex groups necessary.
|
||||||
|
574 of 616 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.010s CPU, 0.018s wall-clock]
|
||||||
|
Translator variables: 13
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 119
|
||||||
|
Translator goal facts: 7
|
||||||
|
Translator mutex groups: 3
|
||||||
|
Translator total mutex groups size: 9
|
||||||
|
Translator operators: 574
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 2482
|
||||||
|
Translator peak memory: 38092 KB
|
||||||
|
Writing output... [0.050s CPU, 0.055s wall-clock]
|
||||||
|
Done! [0.660s CPU, 0.665s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.13s
|
||||||
|
Memory: 54MB
|
||||||
|
|
||||||
|
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: 55MB (+1MB)
|
||||||
|
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.03s
|
||||||
|
Memory: 55MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 56MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.04s
|
||||||
|
|
||||||
|
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.03s
|
||||||
|
Memory: 58MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 60MB (+2MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.32s
|
||||||
|
Memory: 74MB (+14MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 75MB (+1MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE?
|
||||||
|
Testing Time: 0.00s
|
||||||
|
Memory: 75MB (+0MB)
|
||||||
|
Answer: 2
|
||||||
|
occurs(action(("load-truck","package2","truck2","s2")),1) occurs(action(("load-truck","package4","truck1","s0")),1) occurs(action(("board-truck","driver2","truck1","s0")),1) occurs(action(("walk","driver1","s6","p2-6")),1) occurs(action(("drive-truck","truck1","s0","s6","driver2")),2) occurs(action(("walk","driver1","p2-6","s2")),2) occurs(action(("unload-truck","package4","truck1","s6")),3) occurs(action(("board-truck","driver1","truck2","s2")),3) occurs(action(("drive-truck","truck1","s6","s2","driver2")),3) occurs(action(("drive-truck","truck2","s2","s6","driver1")),4) occurs(action(("disembark-truck","driver2","truck1","s2")),4) occurs(action(("drive-truck","truck2","s6","s3","driver1")),5) occurs(action(("board-truck","driver2","truck3","s2")),5) occurs(action(("unload-truck","package2","truck2","s3")),6) occurs(action(("load-truck","package3","truck2","s3")),6) occurs(action(("drive-truck","truck2","s3","s6","driver1")),6) occurs(action(("drive-truck","truck3","s2","s5","driver2")),6) occurs(action(("drive-truck","truck2","s6","s4","driver1")),7) occurs(action(("load-truck","package5","truck3","s5")),7) occurs(action(("drive-truck","truck3","s5","s1","driver2")),7) occurs(action(("unload-truck","package3","truck2","s4")),8) occurs(action(("unload-truck","package5","truck3","s1")),8) occurs(action(("disembark-truck","driver1","truck2","s4")),8) occurs(action(("disembark-truck","driver2","truck3","s1")),8) occurs(action(("walk","driver2","s1","p4-1")),9) occurs(action(("board-truck","driver1","truck2","s4")),9) occurs(action(("walk","driver2","p4-1","s4")),10)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 4
|
||||||
|
Time : 0.502s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
|
||||||
|
CPU Time : 0.496s
|
||||||
|
|
||||||
|
Choices : 580 (Domain: 571)
|
||||||
|
Conflicts : 204 (Analyzed: 203)
|
||||||
|
Restarts : 1 (Average: 203.00 Last: 40)
|
||||||
|
Model-Level : 69.0
|
||||||
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||||||
|
Lemmas : 224 (Deleted: 0)
|
||||||
|
Binary : 21 (Ratio: 9.38%)
|
||||||
|
Ternary : 0 (Ratio: 0.00%)
|
||||||
|
Conflict : 203 (Average Length: 194.4 Ratio: 90.62%)
|
||||||
|
Loop : 21 (Average Length: 2.0 Ratio: 9.38%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 203 (Average: 2.14 Max: 36 Sum: 435)
|
||||||
|
Executed : 203 (Average: 2.14 Max: 36 Sum: 435 Ratio: 100.00%)
|
||||||
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||||
|
|
||||||
|
Rules : 213113
|
||||||
|
Acyc : 25380
|
||||||
|
Atoms : 187733
|
||||||
|
Bodies : 11 (Original: 10)
|
||||||
|
Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 6993 (Eliminated: 0 Frozen: 2735)
|
||||||
|
Constraints : 23185 (Binary: 93.1% Ternary: 3.9% Other: 3.0%)
|
||||||
|
|
||||||
|
Memory Peak : 75MB
|
||||||
|
Max. Length : 10 steps
|
||||||
|
Sol. Length : 10 steps
|
||||||
|
Models : 2
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user