Add benchmark result [gc-ta1-tt1 | ipc-2004 | psr-small-strips | 43]
This commit is contained in:
173
gc-ta1-tt1/ipc-2004_psr-small-strips_43.out
Normal file
173
gc-ta1-tt1/ipc-2004_psr-small-strips_43.out
Normal file
@@ -0,0 +1,173 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-43.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-43.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-43.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-43.pddl
|
||||
Parsing...
|
||||
Parsing: [0.070s CPU, 0.072s wall-clock]
|
||||
Normalizing task... [0.010s CPU, 0.008s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
||||
Generated 147 rules.
|
||||
Computing model... [0.010s CPU, 0.008s wall-clock]
|
||||
114 relevant atoms
|
||||
0 auxiliary atoms
|
||||
114 final queue length
|
||||
168 total queue pushes
|
||||
Completing instantiation... [0.020s CPU, 0.014s wall-clock]
|
||||
Instantiating: [0.060s CPU, 0.062s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
49 initial candidates
|
||||
Finding invariants: [0.160s CPU, 0.158s 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...
|
||||
9 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.160s CPU, 0.164s 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.010s CPU, 0.001s wall-clock]
|
||||
Translating task: [0.020s CPU, 0.020s wall-clock]
|
||||
24 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
18 propositions removed
|
||||
Detecting unreachable propositions: [0.020s CPU, 0.012s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
17 of 27 variables necessary.
|
||||
0 of 18 mutex groups necessary.
|
||||
44 of 64 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.000s CPU, 0.007s wall-clock]
|
||||
Translator variables: 17
|
||||
Translator derived variables: 0
|
||||
Translator facts: 38
|
||||
Translator goal facts: 6
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 44
|
||||
Translator axioms: 0
|
||||
Translator task size: 330
|
||||
Translator peak memory: 36556 KB
|
||||
Writing output... [0.000s CPU, 0.008s wall-clock]
|
||||
Done! [0.350s CPU, 0.356s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.02s
|
||||
Memory: 49MB
|
||||
|
||||
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 (+1MB)
|
||||
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: 51MB (+1MB)
|
||||
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: 52.0MB
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 51MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 51MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.01s
|
||||
Memory: 51MB (+0MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 51MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.03s
|
||||
|
||||
Iteration 4
|
||||
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 10
|
||||
Expected Memory: 52.0MB
|
||||
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 52MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 52MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE?
|
||||
Testing Time: 0.00s
|
||||
Memory: 52MB (+0MB)
|
||||
Answer: 2
|
||||
occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff2-no-1"),2) occurs(action("wait_cb1-condeff1-no-1"),2) occurs(action("wait_cb1-condeff0-yes"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("wait_cb3"),4) occurs(action("wait_cb2"),4) occurs(action("open-sd11"),5) occurs(action("open-sd10"),5) occurs(action("open-sd1"),5) occurs(action("close_cb1"),6) occurs(action("wait_cb1"),7) occurs(action("wait_cb1-condeff2-no-0"),8) occurs(action("wait_cb1-condeff2-no-1"),8) occurs(action("wait_cb1-condeff1-no-0"),8) occurs(action("wait_cb1-condeff1-no-1"),8) occurs(action("wait_cb1-condeff0-no-0"),8) occurs(action("wait_cb1-endof-condeffs"),9) occurs(action("close_sd6"),10) occurs(action("close_sd6-condeff1-no-0"),11) occurs(action("close_sd6-condeff0-no-0"),11) occurs(action("close_sd6-condeff1-no-0"),12) occurs(action("close_sd6-condeff0-no-0"),12) occurs(action("close_sd6-endof-condeffs"),13) occurs(action("close_cb2"),14) occurs(action("wait_cb2"),15)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 5
|
||||
Time : 0.065s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.060s
|
||||
|
||||
Choices : 299 (Domain: 293)
|
||||
Conflicts : 79 (Analyzed: 77)
|
||||
Restarts : 0
|
||||
Model-Level : 37.0
|
||||
Problems : 5 (Average Length: 10.00 Splits: 0)
|
||||
Lemmas : 77 (Deleted: 0)
|
||||
Binary : 4 (Ratio: 5.19%)
|
||||
Ternary : 1 (Ratio: 1.30%)
|
||||
Conflict : 77 (Average Length: 58.5 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 77 (Average: 3.86 Max: 28 Sum: 297)
|
||||
Executed : 72 (Average: 3.30 Max: 28 Sum: 254 Ratio: 85.52%)
|
||||
Bounded : 5 (Average: 8.60 Max: 17 Sum: 43 Ratio: 14.48%)
|
||||
|
||||
Rules : 2685 (Original: 2545)
|
||||
Atoms : 1425
|
||||
Bodies : 1387 (Original: 1333)
|
||||
Count : 31 (Original: 77)
|
||||
Equivalences : 484 (Atom=Atom: 80 Body=Body: 0 Other: 404)
|
||||
Tight : Yes
|
||||
Variables : 2115 (Eliminated: 0 Frozen: 453)
|
||||
Constraints : 9218 (Binary: 87.4% Ternary: 9.6% Other: 3.0%)
|
||||
|
||||
Memory Peak : 52MB
|
||||
Max. Length : 15 steps
|
||||
Sol. Length : 15 steps
|
||||
Models : 2
|
||||
|
||||
|
||||
Reference in New Issue
Block a user