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

Add benchmark result [gc-ta1-tt1 | ipc-2002 | zenotravel-strips-automatic | 5]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-29 12:51:25 +01:00
parent 9eb7ee72f2
commit 65207923ba
3 changed files with 218 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

134
gc-ta1-tt1/ipc-2002_zenotravel-strips-automatic_5.out Normal file
View File

@@ -0,0 +1,134 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-5.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/zenotravel-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-5.pddl
Parsing...
Parsing: [0.010s CPU, 0.012s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.019s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 40 rules.
Computing model... [0.080s CPU, 0.074s wall-clock]
568 relevant atoms
378 auxiliary atoms
946 final queue length
1724 total queue pushes
Completing instantiation... [0.130s CPU, 0.128s wall-clock]
Instantiating: [0.240s CPU, 0.233s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.003s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
0 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.020s CPU, 0.028s 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.010s CPU, 0.006s wall-clock]
Translating task: [0.120s CPU, 0.113s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
8 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.057s wall-clock]
Reordering and filtering variables...
8 of 8 variables necessary.
0 of 8 mutex groups necessary.
464 of 464 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.016s wall-clock]
Translator variables: 8
Translator derived variables: 0
Translator facts: 46
Translator goal facts: 4
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 464
Translator axioms: 0
Translator task size: 2178
Translator peak memory: 37580 KB
Writing output... [0.040s CPU, 0.046s wall-clock]
Done! [0.510s CPU, 0.513s wall-clock]
planner.py version 0.0.1
Time: 0.11s
Memory: 54MB
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: 55MB (+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.02s
Memory: 55MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.07s
Memory: 59MB (+4MB)
Answer: 1
occurs(action(("fly","plane1","city1","city0","fl6","fl5")),1) occurs(action(("refuel","plane2","city2","fl0","fl1")),1) occurs(action(("board","person2","plane1","city0")),2) occurs(action(("board","person3","plane1","city0")),2) occurs(action(("zoom","plane1","city0","city3","fl5","fl4","fl3")),2) occurs(action(("fly","plane2","city2","city1","fl1","fl0")),2) occurs(action(("debark","person2","plane1","city3")),3) occurs(action(("debark","person3","plane1","city3")),3) occurs(action(("board","person1","plane1","city3")),3) occurs(action(("fly","plane1","city3","city2","fl3","fl2")),3) occurs(action(("board","person4","plane2","city1")),3) occurs(action(("refuel","plane2","city1","fl0","fl1")),3) occurs(action(("debark","person1","plane1","city2")),4) occurs(action(("fly","plane2","city1","city3","fl1","fl0")),4) occurs(action(("fly","plane1","city2","city0","fl2","fl1")),4) occurs(action(("debark","person4","plane2","city3")),5) occurs(action(("fly","plane1","city0","city3","fl1","fl0")),5)
SATISFIABLE
Models : 1+
Calls : 2
Time : 0.153s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.144s
Choices : 55 (Domain: 44)
Conflicts : 8 (Analyzed: 8)
Restarts : 0
Model-Level : 39.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 8 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 8 (Average Length: 21.4 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.75 Max: 21 Sum: 30)
Executed : 7 (Average: 2.88 Max: 21 Sum: 23 Ratio: 76.67%)
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 23.33%)
Rules : 7053
Atoms : 7053
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 2332 (Eliminated: 0 Frozen: 59)
Constraints : 8789 (Binary: 96.6% Ternary: 1.8% Other: 1.5%)
Memory Peak : 59MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 1