Add benchmark result [fd-pb-e1-sh-h | ipc-1998 | logistics-round-1-strips | 31]
This commit is contained in:
parent
976ad672eb
commit
f1f2bd2744
GPG Key ID:
1F54208CE70DDF73
43
fd-pb-e1-sh-h/ipc-1998_logistics-round-1-strips_31.env
Normal file
43
fd-pb-e1-sh-h/ipc-1998_logistics-round-1-strips_31.env
Normal file
@ -0,0 +1,43 @@
|
||||
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-1998/domains/logistics-round-1-strips/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-31.pddl
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=1
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
configuration:
|
||||
id: fd-pb-e1-sh-h
|
||||
instanceSets:
|
||||
- lnpmr-hard-instances
|
||||
- lpnmr-easy-instances
|
||||
options:
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=1
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: logistics-round-1-strips
|
||||
instance: 31
|
||||
ipc: ipc-1998
|
||||
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.0
|
||||
python: 3.6.3
|
||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
|
||||
33
fd-pb-e1-sh-h/ipc-1998_logistics-round-1-strips_31.err
Normal file
33
fd-pb-e1-sh-h/ipc-1998_logistics-round-1-strips_31.err
Normal file
@ -0,0 +1,33 @@
|
||||
# configuration: {'id': 'fd-pb-e1-sh-h', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=1', '--shallow', '--use-heuristic'], 'instanceSets': ['lnpmr-hard-instances', 'lpnmr-easy-instances']}
|
||||
# instance: {'ipc': 'ipc-1998', 'domain': 'logistics-round-1-strips', 'instance': 31}
|
||||
# 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-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-31.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=1', '--shallow', '--use-heuristic']
|
||||
# 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))
|
||||
|
||||
/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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-31.pddl && plasp-3.1.0 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 --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=1
|
||||
FINISHED CPU 1.51 MEM 0 MAXMEM 108356 STALE 0 MAXMEM_RSS 40188
|
||||
<time name="ALL">1410</time>
|
||||
|
||||
142
fd-pb-e1-sh-h/ipc-1998_logistics-round-1-strips_31.out
Normal file
142
fd-pb-e1-sh-h/ipc-1998_logistics-round-1-strips_31.out
Normal file
@ -0,0 +1,142 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-31.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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-31.pddl
|
||||
Parsing...
|
||||
Parsing: [0.010s CPU, 0.017s wall-clock]
|
||||
Normalizing task... [0.010s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.013s wall-clock]
|
||||
Generated 51 rules.
|
||||
Computing model... [0.060s CPU, 0.069s wall-clock]
|
||||
352 relevant atoms
|
||||
400 auxiliary atoms
|
||||
752 final queue length
|
||||
881 total queue pushes
|
||||
Completing instantiation... [0.050s CPU, 0.044s wall-clock]
|
||||
Instantiating: [0.150s CPU, 0.155s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
6 initial candidates
|
||||
Finding invariants: [0.010s CPU, 0.009s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.000s CPU, 0.006s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
0 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.001s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.020s CPU, 0.021s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.000s CPU, 0.000s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
||||
Translating task: [0.030s CPU, 0.031s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
10 propositions removed
|
||||
Detecting unreachable propositions: [0.020s CPU, 0.017s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
10 of 10 variables necessary.
|
||||
0 of 10 mutex groups necessary.
|
||||
170 of 170 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
|
||||
Translator variables: 10
|
||||
Translator derived variables: 0
|
||||
Translator facts: 71
|
||||
Translator goal facts: 3
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 170
|
||||
Translator axioms: 0
|
||||
Translator task size: 714
|
||||
Translator peak memory: 33624 KB
|
||||
Writing output... [0.020s CPU, 0.017s wall-clock]
|
||||
Done! [0.260s CPU, 0.268s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.05s
|
||||
Memory: 47MB
|
||||
|
||||
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: 47MB (+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.02s
|
||||
Memory: 48MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 48MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.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
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 49MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),1) occurs(action(("fly-airplane","plane1","city2-2","city4-2")),1) occurs(action(("fly-airplane","plane2","city1-2","city2-2")),1) occurs(action(("load-truck","package1","truck4","city4-1")),1) occurs(action(("load-truck","package2","truck1","city1-2")),2) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("unload-truck","package1","truck4","city4-2")),3) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),3) occurs(action(("unload-truck","package2","truck1","city1-1")),4) occurs(action(("load-airplane","package1","plane1","city4-2")),4) occurs(action(("fly-airplane","plane2","city2-2","city3-2")),4) occurs(action(("load-truck","package3","truck1","city1-1")),4) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),4) occurs(action(("fly-airplane","plane1","city4-2","city3-2")),5) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),5) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),5) occurs(action(("unload-airplane","package1","plane1","city3-2")),6) occurs(action(("unload-truck","package3","truck1","city1-2")),6) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),7) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),8) occurs(action(("fly-airplane","plane2","city3-2","city5-2")),8) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),8) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),8) occurs(action(("fly-airplane","plane2","city5-2","city1-2")),9) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),9) occurs(action(("fly-airplane","plane2","city1-2","city4-2")),10)
|
||||
Solving Time: 0.00s
|
||||
Memory: 49MB (+0MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 0.108s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.110s
|
||||
|
||||
Choices : 182 (Domain: 169)
|
||||
Conflicts : 7 (Analyzed: 6)
|
||||
Restarts : 0
|
||||
Model-Level : 164.0
|
||||
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||||
Lemmas : 6 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 1 (Ratio: 16.67%)
|
||||
Conflict : 6 (Average Length: 2.8 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 6 (Average: 9.67 Max: 19 Sum: 58)
|
||||
Executed : 2 (Average: 5.00 Max: 12 Sum: 30 Ratio: 51.72%)
|
||||
Bounded : 4 (Average: 7.00 Max: 7 Sum: 28 Ratio: 48.28%)
|
||||
|
||||
Rules : 2618
|
||||
Atoms : 2618
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 2964 (Eliminated: 0 Frozen: 1924)
|
||||
Constraints : 10446 (Binary: 89.7% Ternary: 6.6% Other: 3.7%)
|
||||
|
||||
Memory Peak : 50MB
|
||||
Max. Length : 10 steps
|
||||
Sol. Length : 10 steps
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user