Add benchmark result [fd-pb-e4 | ipc-1998 | logistics-round-1-strips | 33]
This commit is contained in:
129
fd-pb-e4/ipc-1998_logistics-round-1-strips_33.out
Normal file
129
fd-pb-e4/ipc-1998_logistics-round-1-strips_33.out
Normal file
@@ -0,0 +1,129 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-33.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/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-33.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.021s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.030s CPU, 0.032s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
||||
Generated 51 rules.
|
||||
Computing model... [0.100s CPU, 0.103s wall-clock]
|
||||
560 relevant atoms
|
||||
534 auxiliary atoms
|
||||
1094 final queue length
|
||||
1317 total queue pushes
|
||||
Completing instantiation... [0.080s CPU, 0.075s wall-clock]
|
||||
Instantiating: [0.240s CPU, 0.232s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
6 initial candidates
|
||||
Finding invariants: [0.000s CPU, 0.009s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.020s CPU, 0.010s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
0 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [0.020s CPU, 0.030s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s 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.010s CPU, 0.004s wall-clock]
|
||||
Translating task: [0.070s CPU, 0.060s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
17 propositions removed
|
||||
Detecting unreachable propositions: [0.030s CPU, 0.035s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
17 of 17 variables necessary.
|
||||
0 of 17 mutex groups necessary.
|
||||
318 of 318 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
|
||||
Translator variables: 17
|
||||
Translator derived variables: 0
|
||||
Translator facts: 133
|
||||
Translator goal facts: 7
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 318
|
||||
Translator axioms: 0
|
||||
Translator task size: 1405
|
||||
Translator peak memory: 33880 KB
|
||||
Writing output... [0.030s CPU, 0.030s wall-clock]
|
||||
Done! [0.420s CPU, 0.424s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.15s
|
||||
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: 51MB (+0MB)
|
||||
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.03s
|
||||
Memory: 53MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("load-truck","package7","truck8","city2-1")),1) occurs(action(("drive-truck","truck8","city2-1","city2-2","city2")),1) occurs(action(("load-truck","package3","truck8","city2-1")),1) occurs(action(("unload-truck","package7","truck8","city2-2")),2) occurs(action(("load-truck","package2","truck6","city1-2")),2) occurs(action(("drive-truck","truck4","city3-1","city3-2","city3")),2) occurs(action(("fly-airplane","plane1","city1-2","city2-2")),2) occurs(action(("unload-truck","package3","truck8","city2-2")),2) occurs(action(("drive-truck","truck8","city2-2","city2-1","city2")),2) occurs(action(("load-airplane","package1","plane1","city1-2")),2) occurs(action(("load-truck","package4","truck4","city3-1")),2) occurs(action(("load-airplane","package3","plane1","city2-2")),3) occurs(action(("load-airplane","package5","plane1","city2-2")),3) occurs(action(("load-airplane","package6","plane1","city2-2")),3) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),3) occurs(action(("load-airplane","package7","plane1","city2-2")),3) occurs(action(("unload-airplane","package1","plane1","city2-2")),3) occurs(action(("unload-truck","package4","truck4","city3-2")),3) occurs(action(("drive-truck","truck4","city3-2","city3-1","city3")),3) occurs(action(("unload-airplane","package3","plane1","city3-2")),4) occurs(action(("unload-airplane","package5","plane1","city3-2")),4) occurs(action(("unload-airplane","package6","plane1","city3-2")),4) occurs(action(("load-truck","package1","truck1","city2-2")),4) occurs(action(("drive-truck","truck1","city2-2","city2-1","city2")),4) occurs(action(("drive-truck","truck6","city1-2","city1-1","city1")),4) occurs(action(("load-airplane","package4","plane1","city3-2")),4) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),4) occurs(action(("unload-truck","package1","truck1","city2-1")),5) occurs(action(("unload-truck","package2","truck6","city1-1")),5) occurs(action(("unload-airplane","package4","plane1","city2-2")),5) occurs(action(("unload-airplane","package7","plane1","city2-2")),5) occurs(action(("drive-truck","truck1","city2-1","city2-2","city2")),5) occurs(action(("fly-airplane","plane1","city2-2","city1-2")),5) occurs(action(("drive-truck","truck6","city1-1","city1-2","city1")),5)
|
||||
Solving Time: 0.00s
|
||||
Memory: 54MB (+1MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 2
|
||||
Time : 0.189s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.190s
|
||||
|
||||
Choices : 60
|
||||
Conflicts : 1 (Analyzed: 1)
|
||||
Restarts : 0
|
||||
Model-Level : 65.0
|
||||
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||||
Lemmas : 1 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 1 (Average Length: 10.0 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 1 (Average: 2.00 Max: 2 Sum: 2)
|
||||
Executed : 1 (Average: 2.00 Max: 2 Sum: 2 Ratio: 100.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
|
||||
Rules : 44653
|
||||
Atoms : 44653
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 2519 (Eliminated: 0 Frozen: 569)
|
||||
Constraints : 4619 (Binary: 88.7% Ternary: 8.4% Other: 2.9%)
|
||||
|
||||
Memory Peak : 54MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
|
||||
|
||||
Reference in New Issue
Block a user