Add benchmark result [fd-pb-e1-sh-h | ipc-2000 | elevator-strips-simple-typed | 54]
This commit is contained in:
parent
be8c0432f3
commit
9bfb9d0fbe
43
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_54.env
Normal file
43
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_54.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-54.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: 54
|
||||
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_54.err
Normal file
33
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_54.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': 54}
|
||||
# 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-54.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-54.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 8.85 MEM 0 MAXMEM 108972 STALE 1 MAXMEM_RSS 53540
|
||||
<time name="ALL">8810</time>
|
||||
|
237
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_54.out
Normal file
237
fd-pb-e1-sh-h/ipc-2000_elevator-strips-simple-typed_54.out
Normal file
@ -0,0 +1,237 @@
|
||||
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-54.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-54.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.007s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.000s CPU, 0.009s wall-clock]
|
||||
Preparing model... [0.030s CPU, 0.023s wall-clock]
|
||||
Generated 18 rules.
|
||||
Computing model... [0.080s CPU, 0.085s wall-clock]
|
||||
881 relevant atoms
|
||||
583 auxiliary atoms
|
||||
1464 final queue length
|
||||
1905 total queue pushes
|
||||
Completing instantiation... [0.080s CPU, 0.076s wall-clock]
|
||||
Instantiating: [0.200s CPU, 0.203s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
6 initial candidates
|
||||
Finding invariants: [0.010s CPU, 0.005s wall-clock]
|
||||
Checking invariant weight... [0.000s 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...
|
||||
22 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.010s 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.004s wall-clock]
|
||||
Translating task: [0.080s CPU, 0.077s wall-clock]
|
||||
11 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.044s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
23 of 23 variables necessary.
|
||||
0 of 1 mutex groups necessary.
|
||||
484 of 484 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
|
||||
Translator variables: 23
|
||||
Translator derived variables: 0
|
||||
Translator facts: 66
|
||||
Translator goal facts: 11
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 484
|
||||
Translator axioms: 0
|
||||
Translator task size: 1574
|
||||
Translator peak memory: 34136 KB
|
||||
Writing output... [0.030s CPU, 0.038s wall-clock]
|
||||
Done! [0.410s CPU, 0.414s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.09s
|
||||
Memory: 49MB
|
||||
|
||||
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: 49MB (+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: 50MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 51MB (+1MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.05s
|
||||
|
||||
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: 52MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 53MB (+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: 55MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.19s
|
||||
Memory: 57MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.23s
|
||||
|
||||
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: 58MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.09s
|
||||
Memory: 59MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.13s
|
||||
|
||||
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.03s
|
||||
Memory: 62MB (+3MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.05s
|
||||
Memory: 63MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.10s
|
||||
|
||||
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.03s
|
||||
Memory: 64MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.23s
|
||||
Memory: 66MB (+2MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.28s
|
||||
|
||||
Iteration 8
|
||||
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Blocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.12s
|
||||
Memory: 66MB (+0MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.12s
|
||||
|
||||
Iteration 9
|
||||
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.00s
|
||||
Memory: 66MB (+0MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.00s
|
||||
|
||||
Iteration 10
|
||||
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.23s
|
||||
Memory: 66MB (+0MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.24s
|
||||
|
||||
Iteration 11
|
||||
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||||
Grounding Time: 0.03s
|
||||
Memory: 69MB (+3MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("up","f0","f14")),1) occurs(action(("board","f14","p10")),2) occurs(action(("board","f14","p9")),2) occurs(action(("down","f14","f4")),3) occurs(action(("depart","f4","p9")),4) occurs(action(("up","f4","f8")),5) occurs(action(("board","f8","p8")),6) occurs(action(("up","f8","f9")),7) occurs(action(("depart","f9","p8")),8) occurs(action(("board","f9","p5")),8) occurs(action(("up","f9","f18")),9) occurs(action(("board","f18","p7")),10) occurs(action(("down","f18","f11")),11) occurs(action(("depart","f11","p10")),12) occurs(action(("depart","f11","p7")),12) occurs(action(("down","f11","f1")),13) occurs(action(("board","f1","p2")),14) occurs(action(("up","f1","f8")),15) occurs(action(("depart","f8","p2")),16) occurs(action(("depart","f8","p5")),16) occurs(action(("board","f8","p8")),16) occurs(action(("down","f8","f6")),17) occurs(action(("board","f6","p1")),18) occurs(action(("board","f6","p6")),18) occurs(action(("up","f6","f10")),19) occurs(action(("depart","f10","p6")),20) occurs(action(("up","f10","f15")),21) occurs(action(("board","f15","p4")),22) occurs(action(("up","f15","f18")),23) occurs(action(("depart","f18","p4")),24) occurs(action(("board","f18","p7")),24) occurs(action(("down","f18","f13")),25) occurs(action(("board","f13","p0")),26) occurs(action(("up","f13","f19")),27) occurs(action(("depart","f19","p0")),28) occurs(action(("down","f19","f17")),29) occurs(action(("board","f17","p3")),30) occurs(action(("down","f17","f12")),31) occurs(action(("depart","f12","p3")),32) occurs(action(("up","f12","f21")),33) occurs(action(("depart","f21","p1")),34) occurs(action(("down","f21","f10")),35)
|
||||
Solving Time: 0.01s
|
||||
Memory: 71MB (+2MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 11
|
||||
Time : 7.352s (Solving: 6.92s 1st Model: 0.00s Unsat: 0.19s)
|
||||
CPU Time : 7.350s
|
||||
|
||||
Choices : 220665 (Domain: 220640)
|
||||
Conflicts : 51494 (Analyzed: 51491)
|
||||
Restarts : 619 (Average: 83.18 Last: 132)
|
||||
Model-Level : 219.0
|
||||
Problems : 11 (Average Length: 22.91 Splits: 0)
|
||||
Lemmas : 51491 (Deleted: 43605)
|
||||
Binary : 149 (Ratio: 0.29%)
|
||||
Ternary : 469 (Ratio: 0.91%)
|
||||
Conflict : 51491 (Average Length: 44.8 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 51491 (Average: 3.53 Max: 50 Sum: 181627)
|
||||
Executed : 51467 (Average: 3.52 Max: 50 Sum: 181442 Ratio: 99.90%)
|
||||
Bounded : 24 (Average: 7.71 Max: 27 Sum: 185 Ratio: 0.10%)
|
||||
|
||||
Rules : 6199
|
||||
Atoms : 6199
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 20839 (Eliminated: 0 Frozen: 16534)
|
||||
Constraints : 104729 (Binary: 97.1% Ternary: 2.1% Other: 0.9%)
|
||||
|
||||
Memory Peak : 72MB
|
||||
Max. Length : 35 steps
|
||||
Sol. Length : 35 steps
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user