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

gc-ta1-tt1/ipc-2011_no-mystery-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/no-mystery-sequential-satisficing/domain.pddl
+- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-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: no-mystery-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_no-mystery-sequential-satisficing_2.err

@@ -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': 'no-mystery-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/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-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
+/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/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-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 6.51 MEM 33472 MAXMEM 140512 STALE 1 MAXMEM_RSS 84500
+<time name="ALL">6440</time>
+

gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_2.out

@@ -0,0 +1,149 @@
+INFO     Running translator.
+INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-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/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-2.pddl
+Parsing...
+Parsing: [0.340s CPU, 0.333s wall-clock]
+Normalizing task... [0.000s CPU, 0.006s wall-clock]
+Instantiating...
+Generating Datalog program... [0.070s CPU, 0.070s wall-clock]
+Normalizing Datalog program...
+Normalizing Datalog program: [0.010s CPU, 0.015s wall-clock]
+Preparing model... [0.460s CPU, 0.460s wall-clock]
+Generated 23 rules.
+Computing model... [1.290s CPU, 1.285s wall-clock]
+7333 relevant atoms
+12880 auxiliary atoms
+20213 final queue length
+23431 total queue pushes
+Completing instantiation... [0.690s CPU, 0.690s wall-clock]
+Instantiating: [2.540s CPU, 2.541s wall-clock]
+Computing fact groups...
+Finding invariants...
+9 initial candidates
+Finding invariants: [0.030s CPU, 0.026s wall-clock]
+Checking invariant weight... [0.010s CPU, 0.017s wall-clock]
+Instantiating groups... [0.030s CPU, 0.024s wall-clock]
+Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
+Choosing groups...
+0 uncovered facts
+Choosing groups: [0.010s CPU, 0.003s wall-clock]
+Building translation key... [0.000s CPU, 0.002s wall-clock]
+Computing fact groups: [0.080s CPU, 0.081s 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.010s CPU, 0.001s wall-clock]
+Translating task...
+Processing axioms...
+Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
+Processing axioms: [0.020s CPU, 0.025s wall-clock]
+Translating task: [0.460s CPU, 0.468s wall-clock]
+0 effect conditions simplified
+0 implied preconditions added
+Detecting unreachable propositions...
+0 operators removed
+0 axioms removed
+9 propositions removed
+Detecting unreachable propositions: [0.230s CPU, 0.232s wall-clock]
+Reordering and filtering variables...
+9 of 9 variables necessary.
+0 of 9 mutex groups necessary.
+1732 of 1732 operators necessary.
+0 of 0 axiom rules necessary.
+Reordering and filtering variables: [0.070s CPU, 0.069s wall-clock]
+Translator variables: 9
+Translator derived variables: 0
+Translator facts: 157
+Translator goal facts: 7
+Translator mutex groups: 0
+Translator total mutex groups size: 0
+Translator operators: 1732
+Translator axioms: 0
+Translator task size: 8735
+Translator peak memory: 46700 KB
+Writing output... [0.160s CPU, 0.173s wall-clock]
+Done! [3.920s CPU, 3.930s wall-clock]
+planner.py version 0.0.1
+
+Time:	 0.39s
+Memory: 74MB
+
+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:		 74MB (+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: 74MB
+Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
+Grounding Time:	 0.10s
+Memory:		 74MB (+0MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.01s
+Memory:		 75MB (+1MB)
+UNSAT
+Iteration Time:	 0.15s
+
+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: 76.0MB
+Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
+Grounding Time:	 0.12s
+Memory:		 80MB (+5MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.01s
+Memory:		 84MB (+4MB)
+SAT
+Testing...
+SERIALIZABLE
+Testing Time:	 0.30s
+Memory:		 84MB (+0MB)
+Answer: 1
+occurs(action(("load","p5","t0","l5")),1) occurs(action(("drive","t0","l5","l4","level87","level12","level99")),1) occurs(action(("load","p2","t0","l4")),2) occurs(action(("drive","t0","l4","l3","level79","level8","level87")),2) occurs(action(("load","p6","t0","l4")),2) occurs(action(("load","p0","t0","l3")),3) occurs(action(("load","p1","t0","l3")),3) occurs(action(("drive","t0","l3","l0","level61","level18","level79")),3) occurs(action(("unload","p2","t0","l0")),4) occurs(action(("unload","p5","t0","l0")),4) occurs(action(("unload","p6","t0","l0")),4) occurs(action(("load","p4","t0","l0")),4) occurs(action(("drive","t0","l0","l3","level43","level18","level61")),4) occurs(action(("unload","p4","t0","l3")),5) occurs(action(("drive","t0","l3","l1","level31","level12","level43")),5) occurs(action(("drive","t0","l1","l2","level28","level3","level31")),6) occurs(action(("unload","p0","t0","l2")),7) occurs(action(("unload","p1","t0","l2")),7) occurs(action(("load","p3","t0","l2")),7) occurs(action(("drive","t0","l2","l5","level15","level13","level28")),7) occurs(action(("drive","t0","l5","l0","level9","level6","level15")),8) occurs(action(("unload","p3","t0","l0")),9) occurs(action(("drive","t0","l0","l5","level3","level6","level9")),10)
+SATISFIABLE
+
+Models       : 1+
+Calls        : 3
+Time         : 0.744s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
+CPU Time     : 0.724s
+
+Choices      : 45       (Domain: 45)
+Conflicts    : 10       (Analyzed: 9)
+Restarts     : 0       
+Model-Level  : 41.0    
+Problems     : 3        (Average Length: 7.00 Splits: 0)
+Lemmas       : 9        (Deleted: 0)
+  Binary     : 1        (Ratio:  11.11%)
+  Ternary    : 2        (Ratio:  22.22%)
+  Conflict   : 9        (Average Length:  168.3 Ratio: 100.00%) 
+  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
+  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
+Backjumps    : 9        (Average:  2.78 Max:   9 Sum:     25)
+  Executed   : 6        (Average:  1.78 Max:   3 Sum:     16 Ratio:  64.00%)
+  Bounded    : 3        (Average:  3.00 Max:   7 Sum:      9 Ratio:  36.00%)
+
+Rules        : 28097   
+Atoms        : 28097   
+Bodies       : 1        (Original: 0)
+Tight        : Yes
+Variables    : 18231    (Eliminated:    0 Frozen: 1421)
+Constraints  : 95290    (Binary:  97.9% Ternary:   1.1% Other:   1.0%)
+
+Memory Peak  : 100MB
+Max. Length  : 10 steps
+Sol. Length  : 10 steps
+Models       : 1
+
+