clear folders

Author: zbmsnj1

.gitignore

@@ -1,3 +1,4 @@
 
 *.pyc
 *.dirlock
+*.lock

results/PRP/output/acrobatics_p01.txt

@@ -6,28 +6,28 @@ Normalizing task... [0.000s CPU, 0.000s wall-clock]
 Instantiating...
 Generating Datalog program... [0.000s CPU, 0.000s wall-clock]
 Normalizing Datalog program...
-Normalizing Datalog program: [0.010s CPU, 0.008s wall-clock]
-Preparing model... [0.000s CPU, 0.002s wall-clock]
+Normalizing Datalog program: [0.000s CPU, 0.009s wall-clock]
+Preparing model... [0.010s CPU, 0.002s wall-clock]
 Generated 67 rules.
-Computing model... [0.000s CPU, 0.001s wall-clock]
+Computing model... [0.010s CPU, 0.001s wall-clock]
 19 relevant atoms
 46 auxiliary atoms
 65 final queue length
 68 total queue pushes
 Completing instantiation... [0.000s CPU, 0.001s wall-clock]
-Instantiating: [0.010s CPU, 0.013s wall-clock]
+Instantiating: [0.020s CPU, 0.013s wall-clock]
 Computing fact groups...
 Finding invariants...
 4 initial candidates
-Finding invariants: [0.010s CPU, 0.004s wall-clock]
+Finding invariants: [0.000s CPU, 0.005s wall-clock]
 Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
 Instantiating groups... [0.000s CPU, 0.000s wall-clock]
 Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
 Choosing groups...
 1 uncovered facts
 Choosing groups: [0.000s CPU, 0.000s wall-clock]
 Building translation key... [0.000s CPU, 0.000s wall-clock]
-Computing fact groups: [0.010s CPU, 0.005s wall-clock]
+Computing fact groups: [0.000s CPU, 0.005s wall-clock]
 Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
 Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
 Building mutex information...
@@ -53,7 +53,7 @@ Translator total mutex groups size: 2
 Translator operators: 6
 Translator axioms: 0
 Translator task size: 34
-Translator peak memory: 19088 KB
+Translator peak memory: 19092 KB
 Writing output... [0.000s CPU, 0.001s wall-clock]
 Done! [0.020s CPU, 0.024s wall-clock]
 
@@ -149,11 +149,11 @@ Running the simulation...
          Engine Initialization: 0s
                    Search Time: 0s
            Policy Construction: 0s
- Evaluating the policy quality: 0s
-              Using the policy: 0s
-          Just-in-case Repairs: 0s
+ Evaluating the policy quality: 0.02s
+              Using the policy: 0.02s
+          Just-in-case Repairs: 0.02s
                 Simulator time: 0s
-                    Total time: 0s
+                    Total time: 0.02s
 
 
 

results/PRP/output/acrobatics_p02.txt

@@ -1,49 +1,49 @@
 1. Running translator
 Second argument is a file name: use two translator arguments.
 Parsing...
-Parsing: [0.000s CPU, 0.004s wall-clock]
-Normalizing task... [0.000s CPU, 0.001s wall-clock]
+Parsing: [0.000s CPU, 0.006s wall-clock]
+Normalizing task... [0.000s CPU, 0.000s wall-clock]
 Instantiating...
-Generating Datalog program... [0.010s CPU, 0.001s wall-clock]
+Generating Datalog program... [0.000s CPU, 0.001s wall-clock]
 Normalizing Datalog program...
-Normalizing Datalog program: [0.000s CPU, 0.017s wall-clock]
-Preparing model... [0.010s CPU, 0.003s wall-clock]
+Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
+Preparing model... [0.010s CPU, 0.002s wall-clock]
 Generated 67 rules.
-Computing model... [0.000s CPU, 0.005s wall-clock]
+Computing model... [0.000s CPU, 0.004s wall-clock]
 52 relevant atoms
 128 auxiliary atoms
 180 final queue length
 204 total queue pushes
-Completing instantiation... [0.000s CPU, 0.002s wall-clock]
+Completing instantiation... [0.000s CPU, 0.003s wall-clock]
 Instantiating: [0.020s CPU, 0.028s wall-clock]
 Computing fact groups...
 Finding invariants...
 4 initial candidates
-Finding invariants: [0.010s CPU, 0.004s wall-clock]
+Finding invariants: [0.010s CPU, 0.003s wall-clock]
 Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
 Instantiating groups... [0.000s CPU, 0.000s wall-clock]
 Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
 Choosing groups...
 2 uncovered facts
 Choosing groups: [0.000s CPU, 0.000s wall-clock]
 Building translation key... [0.000s CPU, 0.000s wall-clock]
-Computing fact groups: [0.010s CPU, 0.005s wall-clock]
+Computing fact groups: [0.010s CPU, 0.004s wall-clock]
 Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
 Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
 Building mutex information...
 Building mutex information: [0.000s CPU, 0.000s wall-clock]
 Translating task...
 Processing axioms...
 Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
-Processing axioms: [0.000s CPU, 0.001s wall-clock]
-Translating task: [0.000s CPU, 0.004s wall-clock]
+Processing axioms: [0.000s CPU, 0.000s wall-clock]
+Translating task: [0.000s CPU, 0.003s wall-clock]
 14 effect conditions simplified
 0 implied preconditions added
 Detecting unreachable propositions...
 Removed false proposition: 1 = <none of those>
 0 operators removed
 1 propositions removed
-Detecting unreachable propositions: [0.000s CPU, 0.001s wall-clock]
+Detecting unreachable propositions: [0.000s CPU, 0.000s wall-clock]
 Translator variables: 3
 Translator derived variables: 0
 Translator facts: 8
@@ -53,9 +53,9 @@ Translator total mutex groups size: 4
 Translator operators: 26
 Translator axioms: 0
 Translator task size: 163
-Translator peak memory: 19124 KB
-Writing output... [0.000s CPU, 0.002s wall-clock]
-Done! [0.030s CPU, 0.045s wall-clock]
+Translator peak memory: 19228 KB
+Writing output... [0.000s CPU, 0.001s wall-clock]
+Done! [0.030s CPU, 0.043s wall-clock]
 
 2. Running preprocessor
 Building causal graph...
@@ -96,7 +96,7 @@ walk-on-beam_DETDUP_0 p2 p3 (1)
 Plan length: 3 step(s).
 Plan cost: 3
 Initial search time: 0s
-Initial total time: 0.02s
+Initial total time: 0s
 
 
 Creating the simulator...
@@ -160,11 +160,11 @@ Running the simulation...
          Engine Initialization: 0s
                    Search Time: 0s
            Policy Construction: 0s
- Evaluating the policy quality: 15.28s
-              Using the policy: 7.38s
-          Just-in-case Repairs: 15.28s
+ Evaluating the policy quality: 15.64s
+              Using the policy: 7.46s
+          Just-in-case Repairs: 15.64s
                 Simulator time: 0s
-                    Total time: 15.3s
+                    Total time: 15.64s
 
 
 

results/PRP/output/acrobatics_p03.txt

@@ -1,42 +1,42 @@
 1. Running translator
 Second argument is a file name: use two translator arguments.
 Parsing...
-Parsing: [0.010s CPU, 0.003s wall-clock]
+Parsing: [0.000s CPU, 0.004s wall-clock]
 Normalizing task... [0.000s CPU, 0.000s wall-clock]
 Instantiating...
 Generating Datalog program... [0.000s CPU, 0.001s wall-clock]
 Normalizing Datalog program...
-Normalizing Datalog program: [0.010s CPU, 0.019s wall-clock]
-Preparing model... [0.000s CPU, 0.003s wall-clock]
+Normalizing Datalog program: [0.020s CPU, 0.013s wall-clock]
+Preparing model... [0.000s CPU, 0.002s wall-clock]
 Generated 67 rules.
-Computing model... [0.030s CPU, 0.027s wall-clock]
+Computing model... [0.010s CPU, 0.011s wall-clock]
 116 relevant atoms
 292 auxiliary atoms
 408 final queue length
 476 total queue pushes
-Completing instantiation... [0.000s CPU, 0.011s wall-clock]
-Instantiating: [0.040s CPU, 0.062s wall-clock]
+Completing instantiation... [0.000s CPU, 0.006s wall-clock]
+Instantiating: [0.030s CPU, 0.034s wall-clock]
 Computing fact groups...
 Finding invariants...
 4 initial candidates
-Finding invariants: [0.010s CPU, 0.003s wall-clock]
+Finding invariants: [0.010s CPU, 0.005s wall-clock]
 Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
 Instantiating groups... [0.000s CPU, 0.000s wall-clock]
 Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
 Choosing groups...
 2 uncovered facts
 Choosing groups: [0.000s CPU, 0.000s wall-clock]
 Building translation key... [0.000s CPU, 0.000s wall-clock]
-Computing fact groups: [0.010s CPU, 0.004s wall-clock]
+Computing fact groups: [0.010s CPU, 0.006s wall-clock]
 Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
 Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
 Building mutex information...
 Building mutex information: [0.000s CPU, 0.000s wall-clock]
 Translating task...
 Processing axioms...
 Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
-Processing axioms: [0.000s CPU, 0.000s wall-clock]
-Translating task: [0.000s CPU, 0.007s wall-clock]
+Processing axioms: [0.000s CPU, 0.001s wall-clock]
+Translating task: [0.010s CPU, 0.007s wall-clock]
 38 effect conditions simplified
 0 implied preconditions added
 Detecting unreachable propositions...
@@ -54,8 +54,8 @@ Translator operators: 66
 Translator axioms: 0
 Translator task size: 403
 Translator peak memory: 19224 KB
-Writing output... [0.010s CPU, 0.001s wall-clock]
-Done! [0.070s CPU, 0.081s wall-clock]
+Writing output... [0.000s CPU, 0.001s wall-clock]
+Done! [0.050s CPU, 0.054s wall-clock]
 
 2. Running preprocessor
 Building causal graph...
@@ -162,11 +162,11 @@ Running the simulation...
          Engine Initialization: 0s
                    Search Time: 0s
            Policy Construction: 0s
- Evaluating the policy quality: 17.14s
-              Using the policy: 8.4s
-          Just-in-case Repairs: 17.14s
+ Evaluating the policy quality: 16.82s
+              Using the policy: 8.66s
+          Just-in-case Repairs: 16.82s
                 Simulator time: 0s
-                    Total time: 17.14s
+                    Total time: 16.82s
 
 
 

results/PRP/output/acrobatics_p04.txt

@@ -1,21 +1,21 @@
 1. Running translator
 Second argument is a file name: use two translator arguments.
 Parsing...
-Parsing: [0.000s CPU, 0.003s wall-clock]
-Normalizing task... [0.000s CPU, 0.001s wall-clock]
+Parsing: [0.010s CPU, 0.004s wall-clock]
+Normalizing task... [0.000s CPU, 0.000s wall-clock]
 Instantiating...
 Generating Datalog program... [0.000s CPU, 0.001s wall-clock]
 Normalizing Datalog program...
-Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock]
+Normalizing Datalog program: [0.000s CPU, 0.008s wall-clock]
 Preparing model... [0.000s CPU, 0.003s wall-clock]
 Generated 67 rules.
-Computing model... [0.030s CPU, 0.021s wall-clock]
+Computing model... [0.020s CPU, 0.019s wall-clock]
 244 relevant atoms
 620 auxiliary atoms
 864 final queue length
 1020 total queue pushes
-Completing instantiation... [0.010s CPU, 0.010s wall-clock]
-Instantiating: [0.050s CPU, 0.044s wall-clock]
+Completing instantiation... [0.020s CPU, 0.015s wall-clock]
+Instantiating: [0.040s CPU, 0.047s wall-clock]
 Computing fact groups...
 Finding invariants...
 4 initial candidates
@@ -27,7 +27,7 @@ Choosing groups...
 2 uncovered facts
 Choosing groups: [0.000s CPU, 0.000s wall-clock]
 Building translation key... [0.000s CPU, 0.000s wall-clock]
-Computing fact groups: [0.000s CPU, 0.005s wall-clock]
+Computing fact groups: [0.010s CPU, 0.006s wall-clock]
 Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
 Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
 Building mutex information...
@@ -36,14 +36,14 @@ Translating task...
 Processing axioms...
 Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
 Processing axioms: [0.000s CPU, 0.001s wall-clock]
-Translating task: [0.020s CPU, 0.015s wall-clock]
+Translating task: [0.010s CPU, 0.015s wall-clock]
 86 effect conditions simplified
 0 implied preconditions added
 Detecting unreachable propositions...
 Removed false proposition: 1 = <none of those>
 0 operators removed
 1 propositions removed
-Detecting unreachable propositions: [0.000s CPU, 0.001s wall-clock]
+Detecting unreachable propositions: [0.000s CPU, 0.002s wall-clock]
 Translator variables: 3
 Translator derived variables: 0
 Translator facts: 20
@@ -53,9 +53,9 @@ Translator total mutex groups size: 16
 Translator operators: 146
 Translator axioms: 0
 Translator task size: 883
-Translator peak memory: 19752 KB
-Writing output... [0.000s CPU, 0.002s wall-clock]
-Done! [0.070s CPU, 0.073s wall-clock]
+Translator peak memory: 19744 KB
+Writing output... [0.010s CPU, 0.004s wall-clock]
+Done! [0.080s CPU, 0.078s wall-clock]
 
 2. Running preprocessor
 Building causal graph...
@@ -165,11 +165,11 @@ Running the simulation...
          Engine Initialization: 0s
                    Search Time: 0s
            Policy Construction: 0s
- Evaluating the policy quality: 18.46s
-              Using the policy: 9.28s
-          Just-in-case Repairs: 18.46s
+ Evaluating the policy quality: 18.02s
+              Using the policy: 8.84s
+          Just-in-case Repairs: 18.02s
                 Simulator time: 0s
-                    Total time: 18.46s
+                    Total time: 18.02s