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

gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_3.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-3.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: 3
+  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_3.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': 3}
+# 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-3.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-3.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 15.00 MEM 33472 MAXMEM 202864 STALE 1 MAXMEM_RSS 146536
+<time name="ALL">14860</time>
+

gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_3.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-3.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-3.pddl
+Parsing...
+Parsing: [0.880s CPU, 0.874s wall-clock]
+Normalizing task... [0.020s CPU, 0.022s wall-clock]
+Instantiating...
+Generating Datalog program... [0.240s CPU, 0.244s wall-clock]
+Normalizing Datalog program...
+Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock]
+Preparing model... [1.670s CPU, 1.674s wall-clock]
+Generated 23 rules.
+Computing model... [3.770s CPU, 3.765s wall-clock]
+21269 relevant atoms
+38868 auxiliary atoms
+60137 final queue length
+67555 total queue pushes
+Completing instantiation... [1.740s CPU, 1.738s wall-clock]
+Instantiating: [7.510s CPU, 7.502s wall-clock]
+Computing fact groups...
+Finding invariants...
+9 initial candidates
+Finding invariants: [0.040s CPU, 0.049s wall-clock]
+Checking invariant weight... [0.060s CPU, 0.055s wall-clock]
+Instantiating groups... [0.050s CPU, 0.048s wall-clock]
+Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
+Choosing groups...
+0 uncovered facts
+Choosing groups: [0.010s CPU, 0.006s wall-clock]
+Building translation key... [0.000s CPU, 0.003s wall-clock]
+Computing fact groups: [0.170s CPU, 0.175s 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.002s wall-clock]
+Translating task...
+Processing axioms...
+Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
+Processing axioms: [0.050s CPU, 0.053s wall-clock]
+Translating task: [1.140s CPU, 1.146s 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.520s CPU, 0.520s wall-clock]
+Reordering and filtering variables...
+10 of 10 variables necessary.
+0 of 10 mutex groups necessary.
+3894 of 3894 operators necessary.
+0 of 0 axiom rules necessary.
+Reordering and filtering variables: [0.160s CPU, 0.156s wall-clock]
+Translator variables: 10
+Translator derived variables: 0
+Translator facts: 252
+Translator goal facts: 8
+Translator mutex groups: 0
+Translator total mutex groups size: 0
+Translator operators: 3894
+Translator axioms: 0
+Translator task size: 19612
+Translator peak memory: 64360 KB
+Writing output... [0.350s CPU, 0.389s wall-clock]
+Done! [10.810s CPU, 10.840s wall-clock]
+planner.py version 0.0.1
+
+Time:	 0.84s
+Memory: 107MB
+
+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:		 107MB (+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: 107MB
+Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
+Grounding Time:	 0.24s
+Memory:		 107MB (+0MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.02s
+Memory:		 110MB (+3MB)
+UNSAT
+Iteration Time:	 0.40s
+
+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: 113.0MB
+Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
+Grounding Time:	 0.28s
+Memory:		 115MB (+5MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.04s
+Memory:		 125MB (+10MB)
+SAT
+Testing...
+SERIALIZABLE
+Testing Time:	 0.68s
+Memory:		 126MB (+1MB)
+Answer: 1
+occurs(action(("drive","t0","l2","l3","level164","level16","level180")),1) occurs(action(("drive","t0","l3","l0","level146","level18","level164")),2) occurs(action(("load","p3","t0","l0")),3) occurs(action(("drive","t0","l0","l1","level134","level12","level146")),3) occurs(action(("unload","p3","t0","l1")),4) occurs(action(("load","p1","t0","l1")),4) occurs(action(("load","p5","t0","l1")),4) occurs(action(("drive","t0","l1","l4","level121","level13","level134")),4) occurs(action(("load","p7","t0","l1")),4) occurs(action(("unload","p5","t0","l4")),5) occurs(action(("load","p0","t0","l4")),5) occurs(action(("load","p2","t0","l4")),5) occurs(action(("drive","t0","l4","l2","level109","level12","level121")),5) occurs(action(("drive","t0","l2","l7","level91","level18","level109")),6) occurs(action(("unload","p2","t0","l7")),7) occurs(action(("drive","t0","l7","l5","level81","level10","level91")),7) occurs(action(("load","p6","t0","l7")),7) occurs(action(("unload","p1","t0","l5")),8) occurs(action(("drive","t0","l5","l6","level63","level18","level81")),8) occurs(action(("unload","p6","t0","l6")),9) occurs(action(("unload","p7","t0","l6")),9) occurs(action(("load","p4","t0","l6")),9) occurs(action(("drive","t0","l6","l1","level60","level3","level63")),9) occurs(action(("unload","p0","t0","l1")),10) occurs(action(("unload","p4","t0","l1")),10) occurs(action(("drive","t0","l1","l0","level48","level12","level60")),10)
+SATISFIABLE
+
+Models       : 1+
+Calls        : 3
+Time         : 1.765s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.00s)
+CPU Time     : 1.700s
+
+Choices      : 122      (Domain: 119)
+Conflicts    : 52       (Analyzed: 51)
+Restarts     : 0       
+Model-Level  : 41.0    
+Problems     : 3        (Average Length: 7.00 Splits: 0)
+Lemmas       : 51       (Deleted: 0)
+  Binary     : 3        (Ratio:   5.88%)
+  Ternary    : 1        (Ratio:   1.96%)
+  Conflict   : 51       (Average Length:  844.6 Ratio: 100.00%) 
+  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
+  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
+Backjumps    : 51       (Average:  2.10 Max:  19 Sum:    107)
+  Executed   : 48       (Average:  1.82 Max:  19 Sum:     93 Ratio:  86.92%)
+  Bounded    : 3        (Average:  4.67 Max:  12 Sum:     14 Ratio:  13.08%)
+
+Rules        : 62985   
+Atoms        : 62985   
+Bodies       : 1        (Original: 0)
+Tight        : Yes
+Variables    : 38078    (Eliminated:    0 Frozen: 2235)
+Constraints  : 173571   (Binary:  98.4% Ternary:   0.9% Other:   0.7%)
+
+Memory Peak  : 160MB
+Max. Length  : 10 steps
+Sol. Length  : 10 steps
+Models       : 1
+
+