Add benchmark result [gc-ta1-tt1 | ipc-2004 | psr-small-strips | 4]
This commit is contained in:
149
gc-ta1-tt1/ipc-2004_psr-small-strips_4.out
Normal file
149
gc-ta1-tt1/ipc-2004_psr-small-strips_4.out
Normal file
@@ -0,0 +1,149 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-4.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/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-2004/domains/psr-small-strips/domains/domain-4.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-4.pddl
|
||||
Parsing...
|
||||
Parsing: [0.080s CPU, 0.075s wall-clock]
|
||||
Normalizing task... [0.010s CPU, 0.008s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.013s wall-clock]
|
||||
Generated 141 rules.
|
||||
Computing model... [0.010s CPU, 0.008s wall-clock]
|
||||
88 relevant atoms
|
||||
0 auxiliary atoms
|
||||
88 final queue length
|
||||
150 total queue pushes
|
||||
Completing instantiation... [0.010s CPU, 0.011s wall-clock]
|
||||
Instantiating: [0.050s CPU, 0.060s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
25 initial candidates
|
||||
Finding invariants: [0.160s CPU, 0.157s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
4 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.000s wall-clock]
|
||||
Computing fact groups: [0.160s CPU, 0.160s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.010s 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.010s CPU, 0.016s wall-clock]
|
||||
20 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
8 propositions removed
|
||||
Detecting unreachable propositions: [0.010s CPU, 0.009s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
12 of 12 variables necessary.
|
||||
0 of 8 mutex groups necessary.
|
||||
62 of 62 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
|
||||
Translator variables: 12
|
||||
Translator derived variables: 0
|
||||
Translator facts: 29
|
||||
Translator goal facts: 7
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 62
|
||||
Translator axioms: 0
|
||||
Translator task size: 372
|
||||
Translator peak memory: 36556 KB
|
||||
Writing output... [0.010s CPU, 0.010s wall-clock]
|
||||
Done! [0.340s CPU, 0.346s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.02s
|
||||
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: 50MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 50MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.01s
|
||||
|
||||
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
|
||||
Expected Memory: 50MB
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 51MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 51MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.01s
|
||||
Memory: 51MB (+0MB)
|
||||
Answer: 1
|
||||
occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff1-yes"),2) occurs(action("wait_cb1-condeff0-no-0"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("close_cb1"),4) occurs(action("open-sd5"),4) occurs(action("wait_cb1"),5) occurs(action("wait_cb1-condeff1-no-0"),6) occurs(action("wait_cb1-condeff0-no-0"),6) occurs(action("wait_cb1-condeff0-no-0"),7) occurs(action("wait_cb1-condeff0-no-0"),8) occurs(action("wait_cb1-condeff0-no-0"),9) occurs(action("wait_cb1-endof-condeffs"),10)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 0.046s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.032s
|
||||
|
||||
Choices : 29 (Domain: 26)
|
||||
Conflicts : 5 (Analyzed: 4)
|
||||
Restarts : 0
|
||||
Model-Level : 37.0
|
||||
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||||
Lemmas : 4 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 4 (Average Length: 112.2 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 4 (Average: 1.00 Max: 1 Sum: 4)
|
||||
Executed : 4 (Average: 1.00 Max: 1 Sum: 4 Ratio: 100.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
|
||||
Rules : 1166
|
||||
Atoms : 1166
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 988 (Eliminated: 0 Frozen: 63)
|
||||
Constraints : 3793 (Binary: 92.6% Ternary: 5.7% Other: 1.7%)
|
||||
|
||||
Memory Peak : 51MB
|
||||
Max. Length : 10 steps
|
||||
Sol. Length : 10 steps
|
||||
Models : 1
|
||||
|
||||
|
||||
Reference in New Issue
Block a user