Add benchmark result [gc-ta5-tt0 | ipc-2002 | driverlog-strips-automatic | 7]
This commit is contained in:
165
gc-ta5-tt0/ipc-2002_driverlog-strips-automatic_7.out
Normal file
165
gc-ta5-tt0/ipc-2002_driverlog-strips-automatic_7.out
Normal file
@@ -0,0 +1,165 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.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/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.018s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.012s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.060s CPU, 0.061s wall-clock]
|
||||
412 relevant atoms
|
||||
273 auxiliary atoms
|
||||
685 final queue length
|
||||
904 total queue pushes
|
||||
Completing instantiation... [0.050s CPU, 0.055s wall-clock]
|
||||
Instantiating: [0.150s CPU, 0.153s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
11 initial candidates
|
||||
Finding invariants: [0.020s CPU, 0.016s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.010s CPU, 0.010s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
3 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.030s CPU, 0.033s 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.010s CPU, 0.001s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.000s CPU, 0.003s wall-clock]
|
||||
Translating task: [0.050s CPU, 0.055s wall-clock]
|
||||
27 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
12 propositions removed
|
||||
Detecting unreachable propositions: [0.030s CPU, 0.029s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
15 of 15 variables necessary.
|
||||
3 of 15 mutex groups necessary.
|
||||
252 of 252 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
|
||||
Translator variables: 15
|
||||
Translator derived variables: 0
|
||||
Translator facts: 78
|
||||
Translator goal facts: 10
|
||||
Translator mutex groups: 3
|
||||
Translator total mutex groups size: 12
|
||||
Translator operators: 252
|
||||
Translator axioms: 0
|
||||
Translator task size: 1168
|
||||
Translator peak memory: 36812 KB
|
||||
Writing output... [0.030s CPU, 0.027s wall-clock]
|
||||
Done! [0.330s CPU, 0.332s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.05s
|
||||
Memory: 51MB
|
||||
|
||||
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: 52MB (+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.01s
|
||||
Memory: 52MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 52MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.04s
|
||||
Memory: 54MB (+2MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 54MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.06s
|
||||
|
||||
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: 0.01s
|
||||
Memory: 54MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 54MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.04s
|
||||
Memory: 55MB (+1MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 55MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.03s
|
||||
Memory: 55MB (+0MB)
|
||||
Answer: 3
|
||||
occurs(action(("load-truck","package4","truck3","s1")),1) occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("walk","driver2","s2","p0-2")),1) occurs(action(("board-truck","driver1","truck2","s1")),1) occurs(action(("walk","driver3","s2","p2-1")),1) occurs(action(("drive-truck","truck2","s1","s0","driver1")),2) occurs(action(("disembark-truck","driver1","truck2","s0")),3) occurs(action(("unload-truck","package5","truck2","s0")),4) occurs(action(("walk","driver2","p0-2","s0")),4) occurs(action(("walk","driver3","p2-1","s1")),4) occurs(action(("board-truck","driver3","truck3","s1")),5) occurs(action(("drive-truck","truck3","s1","s2","driver3")),6) occurs(action(("unload-truck","package4","truck3","s2")),7) occurs(action(("load-truck","package2","truck3","s2")),7) occurs(action(("drive-truck","truck3","s2","s1","driver3")),7) occurs(action(("unload-truck","package2","truck3","s1")),8) occurs(action(("disembark-truck","driver3","truck3","s1")),8) occurs(action(("board-truck","driver3","truck1","s1")),9) occurs(action(("disembark-truck","driver3","truck1","s1")),10)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 5
|
||||
Time : 0.107s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.104s
|
||||
|
||||
Choices : 383 (Domain: 382)
|
||||
Conflicts : 63 (Analyzed: 62)
|
||||
Restarts : 0
|
||||
Model-Level : 88.3
|
||||
Problems : 5 (Average Length: 8.00 Splits: 0)
|
||||
Lemmas : 62 (Deleted: 0)
|
||||
Binary : 1 (Ratio: 1.61%)
|
||||
Ternary : 1 (Ratio: 1.61%)
|
||||
Conflict : 62 (Average Length: 11.6 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 62 (Average: 2.74 Max: 12 Sum: 170)
|
||||
Executed : 59 (Average: 2.40 Max: 12 Sum: 149 Ratio: 87.65%)
|
||||
Bounded : 3 (Average: 7.00 Max: 7 Sum: 21 Ratio: 12.35%)
|
||||
|
||||
Rules : 3788
|
||||
Atoms : 3785
|
||||
Bodies : 19 (Original: 18)
|
||||
Count : 3
|
||||
Equivalences : 45 (Atom=Atom: 15 Body=Body: 0 Other: 30)
|
||||
Tight : Yes
|
||||
Variables : 3105 (Eliminated: 0 Frozen: 606)
|
||||
Constraints : 11794 (Binary: 90.9% Ternary: 5.1% Other: 4.0%)
|
||||
|
||||
Memory Peak : 55MB
|
||||
Max. Length : 10 steps
|
||||
Sol. Length : 10 steps
|
||||
Models : 3
|
||||
|
||||
|
||||
Reference in New Issue
Block a user