Add benchmark result [gc-ta1-tt1 | ipc-2000 | blocks-strips-typed | 2]

This commit is contained in:
Potassco Bot 2017-11-28 05:04:03 +01:00
parent 42150c2e7a
commit b86752a363
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 216 additions and 0 deletions

View File

@ -0,0 +1,51 @@
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-2.pddl
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
configuration:
id: gc-ta1-tt1
instanceSets:
- lpnmr-first-plan-not-serializable
- rintanen-aij-2012
options:
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
exitCode: 0
instance:
domain: blocks-strips-typed
instance: 2
ipc: ipc-2000
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 61750c0521c6104870e5b881c8b0c237e2af4a96 (2017-11-27 07:44:27 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

View File

@ -0,0 +1,18 @@
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
# instance: {'ipc': 'ipc-2000', 'domain': 'blocks-strips-typed', 'instance': 2}
# 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-2.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-2.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_forall_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 1.51 MEM 33472 MAXMEM 117196 STALE 1 MAXMEM_RSS 42872
<time name="ALL">1470</time>

View File

@ -0,0 +1,147 @@
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-2.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-2.pddl
Parsing...
Parsing: [0.010s CPU, 0.009s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.001s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.009s wall-clock]
Preparing model... [0.010s CPU, 0.003s wall-clock]
Generated 21 rules.
Computing model... [0.010s CPU, 0.010s wall-clock]
82 relevant atoms
52 auxiliary atoms
134 final queue length
207 total queue pushes
Completing instantiation... [0.010s CPU, 0.013s wall-clock]
Instantiating: [0.030s CPU, 0.036s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.000s wall-clock]
Choosing groups...
5 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.030s CPU, 0.026s 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.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.001s wall-clock]
Translating task: [0.010s CPU, 0.013s wall-clock]
44 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
8 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.008s wall-clock]
Reordering and filtering variables...
9 of 9 variables necessary.
5 of 9 mutex groups necessary.
32 of 32 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
Translator variables: 9
Translator derived variables: 0
Translator facts: 30
Translator goal facts: 3
Translator mutex groups: 5
Translator total mutex groups size: 25
Translator operators: 32
Translator axioms: 0
Translator task size: 295
Translator peak memory: 36300 KB
Writing output... [0.010s CPU, 0.008s wall-clock]
Done! [0.100s CPU, 0.109s wall-clock]
planner.py version 0.0.1
Time: 0.02s
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: 50MB (+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.01s
Memory: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
UNSAT
Iteration Time: 0.01s
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.01s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.01s
Memory: 51MB (+0MB)
Answer: 1
occurs(action(("unstack","b","c")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","c","a")),3) occurs(action(("put-down","c")),4) occurs(action(("unstack","a","d")),5) occurs(action(("stack","a","b")),6) occurs(action(("pick-up","c")),7) occurs(action(("stack","c","a")),8) occurs(action(("pick-up","d")),9) occurs(action(("stack","d","c")),10)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.039s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.036s
Choices : 5 (Domain: 5)
Conflicts : 0 (Analyzed: 0)
Restarts : 0
Model-Level : 17.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 0 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
Rules : 925
Atoms : 925
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 821 (Eliminated: 0 Frozen: 0)
Constraints : 3688 (Binary: 90.2% Ternary: 6.1% Other: 3.7%)
Memory Peak : 51MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1