Add benchmark result [gc-ta1-tt1 | ipc-2006 | storage-propositional | 2]

2017-12-02 05:08:27 +01:00 · 2017-12-02 05:08:27 +01:00 · 94597f17c4
commit 94597f17c4
parent 577dfa0a78
3 changed files with 216 additions and 0 deletions
--- a/gc-ta1-tt1/ipc-2006_storage-propositional_2.env
+++ b/gc-ta1-tt1/ipc-2006_storage-propositional_2.env
@ -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-2006/domains/storage-propositional/domain.pddl
+- /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/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: storage-propositional
+  instance: 2
+  ipc: ipc-2006
+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
+
--- a/gc-ta1-tt1/ipc-2006_storage-propositional_2.err
+++ b/gc-ta1-tt1/ipc-2006_storage-propositional_2.err
@ -0,0 +1,18 @@
+# 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-2006', 'domain': 'storage-propositional', '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-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/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
+/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-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/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 1.78 MEM 33472 MAXMEM 116940 STALE 0 MAXMEM_RSS 43076
+<time name="ALL">1740</time>
+
--- a/gc-ta1-tt1/ipc-2006_storage-propositional_2.out
+++ b/gc-ta1-tt1/ipc-2006_storage-propositional_2.out
@ -0,0 +1,145 @@
+INFO     Running translator.
+INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/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-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-2.pddl
+Parsing...
+Parsing: [0.020s CPU, 0.018s wall-clock]
+Normalizing task... [0.000s CPU, 0.001s wall-clock]
+Instantiating...
+Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
+Normalizing Datalog program...
+Normalizing Datalog program: [0.030s CPU, 0.023s wall-clock]
+Preparing model... [0.010s CPU, 0.009s wall-clock]
+Generated 43 rules.
+Computing model... [0.020s CPU, 0.018s wall-clock]
+96 relevant atoms
+124 auxiliary atoms
+220 final queue length
+266 total queue pushes
+Completing instantiation... [0.000s CPU, 0.011s wall-clock]
+Instantiating: [0.070s CPU, 0.067s wall-clock]
+Computing fact groups...
+Finding invariants...
+16 initial candidates
+Finding invariants: [0.030s CPU, 0.033s wall-clock]
+Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
+Instantiating groups... [0.000s CPU, 0.001s wall-clock]
+Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
+Choosing groups...
+10 uncovered facts
+Choosing groups: [0.000s CPU, 0.000s wall-clock]
+Building translation key... [0.000s CPU, 0.001s wall-clock]
+Computing fact groups: [0.030s CPU, 0.037s 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.000s 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.020s CPU, 0.011s wall-clock]
+32 effect conditions simplified
+0 implied preconditions added
+Detecting unreachable propositions...
+0 operators removed
+0 axioms removed
+9 propositions removed
+Detecting unreachable propositions: [0.000s CPU, 0.006s wall-clock]
+Reordering and filtering variables...
+9 of 10 variables necessary.
+2 of 5 mutex groups necessary.
+28 of 28 operators necessary.
+0 of 0 axiom rules necessary.
+Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock]
+Translator variables: 9
+Translator derived variables: 0
+Translator facts: 25
+Translator goal facts: 1
+Translator mutex groups: 2
+Translator total mutex groups size: 4
+Translator operators: 28
+Translator axioms: 0
+Translator task size: 223
+Translator peak memory: 36300 KB
+Writing output... [0.010s CPU, 0.007s wall-clock]
+Done! [0.150s CPU, 0.152s 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
+Expected Memory: 50MB
+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)
+SAT
+Testing...
+NOT SERIALIZABLE
+Testing Time:	 0.02s
+Memory:		 50MB (+0MB)
+Solving...
+Solving Time:	 0.00s
+Memory:		 50MB (+0MB)
+SAT
+Testing...
+SERIALIZABLE?
+Testing Time:	 0.00s
+Memory:		 50MB (+0MB)
+Answer: 2
+occurs(action(("go-out","hoist0","depot0-1-1","loadarea")),1) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),2) occurs(action(("drop","hoist0","crate0","depot0-1-1","loadarea","depot0")),3) occurs(action(("go-in","hoist0","loadarea","container-0-0")),4) occurs(action(("go-out","hoist0","container-0-0","loadarea")),5)
+SATISFIABLE
+
+Models       : 1+
+Calls        : 3
+Time         : 0.042s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
+CPU Time     : 0.032s
+
+Choices      : 15       (Domain: 12)
+Conflicts    : 1        (Analyzed: 1)
+Restarts     : 0       
+Model-Level  : 14.0    
+Problems     : 3        (Average Length: 5.33 Splits: 0)
+Lemmas       : 1        (Deleted: 0)
+  Binary     : 1        (Ratio: 100.00%)
+  Ternary    : 0        (Ratio:   0.00%)
+  Conflict   : 1        (Average Length:    2.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        : 1096     (Original: 1000)
+Atoms        : 859     
+Bodies       : 256      (Original: 168)
+  Count      : 11       (Original: 24)
+Equivalences : 103      (Atom=Atom: 10 Body=Body: 0 Other: 93)
+Tight        : Yes
+Variables    : 510      (Eliminated:    0 Frozen:   66)
+Constraints  : 1564     (Binary:  83.0% Ternary:  11.6% Other:   5.4%)
+
+Memory Peak  : 50MB
+Max. Length  : 5 steps
+Sol. Length  : 5 steps
+Models       : 2
+
+