Add benchmark result [fd-pb-e3 | ipc-2000 | blocks-strips-typed | 12]
This commit is contained in:
parent
dab999d10a
commit
0c944145fc
38
fd-pb-e3/ipc-2000_blocks-strips-typed_12.env
Normal file
38
fd-pb-e3/ipc-2000_blocks-strips-typed_12.env
Normal file
@ -0,0 +1,38 @@
|
|||||||
|
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/blocks-strips-typed/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-12.pddl
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -B 0.9
|
||||||
|
- --parallel=3
|
||||||
|
configuration:
|
||||||
|
id: fd-pb-e3
|
||||||
|
instanceSets:
|
||||||
|
- lnpmr-hard-instances
|
||||||
|
options:
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -B 0.9
|
||||||
|
- --parallel=3
|
||||||
|
exitCode: 0
|
||||||
|
instance:
|
||||||
|
domain: blocks-strips-typed
|
||||||
|
instance: 12
|
||||||
|
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.0
|
||||||
|
python: 3.6.3
|
||||||
|
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
|
18
fd-pb-e3/ipc-2000_blocks-strips-typed_12.err
Normal file
18
fd-pb-e3/ipc-2000_blocks-strips-typed_12.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# configuration: {'id': 'fd-pb-e3', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=3'], 'instanceSets': ['lnpmr-hard-instances']}
|
||||||
|
# instance: {'ipc': 'ipc-2000', 'domain': 'blocks-strips-typed', '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-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-12.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=3']
|
||||||
|
# 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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-12.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 -c _closure=3 -c _parallel=3
|
||||||
|
FINISHED CPU 1.61 MEM 30288 MAXMEM 107788 STALE 0 MAXMEM_RSS 39956
|
||||||
|
<time name="ALL">1470</time>
|
||||||
|
|
168
fd-pb-e3/ipc-2000_blocks-strips-typed_12.out
Normal file
168
fd-pb-e3/ipc-2000_blocks-strips-typed_12.out
Normal file
@ -0,0 +1,168 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-12.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.010s CPU, 0.014s wall-clock]
|
||||||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
|
||||||
|
Preparing model... [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Generated 21 rules.
|
||||||
|
Computing model... [0.030s CPU, 0.030s wall-clock]
|
||||||
|
205 relevant atoms
|
||||||
|
133 auxiliary atoms
|
||||||
|
338 final queue length
|
||||||
|
550 total queue pushes
|
||||||
|
Completing instantiation... [0.050s CPU, 0.041s wall-clock]
|
||||||
|
Instantiating: [0.090s CPU, 0.088s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
10 initial candidates
|
||||||
|
Finding invariants: [0.020s CPU, 0.022s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
8 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.003s wall-clock]
|
||||||
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Computing fact groups: [0.030s CPU, 0.035s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s 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.002s wall-clock]
|
||||||
|
Translating task: [0.040s CPU, 0.037s wall-clock]
|
||||||
|
140 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
14 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.020s CPU, 0.022s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
15 of 15 variables necessary.
|
||||||
|
8 of 15 mutex groups necessary.
|
||||||
|
98 of 98 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
|
||||||
|
Translator variables: 15
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 72
|
||||||
|
Translator goal facts: 6
|
||||||
|
Translator mutex groups: 8
|
||||||
|
Translator total mutex groups size: 64
|
||||||
|
Translator operators: 98
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 871
|
||||||
|
Translator peak memory: 33368 KB
|
||||||
|
Writing output... [0.020s CPU, 0.016s wall-clock]
|
||||||
|
Done! [0.220s CPU, 0.230s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.08s
|
||||||
|
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.05s
|
||||||
|
Memory: 53MB (+5MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 53MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.06s
|
||||||
|
|
||||||
|
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: 56MB (+3MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 56MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.06s
|
||||||
|
|
||||||
|
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.04s
|
||||||
|
Memory: 58MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 59MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.05s
|
||||||
|
|
||||||
|
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.04s
|
||||||
|
Memory: 61MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Answer: 1
|
||||||
|
occurs(action(("unstack","b","c")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","c","g")),3) occurs(action(("stack","c","a")),4) occurs(action(("unstack","g","e")),5) occurs(action(("put-down","g")),6) occurs(action(("unstack","c","a")),7) occurs(action(("stack","c","g")),8) occurs(action(("unstack","a","d")),9) occurs(action(("stack","a","c")),10) occurs(action(("unstack","e","f")),11) occurs(action(("put-down","e")),12) occurs(action(("pick-up","d")),13) occurs(action(("stack","d","a")),14) occurs(action(("pick-up","f")),15) occurs(action(("stack","f","d")),16) occurs(action(("pick-up","b")),17) occurs(action(("stack","b","f")),18) occurs(action(("pick-up","e")),19) occurs(action(("stack","e","b")),20)
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 62MB (+1MB)
|
||||||
|
SAT
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 5
|
||||||
|
Time : 0.301s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||||
|
CPU Time : 0.300s
|
||||||
|
|
||||||
|
Choices : 299
|
||||||
|
Conflicts : 60 (Analyzed: 58)
|
||||||
|
Restarts : 0
|
||||||
|
Model-Level : 28.0
|
||||||
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||||||
|
Lemmas : 58 (Deleted: 0)
|
||||||
|
Binary : 20 (Ratio: 34.48%)
|
||||||
|
Ternary : 1 (Ratio: 1.72%)
|
||||||
|
Conflict : 58 (Average Length: 25.7 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 58 (Average: 6.24 Max: 53 Sum: 362)
|
||||||
|
Executed : 47 (Average: 5.05 Max: 53 Sum: 293 Ratio: 80.94%)
|
||||||
|
Bounded : 11 (Average: 6.27 Max: 22 Sum: 69 Ratio: 19.06%)
|
||||||
|
|
||||||
|
Rules : 19737
|
||||||
|
Atoms : 19737
|
||||||
|
Bodies : 1 (Original: 0)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 7526 (Eliminated: 0 Frozen: 6425)
|
||||||
|
Constraints : 20679 (Binary: 90.4% Ternary: 5.7% Other: 3.9%)
|
||||||
|
|
||||||
|
Memory Peak : 62MB
|
||||||
|
Max. Length : 20 steps
|
||||||
|
Sol. Length : 20 steps
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user