Add benchmark result [fd-pa-e1-sh | ipc-2000 | blocks-strips-typed | 32]
This commit is contained in:
parent
b1a57246da
commit
5e610e732d
40
fd-pa-e1-sh/ipc-2000_blocks-strips-typed_32.env
Normal file
40
fd-pa-e1-sh/ipc-2000_blocks-strips-typed_32.env
Normal file
@ -0,0 +1,40 @@
|
|||||||
|
command:
|
||||||
|
- timeout
|
||||||
|
- -m=8000000
|
||||||
|
- -t=900
|
||||||
|
- python3
|
||||||
|
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
|
||||||
|
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-32.pddl
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -A 16
|
||||||
|
- --parallel=1
|
||||||
|
- --shallow
|
||||||
|
configuration:
|
||||||
|
id: fd-pa-e1-sh
|
||||||
|
instanceSets:
|
||||||
|
- lpnmr-hard-instances
|
||||||
|
options:
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -A 16
|
||||||
|
- --parallel=1
|
||||||
|
- --shallow
|
||||||
|
exitCode: 0
|
||||||
|
instance:
|
||||||
|
domain: blocks-strips-typed
|
||||||
|
instance: 32
|
||||||
|
ipc: ipc-2000
|
||||||
|
versions:
|
||||||
|
clingo: 5.2.2
|
||||||
|
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||||
|
planner: 517f2c0422a36582df17ecebb08e879b170cdfe2 (2017-11-21 02:23:06 +0100)
|
||||||
|
plasp: 3.1.1
|
||||||
|
python: 3.6.3
|
||||||
|
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
|
18
fd-pa-e1-sh/ipc-2000_blocks-strips-typed_32.err
Normal file
18
fd-pa-e1-sh/ipc-2000_blocks-strips-typed_32.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# configuration: {'id': 'fd-pa-e1-sh', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-A 16', '--parallel=1', '--shallow'], 'instanceSets': ['lpnmr-hard-instances']}
|
||||||
|
# instance: {'ipc': 'ipc-2000', 'domain': 'blocks-strips-typed', 'instance': 32}
|
||||||
|
# command: ['timeout', '-m=8000000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-32.pddl', '--stats', '--verbose', '--print-call', '--translate', '-A 16', '--parallel=1', '--shallow']
|
||||||
|
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
# exit code: 0
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:13:4-34: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(actionCosts))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:14:4-33: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(axiomRules))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:15:4-41: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(conditionalEffects))
|
||||||
|
|
||||||
|
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-32.pddl && plasp-3.1.1 translate --parsing-mode=compatibility output.sas | /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/planner.py - /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp --stats --verbose -A 16 --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 -c _shallow=1 -c _closure=3 -c _parallel=1
|
||||||
|
FINISHED CPU 4.57 MEM 0 MAXMEM 160172 STALE 0 MAXMEM_RSS 99656
|
||||||
|
<time name="ALL">4470</time>
|
||||||
|
|
272
fd-pa-e1-sh/ipc-2000_blocks-strips-typed_32.out
Normal file
272
fd-pa-e1-sh/ipc-2000_blocks-strips-typed_32.out
Normal file
@ -0,0 +1,272 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-32.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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-32.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.010s CPU, 0.014s wall-clock]
|
||||||
|
Normalizing task... [0.010s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
|
||||||
|
Preparing model... [0.010s CPU, 0.008s wall-clock]
|
||||||
|
Generated 21 rules.
|
||||||
|
Computing model... [0.100s CPU, 0.109s wall-clock]
|
||||||
|
797 relevant atoms
|
||||||
|
525 auxiliary atoms
|
||||||
|
1322 final queue length
|
||||||
|
2254 total queue pushes
|
||||||
|
Completing instantiation... [0.150s CPU, 0.141s wall-clock]
|
||||||
|
Instantiating: [0.270s CPU, 0.273s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
10 initial candidates
|
||||||
|
Finding invariants: [0.030s CPU, 0.027s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Instantiating groups... [0.000s CPU, 0.008s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
16 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.009s wall-clock]
|
||||||
|
Building translation key... [0.010s CPU, 0.003s wall-clock]
|
||||||
|
Computing fact groups: [0.070s CPU, 0.070s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.010s CPU, 0.005s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.000s CPU, 0.007s wall-clock]
|
||||||
|
Translating task: [0.150s CPU, 0.158s wall-clock]
|
||||||
|
660 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
30 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.090s CPU, 0.087s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
31 of 31 variables necessary.
|
||||||
|
16 of 31 mutex groups necessary.
|
||||||
|
450 of 450 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.050s CPU, 0.050s wall-clock]
|
||||||
|
Translator variables: 31
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 272
|
||||||
|
Translator goal facts: 14
|
||||||
|
Translator mutex groups: 16
|
||||||
|
Translator total mutex groups size: 256
|
||||||
|
Translator operators: 450
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 3903
|
||||||
|
Translator peak memory: 35416 KB
|
||||||
|
Writing output... [0.060s CPU, 0.067s wall-clock]
|
||||||
|
Done! [0.730s CPU, 0.738s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.14s
|
||||||
|
Memory: 53MB
|
||||||
|
|
||||||
|
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: 53MB (+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.07s
|
||||||
|
Memory: 55MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 56MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.09s
|
||||||
|
|
||||||
|
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.07s
|
||||||
|
Memory: 60MB (+4MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 61MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.09s
|
||||||
|
|
||||||
|
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.07s
|
||||||
|
Memory: 63MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 65MB (+2MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.09s
|
||||||
|
|
||||||
|
Iteration 5
|
||||||
|
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
|
||||||
|
Grounded Until: 15
|
||||||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||||
|
Grounding Time: 0.08s
|
||||||
|
Memory: 68MB (+3MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 69MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.10s
|
||||||
|
|
||||||
|
Iteration 6
|
||||||
|
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100]
|
||||||
|
Grounded Until: 20
|
||||||
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||||
|
Grounding Time: 0.09s
|
||||||
|
Memory: 73MB (+4MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 76MB (+3MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.12s
|
||||||
|
|
||||||
|
Iteration 7
|
||||||
|
Queue: [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105]
|
||||||
|
Grounded Until: 25
|
||||||
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||||||
|
Grounding Time: 0.07s
|
||||||
|
Memory: 78MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 79MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.11s
|
||||||
|
|
||||||
|
Iteration 8
|
||||||
|
Queue: [35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110]
|
||||||
|
Grounded Until: 30
|
||||||
|
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||||||
|
Grounding Time: 0.07s
|
||||||
|
Memory: 82MB (+3MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.02s
|
||||||
|
Memory: 86MB (+4MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.12s
|
||||||
|
|
||||||
|
Iteration 9
|
||||||
|
Queue: [40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115]
|
||||||
|
Grounded Until: 35
|
||||||
|
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
|
||||||
|
Grounding Time: 0.07s
|
||||||
|
Memory: 88MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.03s
|
||||||
|
Memory: 89MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.14s
|
||||||
|
|
||||||
|
Iteration 10
|
||||||
|
Queue: [45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120]
|
||||||
|
Grounded Until: 40
|
||||||
|
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
|
||||||
|
Grounding Time: 0.07s
|
||||||
|
Memory: 91MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.04s
|
||||||
|
Memory: 93MB (+2MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.15s
|
||||||
|
|
||||||
|
Iteration 11
|
||||||
|
Queue: [50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125]
|
||||||
|
Grounded Until: 45
|
||||||
|
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
|
||||||
|
Grounding Time: 0.08s
|
||||||
|
Memory: 96MB (+3MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.16s
|
||||||
|
Memory: 98MB (+2MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.27s
|
||||||
|
|
||||||
|
Iteration 12
|
||||||
|
Queue: [55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130]
|
||||||
|
Grounded Until: 50
|
||||||
|
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
|
||||||
|
Grounding Time: 0.11s
|
||||||
|
Memory: 104MB (+6MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.77s
|
||||||
|
Memory: 111MB (+7MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.92s
|
||||||
|
|
||||||
|
Iteration 13
|
||||||
|
Queue: [60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135]
|
||||||
|
Grounded Until: 55
|
||||||
|
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
|
||||||
|
Grounding Time: 0.07s
|
||||||
|
Memory: 115MB (+4MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Answer: 1
|
||||||
|
occurs(action(("unstack","g","l")),1) occurs(action(("put-down","g")),2) occurs(action(("unstack","l","f")),3) occurs(action(("stack","l","g")),4) occurs(action(("unstack","f","c")),5) occurs(action(("put-down","f")),6) occurs(action(("unstack","c","n")),7) occurs(action(("put-down","c")),8) occurs(action(("unstack","n","e")),9) occurs(action(("stack","n","c")),10) occurs(action(("unstack","e","h")),11) occurs(action(("put-down","e")),12) occurs(action(("unstack","o","m")),13) occurs(action(("stack","o","f")),14) occurs(action(("unstack","h","d")),15) occurs(action(("put-down","h")),16) occurs(action(("unstack","l","g")),17) occurs(action(("stack","l","h")),18) occurs(action(("unstack","d","a")),19) occurs(action(("put-down","d")),20) occurs(action(("unstack","a","k")),21) occurs(action(("stack","a","k")),22) occurs(action(("unstack","a","k")),23) occurs(action(("stack","a","d")),24) occurs(action(("unstack","k","b")),25) occurs(action(("put-down","k")),26) occurs(action(("unstack","b","j")),27) occurs(action(("stack","b","k")),28) occurs(action(("unstack","j","i")),29) occurs(action(("stack","j","b")),30) occurs(action(("pick-up","i")),31) occurs(action(("stack","i","l")),32) occurs(action(("unstack","o","f")),33) occurs(action(("stack","o","i")),34) occurs(action(("unstack","n","c")),35) occurs(action(("stack","n","o")),36) occurs(action(("pick-up","c")),37) occurs(action(("stack","c","n")),38) occurs(action(("unstack","j","b")),39) occurs(action(("stack","j","f")),40) occurs(action(("unstack","a","d")),41) occurs(action(("put-down","a")),42) occurs(action(("unstack","b","k")),43) occurs(action(("stack","b","c")),44) occurs(action(("pick-up","a")),45) occurs(action(("stack","a","b")),46) occurs(action(("pick-up","m")),47) occurs(action(("stack","m","a")),48) occurs(action(("pick-up","e")),49) occurs(action(("stack","e","m")),50) occurs(action(("unstack","j","f")),51) occurs(action(("stack","j","e")),52) occurs(action(("pick-up","k")),53) occurs(action(("stack","k","j")),54) occurs(action(("pick-up","f")),55) occurs(action(("stack","f","k")),56) occurs(action(("pick-up","g")),57) occurs(action(("stack","g","f")),58) occurs(action(("pick-up","d")),59) occurs(action(("stack","d","g")),60)
|
||||||
|
Solving Time: 0.11s
|
||||||
|
Memory: 116MB (+1MB)
|
||||||
|
SAT
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 13
|
||||||
|
Time : 2.590s (Solving: 1.09s 1st Model: 0.10s Unsat: 0.99s)
|
||||||
|
CPU Time : 2.580s
|
||||||
|
|
||||||
|
Choices : 45103
|
||||||
|
Conflicts : 3020 (Analyzed: 3011)
|
||||||
|
Restarts : 32 (Average: 94.09 Last: 45)
|
||||||
|
Model-Level : 314.0
|
||||||
|
Problems : 13 (Average Length: 32.00 Splits: 0)
|
||||||
|
Lemmas : 3011 (Deleted: 1187)
|
||||||
|
Binary : 210 (Ratio: 6.97%)
|
||||||
|
Ternary : 62 (Ratio: 2.06%)
|
||||||
|
Conflict : 3011 (Average Length: 621.6 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 3011 (Average: 15.68 Max: 735 Sum: 47213)
|
||||||
|
Executed : 2895 (Average: 14.59 Max: 735 Sum: 43940 Ratio: 93.07%)
|
||||||
|
Bounded : 116 (Average: 28.22 Max: 57 Sum: 3273 Ratio: 6.93%)
|
||||||
|
|
||||||
|
Rules : 13113
|
||||||
|
Atoms : 13113
|
||||||
|
Bodies : 1 (Original: 0)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 50675 (Eliminated: 0 Frozen: 42114)
|
||||||
|
Constraints : 324812 (Binary: 93.6% Ternary: 4.0% Other: 2.5%)
|
||||||
|
|
||||||
|
Memory Peak : 122MB
|
||||||
|
Max. Length : 60 steps
|
||||||
|
Sol. Length : 60 steps
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user