Add benchmark result [gc-ta1-tt1 | ipc-2004 | psr-small-strips | 20]
This commit is contained in:
187
gc-ta1-tt1/ipc-2004_psr-small-strips_20.out
Normal file
187
gc-ta1-tt1/ipc-2004_psr-small-strips_20.out
Normal file
@@ -0,0 +1,187 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-20.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-20.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-20.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-20.pddl
|
||||
Parsing...
|
||||
Parsing: [0.070s CPU, 0.070s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.007s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.012s wall-clock]
|
||||
Generated 111 rules.
|
||||
Computing model... [0.000s CPU, 0.007s wall-clock]
|
||||
96 relevant atoms
|
||||
0 auxiliary atoms
|
||||
96 final queue length
|
||||
132 total queue pushes
|
||||
Completing instantiation... [0.010s CPU, 0.011s wall-clock]
|
||||
Instantiating: [0.050s CPU, 0.052s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
46 initial candidates
|
||||
Finding invariants: [0.090s CPU, 0.086s 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...
|
||||
7 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.090s CPU, 0.092s 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.017s wall-clock]
|
||||
15 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
18 propositions removed
|
||||
Detecting unreachable propositions: [0.010s CPU, 0.009s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
13 of 25 variables necessary.
|
||||
0 of 18 mutex groups necessary.
|
||||
25 of 49 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
|
||||
Translator variables: 13
|
||||
Translator derived variables: 0
|
||||
Translator facts: 29
|
||||
Translator goal facts: 6
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 25
|
||||
Translator axioms: 0
|
||||
Translator task size: 205
|
||||
Translator peak memory: 36300 KB
|
||||
Writing output... [0.000s CPU, 0.006s wall-clock]
|
||||
Done! [0.250s CPU, 0.261s 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: 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: 50MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 50MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.01s
|
||||
|
||||
Iteration 4
|
||||
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 10
|
||||
Expected Memory: 50MB
|
||||
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 51MB (+1MB)
|
||||
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 5
|
||||
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 15
|
||||
Expected Memory: 52.0MB
|
||||
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 51MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 52MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE?
|
||||
Testing Time: 0.00s
|
||||
Memory: 52MB (+0MB)
|
||||
Answer: 2
|
||||
occurs(action("wait_cb2"),1) occurs(action("wait_cb2-condeff0-yes"),2) occurs(action("wait_cb2-endof-condeffs"),3) occurs(action("wait_cb1"),4) occurs(action("wait_cb1-condeff0-yes"),5) occurs(action("wait_cb1-endof-condeffs"),6) occurs(action("wait_cb3"),7) occurs(action("open-sd1"),8) occurs(action("open-sd5"),8) occurs(action("close_cb2"),9) occurs(action("wait_cb2"),10) occurs(action("wait_cb2-condeff0-no-0"),11) occurs(action("wait_cb2-endof-condeffs"),12) occurs(action("close_cb1"),13) occurs(action("wait_cb1"),14) occurs(action("wait_cb1-condeff0-no-0"),15) occurs(action("wait_cb1-endof-condeffs"),16) occurs(action("close_cb3"),17) occurs(action("wait_cb3"),18) occurs(action("close_cb3"),19) occurs(action("wait_cb3"),20)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 6
|
||||
Time : 0.086s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.084s
|
||||
|
||||
Choices : 356 (Domain: 356)
|
||||
Conflicts : 157 (Analyzed: 154)
|
||||
Restarts : 0
|
||||
Model-Level : 48.5
|
||||
Problems : 6 (Average Length: 12.83 Splits: 0)
|
||||
Lemmas : 154 (Deleted: 0)
|
||||
Binary : 9 (Ratio: 5.84%)
|
||||
Ternary : 2 (Ratio: 1.30%)
|
||||
Conflict : 154 (Average Length: 42.6 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 154 (Average: 2.56 Max: 17 Sum: 394)
|
||||
Executed : 142 (Average: 1.94 Max: 17 Sum: 298 Ratio: 75.63%)
|
||||
Bounded : 12 (Average: 8.00 Max: 12 Sum: 96 Ratio: 24.37%)
|
||||
|
||||
Rules : 2450 (Original: 2126)
|
||||
Atoms : 1080
|
||||
Bodies : 1427 (Original: 1303)
|
||||
Count : 24 (Original: 102)
|
||||
Equivalences : 531 (Atom=Atom: 84 Body=Body: 0 Other: 447)
|
||||
Tight : Yes
|
||||
Variables : 2150 (Eliminated: 0 Frozen: 306)
|
||||
Constraints : 8816 (Binary: 84.6% Ternary: 11.8% Other: 3.6%)
|
||||
|
||||
Memory Peak : 52MB
|
||||
Max. Length : 20 steps
|
||||
Sol. Length : 20 steps
|
||||
Models : 2
|
||||
|
||||
|
||||
Reference in New Issue
Block a user