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