Add benchmark result [gc-ta1-tt1 | ipc-2011 | scanalyzer-3d-sequential-satisficing | 2]

This commit is contained in:
Potassco Bot 2017-12-05 08:58:03 +01:00
parent a71b81d128
commit 8e445ce6a5
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 207 additions and 0 deletions

View File

@ -0,0 +1,53 @@
command:
- timeout
- -m=9216000
- -t=900
- python3
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-2.pddl
- --stats
- --verbose
- --print-call
- -m 8192
- --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
- -m 8192
- --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: scanalyzer-3d-sequential-satisficing
instance: 2
ipc: ipc-2011
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 398fcb36ad9c5a23a8c35820fb4b021802dbc349 (2017-11-30 17:03:27 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

View File

@ -0,0 +1,9 @@
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '-m 8192', '--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-2011', 'domain': 'scanalyzer-3d-sequential-satisficing', 'instance': 2}
# command: ['timeout', '-m=9216000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-2.pddl', '--stats', '--verbose', '--print-call', '-m 8192', '--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
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/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 -m 8192 -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 18.89 MEM 33472 MAXMEM 336452 STALE 1 MAXMEM_RSS 280104
<time name="ALL">18790</time>

View File

@ -0,0 +1,145 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/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-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-2.pddl
Parsing...
Parsing: [0.020s CPU, 0.029s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.033s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 51 rules.
Computing model... [1.250s CPU, 1.248s wall-clock]
10669 relevant atoms
4104 auxiliary atoms
14773 final queue length
40549 total queue pushes
Completing instantiation... [3.540s CPU, 3.540s wall-clock]
Instantiating: [4.860s CPU, 4.859s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.160s CPU, 0.164s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.190s CPU, 0.190s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.150s CPU, 0.147s wall-clock]
Translating task: [2.980s CPU, 2.977s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [1.580s CPU, 1.588s wall-clock]
Reordering and filtering variables...
24 of 24 variables necessary.
12 of 24 mutex groups necessary.
9504 of 9504 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.470s CPU, 0.466s wall-clock]
Translator variables: 24
Translator derived variables: 0
Translator facts: 168
Translator goal facts: 24
Translator mutex groups: 12
Translator total mutex groups size: 144
Translator operators: 9504
Translator axioms: 0
Translator task size: 52632
Translator peak memory: 73676 KB
Writing output... [0.980s CPU, 1.059s wall-clock]
Done! [11.220s CPU, 11.312s wall-clock]
planner.py version 0.0.1
Time: 2.22s
Memory: 196MB
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.01s
Memory: 196MB (+0MB)
UNSAT
Iteration Time: 0.01s
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
Expected Memory: 196MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.81s
Memory: 196MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 204MB (+8MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.96s
Memory: 291MB (+87MB)
Solving...
Solving Time: 0.07s
Memory: 291MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 291MB (+0MB)
Answer: 2
occurs(action(("analyze-2","seg-in-1","seg-out-6","car-in-1","car-out-6")),1) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-in-2","car-out-1")),1) occurs(action(("analyze-2","seg-in-3","seg-out-2","car-in-3","car-out-2")),1) occurs(action(("analyze-2","seg-in-4","seg-out-3","car-in-4","car-out-3")),1) occurs(action(("analyze-2","seg-in-5","seg-out-4","car-in-5","car-out-4")),1) occurs(action(("analyze-2","seg-in-6","seg-out-5","car-in-6","car-out-5")),1) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-1","car-in-2")),2) occurs(action(("analyze-2","seg-in-3","seg-out-2","car-out-2","car-in-3")),2) occurs(action(("analyze-2","seg-in-4","seg-out-3","car-out-3","car-in-4")),2) occurs(action(("analyze-2","seg-in-5","seg-out-4","car-out-4","car-in-5")),2) occurs(action(("analyze-2","seg-in-6","seg-out-5","car-out-5","car-in-6")),2) occurs(action(("analyze-2","seg-in-1","seg-out-6","car-out-6","car-in-1")),2) occurs(action(("rotate-2","seg-in-4","seg-out-1","car-in-4","car-out-1")),3) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-in-1","car-out-6")),3) occurs(action(("rotate-2","seg-in-4","seg-out-1","car-out-1","car-in-4")),4) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-out-6","car-in-1")),5)
SATISFIABLE
Models : 1+
Calls : 3
Time : 3.968s (Solving: 0.03s 1st Model: 0.03s Unsat: 0.00s)
CPU Time : 3.832s
Choices : 381 (Domain: 360)
Conflicts : 12 (Analyzed: 12)
Restarts : 0
Model-Level : 190.0
Problems : 3 (Average Length: 5.33 Splits: 0)
Lemmas : 12 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 12 (Average Length: 15198.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 12 (Average: 1.25 Max: 2 Sum: 15)
Executed : 12 (Average: 1.25 Max: 2 Sum: 15 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 250497
Atoms : 186561
Bodies : 32094 (Original: 32093)
Count : 60
Equivalences : 32043 (Atom=Atom: 5 Body=Body: 0 Other: 32038)
Tight : Yes
Variables : 39839 (Eliminated: 0 Frozen: 32748)
Constraints : 353344 (Binary: 99.6% Ternary: 0.2% Other: 0.3%)
Memory Peak : 291MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 2