Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072797
details
property
value
status
complete
benchmark
4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.64818 seconds
cpu usage
5.40659
user time
4.29926
system time
1.10733
max virtual memory
5966548.0
max residence set size
86048.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) Proof: DP Processor: DPs: c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) a#(0(),x) -> c#(c(x)) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) TDG Processor: DPs: c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) a#(0(),x) -> c#(c(x)) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) graph: a#(0(),x) -> c#(c(x)) -> c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(c(x)) -> c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(x) -> c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) -> c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(c(x)) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(x) c#(c(x)) -> c#(b(c(x))) -> c#(c(x)) -> c#(b(c(x))) c#(c(x)) -> c#(b(c(x))) -> c#(c(b(c(x)))) -> a#(0(),c(x)) EDG Processor: DPs: c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) a#(0(),x) -> c#(c(x)) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) graph: a#(0(),x) -> c#(c(x)) -> c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(c(x)) -> c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) -> c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(x) -> c#(c(x)) -> c#(b(c(x))) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(x) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(c(x)) SCC Processor: #sccs: 1 #rules: 3 #arcs: 6/16 DPs: a#(0(),x) -> c#(c(x)) c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(x) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) Arctic Interpretation Processor: dimension: 1 usable rules: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) interpretation: [c#](x0) = x0 + 0, [b](x0) = x0 + 0, [a](x0, x1) = x0 + 2x1 + 1, [a#](x0, x1) = x0 + 1x1 + 0, [c](x0) = 1x0 + 0, [0] = 1 orientation: a#(0(),x) = 1x + 1 >= 1x + 0 = c#(c(x)) c#(c(b(c(x)))) = 2x + 1 >= 2x + 1 = a#(0(),c(x)) a#(0(),x) = 1x + 1 >= x + 0 = c#(x) c(c(b(c(x)))) = 3x + 2 >= 3x + 2 = b(a(0(),c(x))) c(c(x)) = 2x + 1 >= 2x + 1 = b(c(b(c(x)))) a(0(),x) = 2x + 1 >= 2x + 1 = c(c(x)) problem: DPs: a#(0(),x) -> c#(c(x)) c#(c(b(c(x)))) -> a#(0(),c(x))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard