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