Add benchmark result [gc-ta1-tt1 | ipc-2006 | rovers-propositional | 1]
This commit is contained in:
145
gc-ta1-tt1/ipc-2006_rovers-propositional_1.out
Normal file
145
gc-ta1-tt1/ipc-2006_rovers-propositional_1.out
Normal file
@@ -0,0 +1,145 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/rovers-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/rovers-propositional/instances/instance-1.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-2006/domains/rovers-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/rovers-propositional/instances/instance-1.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.030s wall-clock]
|
||||
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.050s CPU, 0.051s wall-clock]
|
||||
Preparing model... [0.030s CPU, 0.018s wall-clock]
|
||||
Generated 90 rules.
|
||||
Computing model... [0.030s CPU, 0.035s wall-clock]
|
||||
173 relevant atoms
|
||||
269 auxiliary atoms
|
||||
442 final queue length
|
||||
546 total queue pushes
|
||||
Completing instantiation... [0.020s CPU, 0.019s wall-clock]
|
||||
Instantiating: [0.130s CPU, 0.129s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
35 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.029s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
17 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.030s CPU, 0.035s 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.020s CPU, 0.017s wall-clock]
|
||||
16 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
12 propositions removed
|
||||
Detecting unreachable propositions: [0.010s CPU, 0.010s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
13 of 23 variables necessary.
|
||||
0 of 9 mutex groups necessary.
|
||||
42 of 63 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock]
|
||||
Translator variables: 13
|
||||
Translator derived variables: 0
|
||||
Translator facts: 28
|
||||
Translator goal facts: 3
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 42
|
||||
Translator axioms: 0
|
||||
Translator task size: 217
|
||||
Translator peak memory: 36556 KB
|
||||
Writing output... [0.010s CPU, 0.007s wall-clock]
|
||||
Done! [0.240s CPU, 0.238s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.02s
|
||||
Memory: 49MB
|
||||
|
||||
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: 50MB (+1MB)
|
||||
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: 50MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 50MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 50MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.02s
|
||||
Memory: 50MB (+0MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 50MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE?
|
||||
Testing Time: 0.00s
|
||||
Memory: 50MB (+0MB)
|
||||
Answer: 2
|
||||
occurs(action(("sample_rock","rover0","rover0store","waypoint3")),1) occurs(action(("calibrate","rover0","camera0","objective1","waypoint3")),1) occurs(action(("navigate","rover0","waypoint3","waypoint1")),2) occurs(action(("drop","rover0","rover0store")),2) occurs(action(("navigate","rover0","waypoint1","waypoint2")),3) occurs(action(("communicate_rock_data","rover0","general","waypoint3","waypoint2","waypoint0")),4) occurs(action(("sample_soil","rover0","rover0store","waypoint2")),4) occurs(action(("take_image","rover0","waypoint2","objective1","camera0","high_res")),4) occurs(action(("communicate_soil_data","rover0","general","waypoint2","waypoint2","waypoint0")),5) occurs(action(("communicate_image_data","rover0","general","objective1","high_res","waypoint2","waypoint0")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 0.047s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.040s
|
||||
|
||||
Choices : 47 (Domain: 36)
|
||||
Conflicts : 6 (Analyzed: 6)
|
||||
Restarts : 0
|
||||
Model-Level : 22.5
|
||||
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||||
Lemmas : 6 (Deleted: 0)
|
||||
Binary : 4 (Ratio: 66.67%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 6 (Average Length: 3.3 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 6 (Average: 4.17 Max: 14 Sum: 25)
|
||||
Executed : 3 (Average: 2.67 Max: 14 Sum: 16 Ratio: 64.00%)
|
||||
Bounded : 3 (Average: 3.00 Max: 7 Sum: 9 Ratio: 36.00%)
|
||||
|
||||
Rules : 1056 (Original: 982)
|
||||
Atoms : 814
|
||||
Bodies : 284 (Original: 209)
|
||||
Count : 6 (Original: 12)
|
||||
Equivalences : 139 (Atom=Atom: 29 Body=Body: 0 Other: 110)
|
||||
Tight : Yes
|
||||
Variables : 474 (Eliminated: 0 Frozen: 51)
|
||||
Constraints : 1460 (Binary: 86.0% Ternary: 10.4% Other: 3.6%)
|
||||
|
||||
Memory Peak : 50MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 2
|
||||
|
||||
|
Reference in New Issue
Block a user