Add benchmark result [gc-ta5-tt1 | ipc-1998 | mystery-round-1-strips | 13]

gc-ta5-tt1/ipc-1998_mystery-round-1-strips_13.out

@@ -0,0 +1,170 @@
+INFO     Running translator.
+INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-13.pddl
+Parsing...
+Parsing: [0.030s CPU, 0.031s wall-clock]
+Normalizing task... [0.000s CPU, 0.001s wall-clock]
+Instantiating...
+Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
+Normalizing Datalog program...
+Normalizing Datalog program: [0.020s CPU, 0.029s wall-clock]
+Preparing model... [0.030s CPU, 0.031s wall-clock]
+Generated 42 rules.
+Computing model... [2.210s CPU, 2.207s wall-clock]
+19584 relevant atoms
+7514 auxiliary atoms
+27098 final queue length
+61437 total queue pushes
+Completing instantiation... [7.730s CPU, 7.723s wall-clock]
+Instantiating: [10.020s CPU, 10.027s wall-clock]
+Computing fact groups...
+Finding invariants...
+12 initial candidates
+Finding invariants: [0.130s CPU, 0.131s wall-clock]
+Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
+Instantiating groups... [0.150s CPU, 0.146s wall-clock]
+Collecting mutex groups... [0.010s CPU, 0.009s wall-clock]
+Choosing groups...
+6 uncovered facts
+Choosing groups: [0.030s CPU, 0.029s wall-clock]
+Building translation key... [0.020s CPU, 0.017s wall-clock]
+Computing fact groups: [0.410s CPU, 0.411s wall-clock]
+Building STRIPS to SAS dictionary... [0.010s CPU, 0.011s wall-clock]
+Building dictionary for full mutex groups... [0.010s CPU, 0.006s wall-clock]
+Building mutex information...
+Building mutex information: [0.000s CPU, 0.009s wall-clock]
+Translating task...
+Processing axioms...
+Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
+Processing axioms: [0.300s CPU, 0.298s wall-clock]
+Translating task: [5.550s CPU, 5.548s wall-clock]
+0 effect conditions simplified
+0 implied preconditions added
+Detecting unreachable propositions...
+0 operators removed
+0 axioms removed
+88 propositions removed
+Detecting unreachable propositions: [2.860s CPU, 2.857s wall-clock]
+Reordering and filtering variables...
+76 of 76 variables necessary.
+0 of 76 mutex groups necessary.
+17845 of 17845 operators necessary.
+0 of 0 axiom rules necessary.
+Reordering and filtering variables: [0.850s CPU, 0.853s wall-clock]
+Translator variables: 76
+Translator derived variables: 0
+Translator facts: 1427
+Translator goal facts: 2
+Translator mutex groups: 0
+Translator total mutex groups size: 0
+Translator operators: 17845
+Translator axioms: 0
+Translator task size: 108118
+Translator peak memory: 107160 KB
+Writing output... [1.850s CPU, 2.017s wall-clock]
+Done! [21.840s CPU, 22.011s wall-clock]
+planner.py version 0.0.1
+
+Time:	 4.79s
+Memory: 358MB
+
+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.02s
+Memory:		 358MB (+0MB)
+UNSAT
+Iteration Time:	 0.02s
+
+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:	 1.63s
+Memory:		 358MB (+0MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.29s
+Memory:		 375MB (+17MB)
+UNSAT
+Iteration Time:	 2.86s
+
+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:	 1.44s
+Memory:		 382MB (+7MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.16s
+Memory:		 438MB (+56MB)
+SAT
+Testing...
+NOT SERIALIZABLE
+Testing Time:	 4.05s
+Memory:		 628MB (+190MB)
+Solving...
+Solving Time:	 1.80s
+Memory:		 628MB (+0MB)
+UNSAT
+Iteration Time:	 8.28s
+
+Iteration 4
+Queue:		 [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
+Grounded Until:	 10
+Grounding...	 [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
+Grounding Time:	 1.65s
+Memory:		 628MB (+0MB)
+Unblocking actions...
+Solving...
+Solving Time:	 0.14s
+Memory:		 626MB (+-2MB)
+SAT
+Testing...
+SERIALIZABLE?
+Testing Time:	 0.00s
+Memory:		 626MB (+0MB)
+Answer: 2
+occurs(action(("feast","aesthetics","hamburger","scallion","alsace","bavaria")),1) occurs(action(("feast","aesthetics","scallion","flounder","oregon","alsace")),2) occurs(action(("feast","aesthetics","flounder","lemon","bavaria","quebec")),3) occurs(action(("overcome","laceration-20","aesthetics","lemon","mars","neptune")),4) occurs(action(("feast","aesthetics","lemon","onion","bavaria","quebec")),5) occurs(action(("feast","aesthetics","onion","turkey","oregon","alsace")),6) occurs(action(("feast","aesthetics","turkey","potato","alsace","bavaria")),7) occurs(action(("feast","aesthetics","potato","muffin","oregon","alsace")),8) occurs(action(("feast","aesthetics","muffin","ham","alsace","bavaria")),9) occurs(action(("succumb","laceration-20","aesthetics","ham","mars","neptune")),10) occurs(action(("feast","love","baguette","lemon","alsace","bavaria")),11) occurs(action(("overcome","prostatitis-18","love","lemon","vulcan","venus")),12) occurs(action(("feast","love","lemon","baguette","alsace","bavaria")),13) occurs(action(("feast","love","baguette","lobster","oregon","alsace")),14) occurs(action(("succumb","prostatitis-18","love","lobster","vulcan","venus")),15)
+SATISFIABLE
+
+Models       : 1+
+Calls        : 5
+Time         : 14.971s (Solving: 1.91s 1st Model: 0.12s Unsat: 1.76s)
+CPU Time     : 14.808s
+
+Choices      : 4180     (Domain: 4109)
+Conflicts    : 1308     (Analyzed: 1306)
+Restarts     : 12       (Average: 108.83 Last: 83)
+Model-Level  : 117.0   
+Problems     : 5        (Average Length: 10.00 Splits: 0)
+Lemmas       : 1306     (Deleted: 0)
+  Binary     : 99       (Ratio:   7.58%)
+  Ternary    : 37       (Ratio:   2.83%)
+  Conflict   : 1306     (Average Length:  336.3 Ratio: 100.00%) 
+  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
+  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
+Backjumps    : 1306     (Average:  3.08 Max:  62 Sum:   4022)
+  Executed   : 1291     (Average:  2.97 Max:  62 Sum:   3874 Ratio:  96.32%)
+  Bounded    : 15       (Average:  9.87 Max:  12 Sum:    148 Ratio:   3.68%)
+
+Rules        : 326410  
+Atoms        : 326400  
+Bodies       : 21       (Original: 20)
+  Count      : 10      
+Equivalences : 30       (Atom=Atom: 10 Body=Body: 0 Other: 20)
+Tight        : Yes
+Variables    : 289050   (Eliminated:    0 Frozen: 209298)
+Constraints  : 1745722  (Binary:  98.1% Ternary:   0.9% Other:   1.0%)
+
+Memory Peak  : 628MB
+Max. Length  : 15 steps
+Sol. Length  : 15 steps
+Models       : 2
+
+