Add benchmark result [fd-pa-e1-sh | ipc-2002 | depots-strips-automatic | 4]
This commit is contained in:
155
fd-pa-e1-sh/ipc-2002_depots-strips-automatic_4.out
Normal file
155
fd-pa-e1-sh/ipc-2002_depots-strips-automatic_4.out
Normal file
@@ -0,0 +1,155 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-4.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/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-4.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.013s 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.020s CPU, 0.017s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.010s wall-clock]
|
||||
Generated 43 rules.
|
||||
Computing model... [0.110s CPU, 0.112s wall-clock]
|
||||
860 relevant atoms
|
||||
750 auxiliary atoms
|
||||
1610 final queue length
|
||||
3016 total queue pushes
|
||||
Completing instantiation... [0.210s CPU, 0.206s wall-clock]
|
||||
Instantiating: [0.350s CPU, 0.352s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
16 initial candidates
|
||||
Finding invariants: [0.040s CPU, 0.038s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||||
Instantiating groups... [0.030s CPU, 0.024s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
20 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.006s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [0.080s CPU, 0.084s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.010s CPU, 0.002s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.000s CPU, 0.004s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.010s CPU, 0.011s wall-clock]
|
||||
Translating task: [0.240s CPU, 0.235s wall-clock]
|
||||
720 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
30 propositions removed
|
||||
Detecting unreachable propositions: [0.110s CPU, 0.118s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
32 of 32 variables necessary.
|
||||
22 of 32 mutex groups necessary.
|
||||
540 of 540 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.070s CPU, 0.063s wall-clock]
|
||||
Translator variables: 32
|
||||
Translator derived variables: 0
|
||||
Translator facts: 186
|
||||
Translator goal facts: 6
|
||||
Translator mutex groups: 22
|
||||
Translator total mutex groups size: 222
|
||||
Translator operators: 540
|
||||
Translator axioms: 0
|
||||
Translator task size: 5114
|
||||
Translator peak memory: 36184 KB
|
||||
Writing output... [0.080s CPU, 0.087s wall-clock]
|
||||
Done! [0.960s CPU, 0.971s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.22s
|
||||
Memory: 57MB
|
||||
|
||||
Iteration 1
|
||||
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
|
||||
Grounded Until: 0
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 57MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.00s
|
||||
|
||||
Iteration 2
|
||||
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
|
||||
Grounded Until: 0
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.08s
|
||||
Memory: 58MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 60MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.11s
|
||||
|
||||
Iteration 3
|
||||
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
|
||||
Grounded Until: 5
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.10s
|
||||
Memory: 64MB (+4MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 65MB (+1MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.13s
|
||||
|
||||
Iteration 4
|
||||
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
|
||||
Grounded Until: 10
|
||||
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||
Grounding Time: 0.10s
|
||||
Memory: 69MB (+4MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("lift","hoist0","crate7","crate4","depot0")),1) occurs(action(("lift","hoist1","crate2","pallet1","distributor0")),1) occurs(action(("drive","truck0","distributor1","depot0")),1) occurs(action(("lift","hoist2","crate6","crate5","distributor1")),1) occurs(action(("load","hoist0","crate7","truck0","depot0")),2) occurs(action(("load","hoist2","crate6","truck1","distributor1")),2) occurs(action(("lift","hoist0","crate4","crate1","depot0")),3) occurs(action(("drive","truck1","distributor1","distributor0")),3) occurs(action(("lift","hoist2","crate5","crate3","distributor1")),4) occurs(action(("load","hoist0","crate4","truck0","depot0")),4) occurs(action(("drive","truck1","distributor0","distributor1")),4) occurs(action(("load","hoist2","crate5","truck1","distributor1")),5) occurs(action(("lift","hoist0","crate1","crate0","depot0")),5) occurs(action(("drive","truck0","depot0","distributor1")),5) occurs(action(("lift","hoist2","crate3","pallet2","distributor1")),6) occurs(action(("drive","truck0","distributor1","depot0")),6) occurs(action(("drop","hoist1","crate2","pallet1","distributor0")),6) occurs(action(("load","hoist0","crate1","truck0","depot0")),7) occurs(action(("load","hoist2","crate3","truck1","distributor1")),7) occurs(action(("lift","hoist0","crate0","pallet0","depot0")),8) occurs(action(("lift","hoist1","crate2","pallet1","distributor0")),8) occurs(action(("drive","truck1","distributor1","distributor0")),8) occurs(action(("load","hoist1","crate2","truck1","distributor0")),9) occurs(action(("load","hoist0","crate0","truck0","depot0")),9) occurs(action(("unload","hoist0","crate7","truck0","depot0")),10) occurs(action(("unload","hoist1","crate6","truck1","distributor0")),10) occurs(action(("drop","hoist0","crate7","pallet0","depot0")),11) occurs(action(("drop","hoist1","crate6","pallet1","distributor0")),11) occurs(action(("drive","truck1","distributor0","distributor1")),11) occurs(action(("lift","hoist1","crate6","pallet1","distributor0")),12) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),12) occurs(action(("unload","hoist0","crate4","truck0","depot0")),12) occurs(action(("drop","hoist1","crate6","pallet1","distributor0")),13) occurs(action(("drop","hoist2","crate5","pallet2","distributor1")),13) occurs(action(("drop","hoist0","crate4","crate7","depot0")),13) occurs(action(("drive","truck1","distributor1","distributor0")),13) occurs(action(("unload","hoist1","crate2","truck1","distributor0")),14) occurs(action(("unload","hoist0","crate0","truck0","depot0")),14) occurs(action(("drop","hoist1","crate2","crate6","distributor0")),15) occurs(action(("drop","hoist0","crate0","crate4","depot0")),15) occurs(action(("drive","truck1","distributor0","depot0")),15) occurs(action(("drive","truck0","depot0","distributor0")),15)
|
||||
Solving Time: 0.13s
|
||||
Memory: 71MB (+2MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 4
|
||||
Time : 0.741s (Solving: 0.13s 1st Model: 0.13s Unsat: 0.00s)
|
||||
CPU Time : 0.710s
|
||||
|
||||
Choices : 2498
|
||||
Conflicts : 812 (Analyzed: 810)
|
||||
Restarts : 11 (Average: 73.64 Last: 20)
|
||||
Model-Level : 49.0
|
||||
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||||
Lemmas : 810 (Deleted: 0)
|
||||
Binary : 64 (Ratio: 7.90%)
|
||||
Ternary : 55 (Ratio: 6.79%)
|
||||
Conflict : 810 (Average Length: 47.7 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 810 (Average: 4.07 Max: 55 Sum: 3298)
|
||||
Executed : 755 (Average: 3.03 Max: 55 Sum: 2453 Ratio: 74.38%)
|
||||
Bounded : 55 (Average: 15.36 Max: 17 Sum: 845 Ratio: 25.62%)
|
||||
|
||||
Rules : 16649
|
||||
Atoms : 16649
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 14281 (Eliminated: 0 Frozen: 9563)
|
||||
Constraints : 105713 (Binary: 94.5% Ternary: 2.6% Other: 2.9%)
|
||||
|
||||
Memory Peak : 71MB
|
||||
Max. Length : 15 steps
|
||||
Sol. Length : 15 steps
|
||||
|
||||
|
Reference in New Issue
Block a user