Add benchmark result [gc-ta1-tt1 | ipc-2011 | parc-printer-sequential-satisficing | 6]

This commit is contained in:
Potassco Bot 2017-12-05 02:04:57 +01:00
parent eecc97f95b
commit 7839e6ca22
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 240 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/parc-printer-sequential-satisficing/domains/domain-6.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-6.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: parc-printer-sequential-satisficing
instance: 6
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,24 @@
# 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': 'parc-printer-sequential-satisficing', 'instance': 6}
# 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/parc-printer-sequential-satisficing/domains/domain-6.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-6.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
/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-2011/domains/parc-printer-sequential-satisficing/domains/domain-6.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-6.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 2.46 MEM 33472 MAXMEM 119176 STALE 1 MAXMEM_RSS 48484
<time name="ALL">2410</time>

View File

@ -0,0 +1,163 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/domains/domain-6.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-6.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/parc-printer-sequential-satisficing/domains/domain-6.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parc-printer-sequential-satisficing/instances/instance-6.pddl
Parsing...
Parsing: [0.050s CPU, 0.055s wall-clock]
Normalizing task... [0.010s CPU, 0.005s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.042s wall-clock]
Preparing model... [0.040s CPU, 0.032s wall-clock]
Generated 211 rules.
Computing model... [0.110s CPU, 0.110s wall-clock]
703 relevant atoms
964 auxiliary atoms
1667 final queue length
2332 total queue pushes
Completing instantiation... [0.110s CPU, 0.115s wall-clock]
Instantiating: [0.300s CPU, 0.312s wall-clock]
Computing fact groups...
Finding invariants...
20 initial candidates
Finding invariants: [0.040s CPU, 0.038s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.000s CPU, 0.005s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
156 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.010s CPU, 0.007s wall-clock]
Computing fact groups: [0.080s CPU, 0.073s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s 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.010s CPU, 0.006s wall-clock]
Translating task: [0.120s CPU, 0.113s wall-clock]
211 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
9 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.062s wall-clock]
Reordering and filtering variables...
71 of 162 variables necessary.
0 of 7 mutex groups necessary.
316 of 316 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.032s wall-clock]
Translator variables: 71
Translator derived variables: 0
Translator facts: 212
Translator goal facts: 42
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 316
Translator axioms: 0
Translator task size: 2263
Translator peak memory: 38092 KB
Writing output... [0.040s CPU, 0.046s wall-clock]
Done! [0.700s CPU, 0.709s wall-clock]
planner.py version 0.0.1
Time: 0.08s
Memory: 54MB
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: 54MB (+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: 54MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 56MB (+1MB)
UNSAT
Iteration Time: 0.04s
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: 58.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.03s
Memory: 58MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 59MB (+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
Expected Memory: 62.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.03s
Memory: 61MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 62MB (+1MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.06s
Memory: 62MB (+0MB)
Answer: 1
occurs(action("initialize"),1) occurs(action(("fe1-feed-letter","sheet7")),2) occurs(action(("fe1-feed-letter","sheet6")),2) occurs(action(("fe1-feedmsi-letter","sheet5")),2) occurs(action(("fe1-feedmsi-letter","sheet4")),2) occurs(action(("fe1-feedmsi-letter","sheet3")),2) occurs(action(("fe1-feedmsi-letter","sheet2")),2) occurs(action(("fe1-feed-letter","sheet1")),2) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet7")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet6")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet5")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet4")),3) occurs(action(("hw1-leftentrytobottomleftexit-letter","sheet3")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet2")),3) occurs(action(("hw1-leftentrytotopleftexit-letter","sheet1")),3) occurs(action(("lc1-inverttoime-letter","sheet7","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet6","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet5","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet4","back","front")),4) occurs(action(("lc1-inverttoime-letter","sheet3","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet2","back","front")),4) occurs(action(("uc1-inverttoime-letter","sheet1","back","front")),4) occurs(action(("uime-simplex-letter","sheet1","front","image-1")),5) occurs(action(("uime-simplex-letter","sheet2","front","image-2")),5) occurs(action(("lime-simplex-letter","sheet3","front","image-3")),5) occurs(action(("lime-simplex-letter","sheet4","front","image-4")),5) occurs(action(("uime-simplex-letter","sheet5","front","image-5")),5) occurs(action(("uime-simplex-letter","sheet6","front","image-6")),5) occurs(action(("lime-simplex-letter","sheet7","front","image-7")),5) occurs(action(("lc1-fromime-letter","sheet7")),6) occurs(action(("uc1-fromime-letter","sheet6")),6) occurs(action(("uc1-fromime-letter","sheet5")),6) occurs(action(("lc1-fromime-letter","sheet4")),6) occurs(action(("lc1-fromime-letter","sheet3")),6) occurs(action(("uc1-fromime-letter","sheet2")),6) occurs(action(("uc1-fromime-letter","sheet1")),6) occurs(action(("hw1-toprightentrytorightexit-letter","sheet6")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet5")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet4")),7) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet3")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet2")),7) occurs(action(("hw1-toprightentrytorightexit-letter","sheet1")),7) occurs(action(("sys-stack-letter","sheet1","dummy-sheet")),8) occurs(action(("sys-stack-letter","sheet2","sheet1")),9) occurs(action(("sys-stack-letter","sheet3","sheet2")),10) occurs(action(("sys-stack-letter","sheet4","sheet3")),11) occurs(action(("sys-stack-letter","sheet5","sheet4")),12) occurs(action(("sys-stack-letter","sheet6","sheet5")),13) occurs(action(("hw1-bottomrightentrytorightexit-letter","sheet7")),14) occurs(action(("sys-stack-letter","sheet7","sheet6")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.228s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.216s
Choices : 278 (Domain: 246)
Conflicts : 1 (Analyzed: 1)
Restarts : 0
Model-Level : 294.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 1 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 1 (Average Length: 311.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1 (Average: 1.00 Max: 1 Sum: 1)
Executed : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 6908
Atoms : 6908
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 10278 (Eliminated: 0 Frozen: 1159)
Constraints : 35881 (Binary: 91.2% Ternary: 5.1% Other: 3.6%)
Memory Peak : 64MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1