patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [gc-ta3-tt1 | ipc-1998 | mystery-round-1-strips | 29]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-27 06:13:53 +01:00
parent a561a2fb28
commit 18a973d8dc
3 changed files with 226 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

143
gc-ta3-tt1/ipc-1998_mystery-round-1-strips_29.out Normal file
View File

@@ -0,0 +1,143 @@
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-29.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-29.pddl
Parsing...
Parsing: [0.020s CPU, 0.016s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.025s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 42 rules.
Computing model... [0.200s CPU, 0.198s wall-clock]
1534 relevant atoms
892 auxiliary atoms
2426 final queue length
4719 total queue pushes
Completing instantiation... [0.490s CPU, 0.486s wall-clock]
Instantiating: [0.730s CPU, 0.729s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.040s CPU, 0.029s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.016s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.061s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.021s wall-clock]
Translating task: [0.360s CPU, 0.359s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
24 propositions removed
Detecting unreachable propositions: [0.170s CPU, 0.177s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
0 of 22 mutex groups necessary.
1224 of 1224 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.058s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 177
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1224
Translator axioms: 0
Translator task size: 7377
Translator peak memory: 41164 KB
Writing output... [0.130s CPU, 0.140s wall-clock]
Done! [1.560s CPU, 1.562s wall-clock]
planner.py version 0.0.1
Time: 0.32s
Memory: 69MB
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: 70MB (+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
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.08s
Memory: 70MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 71MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 3.46s
Memory: 256MB (+185MB)
Solving...
Solving Time: 0.09s
Memory: 256MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 256MB (+0MB)
Answer: 2
occurs(action(("feast","achievement","scallop","pork","bavaria","oregon")),1) occurs(action(("feast","excitement","pork","broccoli","manitoba","bavaria")),1) occurs(action(("overcome","jealousy","achievement","pork","neptune","uranus")),2) occurs(action(("feast","achievement","pork","broccoli","quebec","manitoba")),2) occurs(action(("feast","achievement","broccoli","shrimp","pennsylvania","alsace")),3) occurs(action(("succumb","jealousy","achievement","shrimp","neptune","uranus")),4) occurs(action(("feast","achievement","shrimp","melon","oregon","kentucky")),4) occurs(action(("feast","excitement","broccoli","pork","arizona","pennsylvania")),4) occurs(action(("feast","excitement","pork","pear","alsace","quebec")),5)
SATISFIABLE
Models : 1+
Calls : 3
Time : 3.783s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 3.756s
Choices : 96 (Domain: 66)
Conflicts : 8 (Analyzed: 8)
Restarts : 0
Model-Level : 42.5
Problems : 3 (Average Length: 5.33 Splits: 0)
Lemmas : 8 (Deleted: 0)
Binary : 2 (Ratio: 25.00%)
Ternary : 1 (Ratio: 12.50%)
Conflict : 8 (Average Length: 12.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 8 (Average: 3.12 Max: 9 Sum: 25)
Executed : 8 (Average: 3.12 Max: 9 Sum: 25 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 1806941
Atoms : 1802555
Bodies : 12835 (Original: 12834)
Equivalences : 45787 (Atom=Atom: 9997 Body=Body: 6057 Other: 29733)
Tight : No (SCCs: 300 Non-Hcfs: 0 Nodes: 10326 Gammas: 0)
Variables : 11024 (Eliminated: 0 Frozen: 6931)
Constraints : 20551 (Binary: 95.8% Ternary: 1.8% Other: 2.3%)
Memory Peak : 256MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 2