Add benchmark result [fd-pc-e1-sh | ipc-2002 | driverlog-strips-automatic | 2]
This commit is contained in:
146
fd-pc-e1-sh/ipc-2002_driverlog-strips-automatic_2.out
Normal file
146
fd-pc-e1-sh/ipc-2002_driverlog-strips-automatic_2.out
Normal file
@@ -0,0 +1,146 @@
|
||||
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-2.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-2.pddl
|
||||
Parsing...
|
||||
Parsing: [0.010s CPU, 0.015s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.009s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.030s CPU, 0.033s wall-clock]
|
||||
215 relevant atoms
|
||||
172 auxiliary atoms
|
||||
387 final queue length
|
||||
477 total queue pushes
|
||||
Completing instantiation... [0.020s CPU, 0.023s wall-clock]
|
||||
Instantiating: [0.080s CPU, 0.088s 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.000s CPU, 0.004s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
2 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.024s 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.022s wall-clock]
|
||||
12 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
7 propositions removed
|
||||
Detecting unreachable propositions: [0.010s CPU, 0.012s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
9 of 9 variables necessary.
|
||||
2 of 9 mutex groups necessary.
|
||||
108 of 108 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.004s wall-clock]
|
||||
Translator variables: 9
|
||||
Translator derived variables: 0
|
||||
Translator facts: 41
|
||||
Translator goal facts: 7
|
||||
Translator mutex groups: 2
|
||||
Translator total mutex groups size: 6
|
||||
Translator operators: 108
|
||||
Translator axioms: 0
|
||||
Translator task size: 507
|
||||
Translator peak memory: 33112 KB
|
||||
Writing output... [0.010s CPU, 0.012s wall-clock]
|
||||
Done! [0.180s CPU, 0.180s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.03s
|
||||
Memory: 46MB
|
||||
|
||||
Iteration 1
|
||||
Queue: [5]
|
||||
Grounded Until: 0
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 47MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 47MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.02s
|
||||
|
||||
Iteration 2
|
||||
Queue: [7]
|
||||
Grounded Until: 5
|
||||
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 47MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 48MB (+1MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.01s
|
||||
|
||||
Iteration 3
|
||||
Queue: [9]
|
||||
Grounded Until: 7
|
||||
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 48MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("walk","driver1","s0","p0-1")),1) occurs(action(("walk","driver1","p0-1","s1")),2) occurs(action(("board-truck","driver2","truck1","s0")),2) occurs(action(("load-truck","package2","truck2","s1")),3) occurs(action(("load-truck","package3","truck2","s1")),3) occurs(action(("board-truck","driver1","truck2","s1")),3) occurs(action(("drive-truck","truck1","s0","s1","driver2")),3) occurs(action(("drive-truck","truck2","s1","s2","driver1")),4) occurs(action(("drive-truck","truck1","s1","s0","driver2")),4) occurs(action(("unload-truck","package2","truck2","s2")),5) occurs(action(("drive-truck","truck1","s0","s2","driver2")),5) occurs(action(("load-truck","package1","truck2","s2")),5) occurs(action(("drive-truck","truck2","s2","s0","driver1")),6) occurs(action(("disembark-truck","driver2","truck1","s2")),6) occurs(action(("load-truck","package2","truck1","s2")),7) occurs(action(("walk","driver2","s2","p2-1")),7) occurs(action(("disembark-truck","driver1","truck2","s0")),7) occurs(action(("unload-truck","package1","truck2","s0")),8) occurs(action(("unload-truck","package2","truck1","s2")),8) occurs(action(("unload-truck","package3","truck2","s0")),8) occurs(action(("walk","driver1","s0","p0-1")),8) occurs(action(("walk","driver2","p2-1","s1")),9) occurs(action(("walk","driver1","p0-1","s1")),9)
|
||||
Solving Time: 0.00s
|
||||
Memory: 48MB (+0MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 0.087s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.090s
|
||||
|
||||
Choices : 183
|
||||
Conflicts : 31 (Analyzed: 29)
|
||||
Restarts : 0
|
||||
Model-Level : 36.0
|
||||
Problems : 3 (Average Length: 9.00 Splits: 0)
|
||||
Lemmas : 29 (Deleted: 0)
|
||||
Binary : 3 (Ratio: 10.34%)
|
||||
Ternary : 1 (Ratio: 3.45%)
|
||||
Conflict : 29 (Average Length: 7.1 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 29 (Average: 5.97 Max: 19 Sum: 173)
|
||||
Executed : 22 (Average: 5.45 Max: 19 Sum: 158 Ratio: 91.33%)
|
||||
Bounded : 7 (Average: 2.14 Max: 9 Sum: 15 Ratio: 8.67%)
|
||||
|
||||
Rules : 0
|
||||
Atoms : 0
|
||||
Bodies : 0
|
||||
Tight : Yes
|
||||
Variables : 1928 (Eliminated: 0 Frozen: 1000)
|
||||
Constraints : 7112 (Binary: 88.9% Ternary: 6.3% Other: 4.7%)
|
||||
|
||||
Memory Peak : 48MB
|
||||
Max. Length : 9 steps
|
||||
Sol. Length : 9 steps
|
||||
|
||||
|
||||
Reference in New Issue
Block a user