Add benchmark result [gc-ta1-tt1 | ipc-2011 | parking-sequential-satisficing | 2]

gc-ta1-tt1/ipc-2011_parking-sequential-satisficing_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-2011/domains/parking-sequential-satisficing/domain.pddl
+- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-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: parking-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
+

gc-ta1-tt1/ipc-2011_parking-sequential-satisficing_2.err

@@ -0,0 +1,8 @@
+# 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': 'parking-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/parking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-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
+TIMEOUT CPU 900.05 MEM 1903836 MAXMEM 1903836 STALE 0 MAXMEM_RSS 1812976
+<time name="ALL">900020</time>
+

gc-ta1-tt1/ipc-2011_parking-sequential-satisficing_2.out

@@ -0,0 +1,69 @@
+INFO     Running translator.
+INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-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/parking-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-2.pddl
+Parsing...
+Parsing: [0.020s CPU, 0.015s wall-clock]
+Normalizing task... [0.000s CPU, 0.001s wall-clock]
+Instantiating...
+Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
+Normalizing Datalog program...
+Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
+Preparing model... [0.010s CPU, 0.011s wall-clock]
+Generated 32 rules.
+Computing model... [2.420s CPU, 2.417s wall-clock]
+26339 relevant atoms
+3192 auxiliary atoms
+29531 final queue length
+85444 total queue pushes
+Completing instantiation... [9.370s CPU, 9.363s wall-clock]
+Instantiating: [11.830s CPU, 11.835s wall-clock]
+Computing fact groups...
+Finding invariants...
+12 initial candidates
+Finding invariants: [0.050s CPU, 0.047s wall-clock]
+Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
+Instantiating groups... [0.040s CPU, 0.043s wall-clock]
+Collecting mutex groups... [0.010s CPU, 0.006s wall-clock]
+Choosing groups...
+56 uncovered facts
+Choosing groups: [0.030s CPU, 0.029s wall-clock]
+Building translation key... [0.020s CPU, 0.011s wall-clock]
+Computing fact groups: [0.200s CPU, 0.189s wall-clock]
+Building STRIPS to SAS dictionary... [0.000s CPU, 0.005s wall-clock]
+Building dictionary for full mutex groups... [0.010s CPU, 0.010s wall-clock]
+Building mutex information...
+Building mutex information: [0.010s CPU, 0.017s wall-clock]
+Translating task...
+Processing axioms...
+Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
+Processing axioms: [0.490s CPU, 0.481s wall-clock]
+Translating task: [10.400s CPU, 10.398s wall-clock]
+29766 effect conditions simplified
+0 implied preconditions added
+Detecting unreachable propositions...
+0 operators removed
+0 axioms removed
+22 propositions removed
+Detecting unreachable propositions: [5.260s CPU, 5.251s wall-clock]
+Reordering and filtering variables...
+78 of 78 variables necessary.
+34 of 56 mutex groups necessary.
+23958 of 23958 operators necessary.
+0 of 0 axiom rules necessary.
+Reordering and filtering variables: [2.090s CPU, 2.094s wall-clock]
+Translator variables: 78
+Translator derived variables: 0
+Translator facts: 860
+Translator goal facts: 22
+Translator mutex groups: 34
+Translator total mutex groups size: 782
+Translator operators: 23958
+Translator axioms: 0
+Translator task size: 195584
+Translator peak memory: 152044 KB
+Writing output... [3.460s CPU, 3.719s wall-clock]
+Done! [33.670s CPU, 33.921s wall-clock]
+