Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516970901
details
property
value
status
complete
benchmark
86745.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n117.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
12.2148108482 seconds
cpu usage
47.445868337
max memory
3.980791808E9
stage attributes
key
value
output-size
42058
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4, 5 ↦ 5 }, it remains to prove termination of the 30-rule system { 0 1 2 1 ⟶ 3 3 2 , 1 2 3 2 ⟶ 3 4 4 2 , 0 5 1 4 1 ⟶ 4 1 4 3 , 4 3 0 2 2 ⟶ 4 1 1 4 5 , 5 5 1 5 2 ⟶ 4 3 5 2 , 0 4 3 3 4 4 1 ⟶ 4 4 2 5 0 2 2 , 2 0 4 1 2 2 1 3 ⟶ 2 3 0 4 5 5 1 1 , 1 2 2 1 5 2 1 2 1 ⟶ 1 2 2 2 0 2 4 4 3 , 4 5 1 4 3 4 3 5 4 3 ⟶ 4 3 2 0 2 4 3 2 3 , 1 4 1 2 5 3 4 3 3 2 2 ⟶ 0 0 1 4 0 4 5 2 3 0 4 , 4 5 1 3 2 2 5 4 3 5 4 ⟶ 4 0 1 1 5 3 5 4 2 2 4 , 5 1 4 0 1 5 5 3 3 0 3 2 ⟶ 3 0 5 3 2 0 1 0 4 1 2 , 0 4 1 1 3 3 2 5 4 2 2 1 3 ⟶ 1 0 1 4 3 4 4 2 3 4 2 2 1 , 5 1 3 3 5 3 1 3 2 1 2 0 4 ⟶ 2 2 3 2 3 2 3 5 2 5 1 4 , 0 5 3 5 3 3 3 3 4 5 5 5 4 4 ⟶ 0 1 0 3 2 3 4 0 5 5 2 4 0 , 1 5 0 1 0 4 4 2 2 3 4 1 4 1 ⟶ 3 4 5 0 0 4 0 3 5 0 4 1 5 4 , 5 1 0 5 2 2 2 3 3 2 5 1 5 1 ⟶ 5 4 0 1 4 3 2 2 3 3 3 5 5 1 , 5 1 2 2 4 0 2 4 2 5 2 1 4 0 5 ⟶ 0 1 4 3 0 5 3 4 3 3 1 4 1 5 , 0 4 0 3 2 0 2 1 2 0 0 2 4 2 3 4 ⟶ 3 2 1 3 3 4 5 5 4 0 3 2 1 2 3 , 1 5 1 3 3 3 0 4 0 2 3 1 5 1 4 2 ⟶ 3 4 0 5 0 4 4 0 2 1 3 1 4 0 4 2 , 5 1 1 0 0 3 2 5 0 3 4 2 1 2 5 1 ⟶ 5 1 3 2 1 0 1 0 5 5 3 1 1 4 1 0 , 3 2 1 2 4 2 1 1 3 3 3 5 2 2 0 4 4 ⟶ 3 2 3 1 0 2 0 2 4 5 5 4 1 0 0 2 5 0 , 4 1 0 3 0 4 3 2 2 1 3 2 2 4 0 2 4 ⟶ 4 2 5 3 3 3 1 2 4 5 3 5 3 5 1 3 4 , 3 0 0 2 1 1 3 5 1 2 2 2 5 1 0 0 0 1 ⟶ 3 5 1 0 4 0 1 2 2 5 0 3 4 3 5 5 4 3 , 4 5 5 1 5 3 5 3 2 0 4 4 2 1 0 3 5 3 ⟶ 4 4 0 5 1 3 5 5 3 4 4 0 0 4 3 0 0 0 , 4 5 5 2 5 1 0 2 1 0 1 4 4 4 2 1 5 1 ⟶ 4 3 2 3 0 2 5 3 4 1 4 4 5 1 1 4 0 , 0 2 0 2 2 0 1 1 2 4 1 1 0 3 3 2 1 4 1 4 ⟶ 2 2 3 3 0 2 1 3 5 3 4 4 1 2 4 4 4 4 4 0 , 3 4 1 1 0 3 4 0 5 5 5 5 3 5 2 3 2 3 1 3 ⟶ 3 4 3 4 3 1 0 1 1 4 5 5 2 3 2 3 0 2 3 , 4 5 2 3 5 4 5 0 5 1 2 3 0 1 1 0 3 5 0 3 0 ⟶ 4 4 3 1 4 4 0 5 3 5 2 1 4 2 4 1 0 2 4 5 0 , 5 1 4 0 0 3 4 2 3 0 3 5 4 0 4 2 4 0 0 5 0 ⟶ 5 0 3 2 2 0 4 1 1 5 3 0 1 5 0 1 3 2 2 3 } The system was reversed. After renaming modulo the bijection { 1 ↦ 0, 2 ↦ 1, 0 ↦ 2, 3 ↦ 3, 4 ↦ 4, 5 ↦ 5 }, it remains to prove termination of the 30-rule system { 0 1 0 2 ⟶ 1 3 3 , 1 3 1 0 ⟶ 1 4 4 3 , 0 4 0 5 2 ⟶ 3 4 0 4 , 1 1 2 3 4 ⟶ 5 4 0 0 4 , 1 5 0 5 5 ⟶ 1 5 3 4 , 0 4 4 3 3 4 2 ⟶ 1 1 2 5 1 4 4 , 3 0 1 1 0 4 2 1 ⟶ 0 0 5 5 4 2 3 1 , 0 1 0 1 5 0 1 1 0 ⟶ 3 4 4 1 2 1 1 1 0 , 3 4 5 3 4 3 4 0 5 4 ⟶ 3 1 3 4 1 2 1 3 4 , 1 1 3 3 4 3 5 1 0 4 0 ⟶ 4 2 3 1 5 4 2 4 0 2 2 , 4 5 3 4 5 1 1 3 0 5 4 ⟶ 4 1 1 4 5 3 5 0 0 2 4 , 1 3 2 3 3 5 5 0 2 4 0 5 ⟶ 1 0 4 2 0 2 1 3 5 2 3 , 3 0 1 1 4 5 1 3 3 0 0 4 2 ⟶ 0 1 1 4 3 1 4 4 3 4 0 2 0 , 4 2 1 0 1 3 0 3 5 3 3 0 5 ⟶ 4 0 5 1 5 3 1 3 1 3 1 1 , 4 4 5 5 5 4 3 3 3 3 5 3 5 2 ⟶ 2 4 1 5 5 2 4 3 1 3 2 0 2 , 0 4 0 4 3 1 1 4 4 2 0 2 5 0 ⟶ 4 5 0 4 2 5 3 2 4 2 2 5 4 3 , 0 5 0 5 1 3 3 1 1 1 5 2 0 5 ⟶ 0 5 5 3 3 3 1 1 3 4 0 2 4 5 , 5 2 4 0 1 5 1 4 1 2 4 1 1 0 5 ⟶ 5 0 4 0 3 3 4 3 5 2 3 4 0 2 , 4 3 1 4 1 2 2 1 0 1 2 1 3 2 4 2 ⟶ 3 1 0 1 3 2 4 5 5 4 3 3 0 1 3 , 1 4 0 5 0 3 1 2 4 2 3 3 3 0 5 0 ⟶ 1 4 2 4 0 3 0 1 2 4 4 2 5 2 4 3 , 0 5 1 0 1 4 3 2 5 1 3 2 2 0 0 5 ⟶ 2 0 4 0 0 3 5 5 2 0 2 0 1 3 0 5 , 4 4 2 1 1 5 3 3 3 0 0 1 4 1 0 1 3 ⟶ 2 5 1 2 2 0 4 5 5 4 1 2 1 2 0 3 1 3 , 4 1 2 4 1 1 3 0 1 1 3 4 2 3 2 0 4 ⟶ 4 3 0 5 3 5 3 5 4 1 0 3 3 3 5 1 4 , 0 2 2 2 0 5 1 1 1 0 5 3 0 0 1 2 2 3 ⟶ 3 4 5 5 3 4 3 2 5 1 1 0 2 4 2 0 5 3 , 3 5 3 2 0 1 4 4 2 1 3 5 3 5 0 5 5 4 ⟶ 2 2 2 3 4 2 2 4 4 3 5 5 3 0 5 2 4 4 , 0 5 0 1 4 4 4 0 2 0 1 2 0 5 1 5 5 4 ⟶ 2 4 0 0 5 4 4 0 4 3 5 1 2 3 1 3 4 , 4 0 4 0 1 3 3 2 0 0 4 1 0 0 2 1 1 2 1 2 ⟶ 2 4 4 4 4 4 1 0 4 4 3 5 3 0 1 2 3 3 1 1 , 3 0 3 1 3 1 5 3 5 5 5 5 2 4 3 2 0 0 4 3 ⟶ 3 1 2 3 1 3 1 5 5 4 0 0 2 0 3 4 3 4 3 , 2 3 2 5 3 2 0 0 2 3 1 0 5 2 5 4 5 3 1 5 4 ⟶ 2 5 4 1 2 0 4 1 4 0 1 5 3 5 2 4 4 0 3 4 4 , 2 5 2 2 4 1 4 2 4 5 3 2 3 1 4 3 2 2 4 0 5 ⟶ 3 1 1 3 0 2 5 0 2 3 5 0 0 4 2 1 1 3 2 5 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (1,↓) ↦ 1, (0,↓) ↦ 2, (2,↓) ↦ 3, (1,↑) ↦ 4, (3,↓) ↦ 5, (3,↑) ↦ 6, (4,↓) ↦ 7, (4,↑) ↦ 8, (5,↓) ↦ 9, (5,↑) ↦ 10, (2,↑) ↦ 11 }, it remains to prove termination of the 390-rule system { 0 1 2 3 ⟶ 4 5 5 , 0 1 2 3 ⟶ 6 5 , 0 1 2 3 ⟶ 6 , 4 5 1 2 ⟶ 4 7 7 5 , 4 5 1 2 ⟶ 8 7 5 , 4 5 1 2 ⟶ 8 5 , 4 5 1 2 ⟶ 6 , 0 7 2 9 3 ⟶ 6 7 2 7 , 0 7 2 9 3 ⟶ 8 2 7 , 0 7 2 9 3 ⟶ 0 7 , 0 7 2 9 3 ⟶ 8 , 4 1 3 5 7 ⟶ 10 7 2 2 7 , 4 1 3 5 7 ⟶ 8 2 2 7 , 4 1 3 5 7 ⟶ 0 2 7 , 4 1 3 5 7 ⟶ 0 7 , 4 9 2 9 9 ⟶ 4 9 5 7 , 4 9 2 9 9 ⟶ 10 5 7 , 4 9 2 9 9 ⟶ 6 7 , 4 9 2 9 9 ⟶ 8 , 0 7 7 5 5 7 3 ⟶ 4 1 3 9 1 7 7 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard