Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516968255
details
property
value
status
complete
benchmark
aprove4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
Secret_05_SRS
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
5.14766192436 seconds
cpu usage
18.642150318
max memory
3.580571648E9
stage attributes
key
value
output-size
120648
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo the bijection { log ↦ 0, s ↦ 1, half ↦ 2, 0 ↦ 3, p ↦ 4 }, it remains to prove termination of the 8-rule system { 0 1 ⟶ 1 0 2 1 , 2 3 ⟶ 3 1 1 2 , 2 1 3 ⟶ 3 , 2 1 1 ⟶ 1 2 4 1 1 , 2 2 1 1 1 1 ⟶ 1 1 2 2 , 4 1 1 1 ⟶ 1 4 1 1 , 1 1 4 1 ⟶ 1 1 , 3 ⟶ } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4 }, it remains to prove termination of the 7-rule system { 0 1 ⟶ 1 0 2 1 , 2 3 ⟶ 3 1 1 2 , 2 1 3 ⟶ 3 , 2 1 1 ⟶ 1 2 4 1 1 , 2 2 1 1 1 1 ⟶ 1 1 2 2 , 4 1 1 1 ⟶ 1 4 1 1 , 1 1 4 1 ⟶ 1 1 } Applying sparse untiling TRFCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1, 2 ↦ 2, 3 ↦ 3 }, it remains to prove termination of the 5-rule system { 0 1 ⟶ 1 0 2 1 , 2 1 1 ⟶ 1 2 3 1 1 , 2 2 1 1 1 1 ⟶ 1 1 2 2 , 3 1 1 1 ⟶ 1 3 1 1 , 1 1 3 1 ⟶ 1 1 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (1,↓) ↦ 1, (1,↑) ↦ 2, (0,↓) ↦ 3, (2,↓) ↦ 4, (2,↑) ↦ 5, (3,↓) ↦ 6, (3,↑) ↦ 7 }, it remains to prove termination of the 18-rule system { 0 1 ⟶ 2 3 4 1 , 0 1 ⟶ 0 4 1 , 0 1 ⟶ 5 1 , 5 1 1 ⟶ 2 4 6 1 1 , 5 1 1 ⟶ 5 6 1 1 , 5 1 1 ⟶ 7 1 1 , 5 4 1 1 1 1 ⟶ 2 1 4 4 , 5 4 1 1 1 1 ⟶ 2 4 4 , 5 4 1 1 1 1 ⟶ 5 4 , 5 4 1 1 1 1 ⟶ 5 , 7 1 1 1 ⟶ 2 6 1 1 , 7 1 1 1 ⟶ 7 1 1 , 2 1 6 1 ⟶ 2 1 , 3 1 →= 1 3 4 1 , 4 1 1 →= 1 4 6 1 1 , 4 4 1 1 1 1 →= 1 1 4 4 , 6 1 1 1 →= 1 6 1 1 , 1 1 6 1 →= 1 1 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 0 ⎟
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard