Add benchmark result [fd-pb-e1-sh-h | ipc-2000 | elevator-strips-simple-typed | 50]
This commit is contained in:
parent
05ae52cc7d
commit
3aaae83e4d
GPG Key ID:
1F54208CE70DDF73
43
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_50.env
Normal file
43
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_50.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-2000/domains/elevator-strips-simple-typed/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-50.pddl
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=1
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
configuration:
|
||||
id: fd-pb-e1-sh-h
|
||||
instanceSets:
|
||||
- lpnmr-hard-instances
|
||||
- lpnmr-easy-instances
|
||||
options:
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=1
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: elevator-strips-simple-typed
|
||||
instance: 50
|
||||
ipc: ipc-2000
|
||||
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
|
||||
|
||||
33
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_50.err
Normal file
33
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_50.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': ['lpnmr-hard-instances', 'lpnmr-easy-instances']}
|
||||
# instance: {'ipc': 'ipc-2000', 'domain': 'elevator-strips-simple-typed', 'instance': 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-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-50.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-2000/domains/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-50.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 --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 3.79 MEM 30288 MAXMEM 108152 STALE 1 MAXMEM_RSS 43276
|
||||
<time name="ALL">3700</time>
|
||||
|
||||
194
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_50.out
Normal file
194
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_50.out
Normal file
@ -0,0 +1,194 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-50.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-2000/domains/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-50.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.026s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.023s wall-clock]
|
||||
Generated 18 rules.
|
||||
Computing model... [0.080s CPU, 0.079s wall-clock]
|
||||
741 relevant atoms
|
||||
490 auxiliary atoms
|
||||
1231 final queue length
|
||||
1592 total queue pushes
|
||||
Completing instantiation... [0.070s CPU, 0.065s wall-clock]
|
||||
Instantiating: [0.190s CPU, 0.186s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
6 initial candidates
|
||||
Finding invariants: [0.000s CPU, 0.005s wall-clock]
|
||||
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
20 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.010s CPU, 0.009s 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.003s wall-clock]
|
||||
Translating task: [0.060s CPU, 0.062s wall-clock]
|
||||
10 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
1 propositions removed
|
||||
Detecting unreachable propositions: [0.040s CPU, 0.036s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
21 of 21 variables necessary.
|
||||
0 of 1 mutex groups necessary.
|
||||
400 of 400 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.000s CPU, 0.009s wall-clock]
|
||||
Translator variables: 21
|
||||
Translator derived variables: 0
|
||||
Translator facts: 60
|
||||
Translator goal facts: 10
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 400
|
||||
Translator axioms: 0
|
||||
Translator task size: 1311
|
||||
Translator peak memory: 33880 KB
|
||||
Writing output... [0.030s CPU, 0.030s wall-clock]
|
||||
Done! [0.370s CPU, 0.365s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.07s
|
||||
Memory: 48MB
|
||||
|
||||
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: 48MB (+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.03s
|
||||
Memory: 49MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 50MB (+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: 51MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 52MB (+1MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.05s
|
||||
|
||||
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.03s
|
||||
Memory: 53MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.21s
|
||||
Memory: 55MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.25s
|
||||
|
||||
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.03s
|
||||
Memory: 56MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.87s
|
||||
Memory: 57MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 0.91s
|
||||
|
||||
Iteration 6
|
||||
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 20
|
||||
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 59MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.94s
|
||||
Memory: 61MB (+2MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 0.97s
|
||||
|
||||
Iteration 7
|
||||
Queue: [(6,30,0,True)]
|
||||
Grounded Until: 25
|
||||
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 62MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("up","f0","f3")),1) occurs(action(("board","f3","p9")),2) occurs(action(("up","f3","f9")),3) occurs(action(("depart","f9","p9")),4) occurs(action(("board","f9","p4")),4) occurs(action(("down","f9","f2")),5) occurs(action(("board","f2","p1")),6) occurs(action(("board","f2","p2")),6) occurs(action(("board","f2","p6")),6) occurs(action(("up","f2","f19")),7) occurs(action(("depart","f19","p6")),8) occurs(action(("down","f19","f0")),9) occurs(action(("depart","f0","p1")),10) occurs(action(("board","f0","p8")),10) occurs(action(("up","f0","f13")),11) occurs(action(("depart","f13","p8")),12) occurs(action(("down","f13","f7")),13) occurs(action(("board","f7","p3")),14) occurs(action(("down","f7","f5")),15) occurs(action(("depart","f5","p3")),16) occurs(action(("up","f5","f18")),17) occurs(action(("depart","f18","p2")),18) occurs(action(("board","f18","p7")),18) occurs(action(("down","f18","f13")),19) occurs(action(("depart","f13","p7")),20) occurs(action(("up","f13","f15")),21) occurs(action(("board","f15","p0")),22) occurs(action(("down","f15","f11")),23) occurs(action(("depart","f11","p0")),24) occurs(action(("down","f11","f10")),25) occurs(action(("board","f10","p5")),26) occurs(action(("down","f10","f9")),27) occurs(action(("depart","f9","p5")),28) occurs(action(("down","f9","f4")),29) occurs(action(("depart","f4","p4")),30)
|
||||
Solving Time: 0.01s
|
||||
Memory: 63MB (+1MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 7
|
||||
Time : 2.346s (Solving: 2.03s 1st Model: 0.00s Unsat: 0.22s)
|
||||
CPU Time : 2.340s
|
||||
|
||||
Choices : 64242 (Domain: 64241)
|
||||
Conflicts : 18349 (Analyzed: 18346)
|
||||
Restarts : 226 (Average: 81.18 Last: 85)
|
||||
Model-Level : 184.0
|
||||
Problems : 7 (Average Length: 17.00 Splits: 0)
|
||||
Lemmas : 18346 (Deleted: 13405)
|
||||
Binary : 111 (Ratio: 0.61%)
|
||||
Ternary : 282 (Ratio: 1.54%)
|
||||
Conflict : 18346 (Average Length: 45.3 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 18346 (Average: 3.03 Max: 39 Sum: 55631)
|
||||
Executed : 18316 (Average: 3.02 Max: 39 Sum: 55466 Ratio: 99.70%)
|
||||
Bounded : 30 (Average: 5.50 Max: 17 Sum: 165 Ratio: 0.30%)
|
||||
|
||||
Rules : 5156
|
||||
Atoms : 5156
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 15027 (Eliminated: 0 Frozen: 11669)
|
||||
Constraints : 74258 (Binary: 96.8% Ternary: 2.2% Other: 1.0%)
|
||||
|
||||
Memory Peak : 64MB
|
||||
Max. Length : 30 steps
|
||||
Sol. Length : 30 steps
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user