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

This commit is contained in:
Potassco Bot 2017-12-05 08:58:59 +01:00
parent f9ba3058be
commit 5152090b61
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 239 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-4.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: 4
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': 4}
# 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-4.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-4.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 8.35 MEM 33472 MAXMEM 188776 STALE 1 MAXMEM_RSS 132340
<time name="ALL">8270</time>

View File

@ -0,0 +1,177 @@
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-4.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-4.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.029s wall-clock]
Preparing model... [0.020s CPU, 0.013s wall-clock]
Generated 51 rules.
Computing model... [0.410s CPU, 0.412s wall-clock]
2797 relevant atoms
2486 auxiliary atoms
5283 final queue length
10483 total queue pushes
Completing instantiation... [0.830s CPU, 0.831s wall-clock]
Instantiating: [1.290s CPU, 1.295s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.140s CPU, 0.135s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
10 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.160s CPU, 0.153s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.035s wall-clock]
Translating task: [0.660s CPU, 0.663s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
10 propositions removed
Detecting unreachable propositions: [0.320s CPU, 0.320s wall-clock]
Reordering and filtering variables...
20 of 20 variables necessary.
10 of 20 mutex groups necessary.
2340 of 2340 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.098s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 120
Translator goal facts: 20
Translator mutex groups: 10
Translator total mutex groups size: 100
Translator operators: 2340
Translator axioms: 0
Translator task size: 12050
Translator peak memory: 45004 KB
Writing output... [0.220s CPU, 0.238s wall-clock]
Done! [2.800s CPU, 2.826s wall-clock]
planner.py version 0.0.1
Time: 0.50s
Memory: 82MB
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: 82MB (+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
Expected Memory: 82MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.14s
Memory: 82MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 83MB (+1MB)
UNSAT
Iteration Time: 0.22s
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
Expected Memory: 84.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.15s
Memory: 90MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 0.39s
Memory: 97MB (+7MB)
UNSAT
Iteration Time: 0.62s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 111.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.15s
Memory: 103MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 1.56s
Memory: 112MB (+9MB)
UNKNOWN
Iteration Time: 1.79s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 127.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.18s
Memory: 121MB (+9MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 125MB (+4MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.39s
Memory: 147MB (+22MB)
Answer: 1
occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-1","car-out-1")),1) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-in-2","car-out-2")),1) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-in-4","car-out-3")),1) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-out-1","car-in-4")),2) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-out-2","car-in-1")),2) occurs(action(("rotate-2","seg-in-5","seg-out-2","car-in-5","car-in-2")),2) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-out-3","car-out-5")),2) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-4","car-out-2")),3) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-in-1","car-out-1")),3) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-in-3","car-out-3")),3) occurs(action(("rotate-2","seg-in-4","seg-out-4","car-out-5","car-out-4")),3) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-2","car-in-5")),4) occurs(action(("rotate-2","seg-in-3","seg-out-1","car-out-3","car-in-4")),4) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-out-1","car-in-3")),4) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-5","car-out-3")),5) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-in-4","car-out-1")),5) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-3","car-in-5")),6) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-5","car-out-2")),7) occurs(action(("rotate-2","seg-in-4","seg-out-1","car-out-4","car-out-3")),7) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-2","car-out-4")),8) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-out-3","car-in-4")),8) occurs(action(("rotate-2","seg-in-5","seg-out-2","car-in-2","car-in-5")),8) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-in-3","car-out-2")),9) occurs(action(("rotate-2","seg-in-1","seg-out-4","car-out-4","car-out-5")),9) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-5","car-in-3")),10) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-out-1","car-out-4")),10) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-3","car-in-2")),11) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-out-2","car-out-5")),11) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-2","car-out-2")),12) occurs(action(("rotate-2","seg-in-3","seg-out-2","car-out-4","car-in-3")),12) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-2","car-out-4")),13) occurs(action(("rotate-2","seg-in-4","seg-out-1","car-in-4","car-in-2")),13) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-4","car-in-4")),14) occurs(action(("rotate-2","seg-in-4","seg-out-4","car-in-2","car-out-1")),14) occurs(action(("rotate-2","seg-in-3","seg-out-2","car-in-3","car-out-2")),14) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-4","car-in-3")),15) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-out-5","car-in-2")),15) occurs(action(("rotate-2","seg-in-4","seg-out-1","car-out-1","car-out-4")),15) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-out-2","car-out-3")),15) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-3","car-out-1")),16) occurs(action(("rotate-2","seg-in-4","seg-out-2","car-out-4","car-in-4")),16) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-in-2","car-out-2")),16) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-1","car-in-3")),17) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-2","car-out-4")),17) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-in-3","car-in-1")),18) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-out-4","car-out-5")),18) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-3","car-in-3")),19) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-out-5","car-in-2")),20)
SATISFIABLE
Models : 1+
Calls : 5
Time : 3.446s (Solving: 1.95s 1st Model: 0.01s Unsat: 0.38s)
CPU Time : 3.424s
Choices : 78986 (Domain: 78976)
Conflicts : 11619 (Analyzed: 11617)
Restarts : 136 (Average: 85.42 Last: 63)
Model-Level : 436.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 11617 (Deleted: 8925)
Binary : 203 (Ratio: 1.75%)
Ternary : 181 (Ratio: 1.56%)
Conflict : 11617 (Average Length: 244.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 11617 (Average: 6.03 Max: 182 Sum: 70038)
Executed : 11603 (Average: 6.03 Max: 182 Sum: 70013 Ratio: 99.96%)
Bounded : 14 (Average: 1.79 Max: 12 Sum: 25 Ratio: 0.04%)
Rules : 38512
Atoms : 38512
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 49412 (Eliminated: 0 Frozen: 2000)
Constraints : 352872 (Binary: 98.7% Ternary: 0.6% Other: 0.8%)
Memory Peak : 147MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 1