Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487085510
details
property
value
status
complete
benchmark
size-12-alpha-3-num-473.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
44.1535 seconds
cpu usage
172.9
user time
169.376
system time
3.52452
max virtual memory
1.1648316E7
max residence set size
102108.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: a(a(x1)) -> a(b(x1)) a(c(x1)) -> b(x1) b(b(x1)) -> c(b(a(x1))) Proof: String Reversal Processor: a(a(x1)) -> b(a(x1)) c(a(x1)) -> b(x1) b(b(x1)) -> a(b(c(x1))) DP Processor: DPs: a#(a(x1)) -> b#(a(x1)) c#(a(x1)) -> b#(x1) b#(b(x1)) -> c#(x1) b#(b(x1)) -> b#(c(x1)) b#(b(x1)) -> a#(b(c(x1))) TRS: a(a(x1)) -> b(a(x1)) c(a(x1)) -> b(x1) b(b(x1)) -> a(b(c(x1))) TDG Processor: DPs: a#(a(x1)) -> b#(a(x1)) c#(a(x1)) -> b#(x1) b#(b(x1)) -> c#(x1) b#(b(x1)) -> b#(c(x1)) b#(b(x1)) -> a#(b(c(x1))) TRS: a(a(x1)) -> b(a(x1)) c(a(x1)) -> b(x1) b(b(x1)) -> a(b(c(x1))) graph: c#(a(x1)) -> b#(x1) -> b#(b(x1)) -> a#(b(c(x1))) c#(a(x1)) -> b#(x1) -> b#(b(x1)) -> b#(c(x1)) c#(a(x1)) -> b#(x1) -> b#(b(x1)) -> c#(x1) b#(b(x1)) -> c#(x1) -> c#(a(x1)) -> b#(x1) b#(b(x1)) -> b#(c(x1)) -> b#(b(x1)) -> a#(b(c(x1))) b#(b(x1)) -> b#(c(x1)) -> b#(b(x1)) -> b#(c(x1)) b#(b(x1)) -> b#(c(x1)) -> b#(b(x1)) -> c#(x1) b#(b(x1)) -> a#(b(c(x1))) -> a#(a(x1)) -> b#(a(x1)) a#(a(x1)) -> b#(a(x1)) -> b#(b(x1)) -> a#(b(c(x1))) a#(a(x1)) -> b#(a(x1)) -> b#(b(x1)) -> b#(c(x1)) a#(a(x1)) -> b#(a(x1)) -> b#(b(x1)) -> c#(x1) Arctic Interpretation Processor: dimension: 1 usable rules: a(a(x1)) -> b(a(x1)) c(a(x1)) -> b(x1) b(b(x1)) -> a(b(c(x1))) interpretation: [b#](x0) = 8x0, [b](x0) = 2x0 + 8, [a#](x0) = 8x0 + 0, [c#](x0) = 9x0 + 1, [a](x0) = 2x0 + 8, [c](x0) = x0 + 6 orientation: a#(a(x1)) = 10x1 + 16 >= 10x1 + 16 = b#(a(x1)) c#(a(x1)) = 11x1 + 17 >= 8x1 = b#(x1) b#(b(x1)) = 10x1 + 16 >= 9x1 + 1 = c#(x1) b#(b(x1)) = 10x1 + 16 >= 8x1 + 14 = b#(c(x1)) b#(b(x1)) = 10x1 + 16 >= 10x1 + 16 = a#(b(c(x1))) a(a(x1)) = 4x1 + 10 >= 4x1 + 10 = b(a(x1)) c(a(x1)) = 2x1 + 8 >= 2x1 + 8 = b(x1) b(b(x1)) = 4x1 + 10 >= 4x1 + 10 = a(b(c(x1))) problem: DPs: a#(a(x1)) -> b#(a(x1)) b#(b(x1)) -> a#(b(c(x1))) TRS: a(a(x1)) -> b(a(x1)) c(a(x1)) -> b(x1) b(b(x1)) -> a(b(c(x1))) Restore Modifier: DPs: a#(a(x1)) -> b#(a(x1)) b#(b(x1)) -> a#(b(c(x1))) TRS: a(a(x1)) -> b(a(x1)) c(a(x1)) -> b(x1) b(b(x1)) -> a(b(c(x1))) EDG Processor: DPs: a#(a(x1)) -> b#(a(x1)) b#(b(x1)) -> a#(b(c(x1)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard