Add benchmark result [gc-ta1-tt1 | ipc-2006 | storage-propositional | 3]
This commit is contained in:
135
gc-ta1-tt1/ipc-2006_storage-propositional_3.out
Normal file
135
gc-ta1-tt1/ipc-2006_storage-propositional_3.out
Normal file
@@ -0,0 +1,135 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-3.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-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-3.pddl
|
||||
Parsing...
|
||||
Parsing: [0.010s CPU, 0.016s 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.020s CPU, 0.023s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.009s wall-clock]
|
||||
Generated 43 rules.
|
||||
Computing model... [0.030s CPU, 0.029s wall-clock]
|
||||
150 relevant atoms
|
||||
199 auxiliary atoms
|
||||
349 final queue length
|
||||
458 total queue pushes
|
||||
Completing instantiation... [0.020s CPU, 0.023s wall-clock]
|
||||
Instantiating: [0.090s CPU, 0.089s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
16 initial candidates
|
||||
Finding invariants: [0.020s CPU, 0.026s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
|
||||
Instantiating groups... [0.010s CPU, 0.001s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
13 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.031s 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.023s wall-clock]
|
||||
72 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
12 propositions removed
|
||||
Detecting unreachable propositions: [0.010s CPU, 0.012s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
12 of 13 variables necessary.
|
||||
3 of 7 mutex groups necessary.
|
||||
60 of 60 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
|
||||
Translator variables: 12
|
||||
Translator derived variables: 0
|
||||
Translator facts: 38
|
||||
Translator goal facts: 1
|
||||
Translator mutex groups: 3
|
||||
Translator total mutex groups size: 6
|
||||
Translator operators: 60
|
||||
Translator axioms: 0
|
||||
Translator task size: 465
|
||||
Translator peak memory: 36300 KB
|
||||
Writing output... [0.010s CPU, 0.011s wall-clock]
|
||||
Done! [0.180s CPU, 0.193s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.03s
|
||||
Memory: 50MB
|
||||
|
||||
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: 50MB (+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
|
||||
Expected Memory: 50MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 51MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 51MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.02s
|
||||
Memory: 51MB (+0MB)
|
||||
Answer: 1
|
||||
occurs(action(("go-out","hoist0","depot0-1-2","loadarea")),1) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),2) occurs(action(("drop","hoist0","crate0","depot0-1-2","loadarea","depot0")),3) occurs(action(("go-in","hoist0","loadarea","container-0-0")),3) occurs(action(("go-out","hoist0","container-0-0","loadarea")),4) occurs(action(("go-in","hoist0","loadarea","container-0-0")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 2
|
||||
Time : 0.056s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.048s
|
||||
|
||||
Choices : 8 (Domain: 8)
|
||||
Conflicts : 0 (Analyzed: 0)
|
||||
Restarts : 0
|
||||
Model-Level : 15.0
|
||||
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||||
Lemmas : 0 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
|
||||
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
|
||||
|
||||
Rules : 1473
|
||||
Atoms : 1473
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 595 (Eliminated: 0 Frozen: 28)
|
||||
Constraints : 1692 (Binary: 90.4% Ternary: 5.6% Other: 4.0%)
|
||||
|
||||
Memory Peak : 51MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 1
|
||||
|
||||
|
Reference in New Issue
Block a user