Add benchmark result [fd-pb-e0-sh | ipc-2002 | depots-strips-automatic | 13]

2017-11-24 10:12:33 +01:00
parent 626f90d635
commit 8bae18dbd6
3 changed files with 200 additions and 0 deletions
--- a/fd-pb-e0-sh/ipc-2002_depots-strips-automatic_13.out
+++ b/fd-pb-e0-sh/ipc-2002_depots-strips-automatic_13.out
@@ -0,0 +1,142 @@
+INFO     Running translator.
+INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-13.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-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-13.pddl
+Parsing...
+Parsing: [0.010s CPU, 0.015s wall-clock]
+Normalizing task... [0.000s CPU, 0.001s wall-clock]
+Instantiating...
+Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
+Normalizing Datalog program...
+Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
+Preparing model... [0.020s CPU, 0.013s wall-clock]
+Generated 43 rules.
+Computing model... [0.190s CPU, 0.189s wall-clock]
+1435 relevant atoms
+1320 auxiliary atoms
+2755 final queue length
+5115 total queue pushes
+Completing instantiation... [0.370s CPU, 0.374s wall-clock]
+Instantiating: [0.600s CPU, 0.602s wall-clock]
+Computing fact groups...
+Finding invariants...
+16 initial candidates
+Finding invariants: [0.040s CPU, 0.040s wall-clock]
+Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
+Instantiating groups... [0.050s CPU, 0.050s wall-clock]
+Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
+Choosing groups...
+38 uncovered facts
+Choosing groups: [0.010s CPU, 0.008s wall-clock]
+Building translation key... [0.000s CPU, 0.003s wall-clock]
+Computing fact groups: [0.120s CPU, 0.119s wall-clock]
+Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
+Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
+Building mutex information...
+Building mutex information: [0.000s CPU, 0.005s wall-clock]
+Translating task...
+Processing axioms...
+Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
+Processing axioms: [0.020s CPU, 0.020s wall-clock]
+Translating task: [0.430s CPU, 0.427s wall-clock]
+1392 effect conditions simplified
+0 implied preconditions added
+Detecting unreachable propositions...
+0 operators removed
+0 axioms removed
+46 propositions removed
+Detecting unreachable propositions: [0.240s CPU, 0.239s wall-clock]
+Reordering and filtering variables...
+36 of 36 variables necessary.
+28 of 36 mutex groups necessary.
+984 of 984 operators necessary.
+0 of 0 axiom rules necessary.
+Reordering and filtering variables: [0.100s CPU, 0.105s wall-clock]
+Translator variables: 36
+Translator derived variables: 0
+Translator facts: 236
+Translator goal facts: 6
+Translator mutex groups: 28
+Translator total mutex groups size: 280
+Translator operators: 984
+Translator axioms: 0
+Translator task size: 9030
+Translator peak memory: 38744 KB
+Writing output... [0.140s CPU, 0.148s wall-clock]
+Done! [1.670s CPU, 1.684s wall-clock]
+planner.py version 0.0.1
+
+Time:	 0.32s
+Memory: 67MB
+
+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:		 67MB (+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
+Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
+Grounding Time:	 0.11s
+Memory:		 67MB (+0MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.01s
+Memory:		 68MB (+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
+Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
+Grounding Time:	 0.13s
+Memory:		 74MB (+6MB)
+Unblocking actions...
+Solving...
+Answer: 1
+occurs(action(("lift","hoist3","crate4","pallet3","distributor0")),1) occurs(action(("drive","truck1","depot0","distributor2")),1) occurs(action(("lift","hoist2","crate5","crate1","depot2")),1) occurs(action(("drive","truck0","distributor1","depot2")),1) occurs(action(("lift","hoist0","crate2","pallet0","depot0")),2) occurs(action(("load","hoist2","crate5","truck0","depot2")),2) occurs(action(("drive","truck0","depot2","depot1")),2) occurs(action(("drive","truck1","distributor2","depot0")),2) occurs(action(("unload","hoist1","crate5","truck0","depot1")),3) occurs(action(("load","hoist0","crate2","truck1","depot0")),3) occurs(action(("drive","truck1","depot0","distributor1")),3) occurs(action(("lift","hoist2","crate1","crate0","depot2")),3) occurs(action(("drop","hoist3","crate4","pallet3","distributor0")),3) occurs(action(("drive","truck0","depot1","depot2")),3) occurs(action(("lift","hoist3","crate4","pallet3","distributor0")),4) occurs(action(("lift","hoist0","crate3","pallet8","depot0")),4) occurs(action(("unload","hoist4","crate2","truck1","distributor1")),4) occurs(action(("load","hoist2","crate1","truck0","depot2")),4) occurs(action(("drive","truck1","distributor1","distributor2")),4) occurs(action(("drive","truck0","depot2","distributor1")),4) occurs(action(("drop","hoist1","crate5","pallet1","depot1")),5) occurs(action(("drop","hoist3","crate4","pallet9","distributor0")),5) occurs(action(("drop","hoist4","crate2","pallet4","distributor1")),5) occurs(action(("drive","truck1","distributor2","depot2")),5) occurs(action(("lift","hoist2","crate0","pallet2","depot2")),5) occurs(action(("drop","hoist0","crate3","pallet7","depot0")),6) occurs(action(("lift","hoist3","crate4","pallet9","distributor0")),6) occurs(action(("drive","truck1","depot2","distributor0")),6) occurs(action(("drive","truck0","distributor1","distributor2")),6) occurs(action(("load","hoist2","crate0","truck1","depot2")),6) occurs(action(("lift","hoist1","crate5","pallet1","depot1")),7) occurs(action(("lift","hoist4","crate2","pallet4","distributor1")),7) occurs(action(("unload","hoist5","crate1","truck0","distributor2")),7) occurs(action(("load","hoist3","crate4","truck1","distributor0")),7) occurs(action(("drive","truck1","distributor0","depot0")),7) occurs(action(("drive","truck0","distributor2","distributor1")),7) occurs(action(("unload","hoist0","crate0","truck1","depot0")),8) occurs(action(("drive","truck1","depot0","distributor0")),8) occurs(action(("load","hoist4","crate2","truck0","distributor1")),8) occurs(action(("drop","hoist1","crate5","pallet1","depot1")),9) occurs(action(("drop","hoist5","crate1","pallet5","distributor2")),9) occurs(action(("drop","hoist0","crate0","pallet0","depot0")),9) occurs(action(("unload","hoist3","crate4","truck1","distributor0")),9) occurs(action(("unload","hoist4","crate2","truck0","distributor1")),9) occurs(action(("drive","truck0","distributor1","distributor2")),9) occurs(action(("drive","truck1","distributor0","depot2")),9) occurs(action(("drop","hoist3","crate4","pallet9","distributor0")),10) occurs(action(("drop","hoist4","crate2","pallet4","distributor1")),10) occurs(action(("drive","truck0","distributor2","depot0")),10) occurs(action(("drive","truck1","depot2","depot0")),10)
+Solving Time:	 0.02s
+Memory:		 77MB (+3MB)
+SAT
+SATISFIABLE
+
+Models       : 1+
+Calls        : 3
+Time         : 0.698s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
+CPU Time     : 0.670s
+
+Choices      : 1249    
+Conflicts    : 209      (Analyzed: 209)
+Restarts     : 2        (Average: 104.50 Last: 76)
+Model-Level  : 105.0   
+Problems     : 3        (Average Length: 7.00 Splits: 0)
+Lemmas       : 209      (Deleted: 0)
+  Binary     : 30       (Ratio:  14.35%)
+  Ternary    : 14       (Ratio:   6.70%)
+  Conflict   : 209      (Average Length:   42.5 Ratio: 100.00%) 
+  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
+  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
+Backjumps    : 209      (Average:  6.89 Max:  75 Sum:   1441)
+  Executed   : 177      (Average:  5.53 Max:  75 Sum:   1156 Ratio:  80.22%)
+  Bounded    : 32       (Average:  8.91 Max:  12 Sum:    285 Ratio:  19.78%)
+
+Rules        : 26727   
+Atoms        : 26727   
+Bodies       : 1        (Original: 0)
+Tight        : Yes
+Variables    : 13068    (Eliminated:    0 Frozen: 1936)
+Constraints  : 84706    (Binary:  96.1% Ternary:   2.0% Other:   1.9%)
+
+Memory Peak  : 77MB
+Max. Length  : 10 steps
+Sol. Length  : 10 steps
+
+