Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487084970
details
property
value
status
complete
benchmark
size-12-alpha-3-num-551.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)
41.3048 seconds
cpu usage
162.25
user time
160.043
system time
2.2065
max virtual memory
1.1838332E7
max residence set size
89344.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: a(b(x1)) -> x1 a(c(x1)) -> b(c(c(a(x1)))) b(c(x1)) -> a(b(x1)) Proof: String Reversal Processor: b(a(x1)) -> x1 c(a(x1)) -> a(c(c(b(x1)))) c(b(x1)) -> b(a(x1)) DP Processor: DPs: c#(a(x1)) -> b#(x1) c#(a(x1)) -> c#(b(x1)) c#(a(x1)) -> c#(c(b(x1))) c#(b(x1)) -> b#(a(x1)) TRS: b(a(x1)) -> x1 c(a(x1)) -> a(c(c(b(x1)))) c(b(x1)) -> b(a(x1)) TDG Processor: DPs: c#(a(x1)) -> b#(x1) c#(a(x1)) -> c#(b(x1)) c#(a(x1)) -> c#(c(b(x1))) c#(b(x1)) -> b#(a(x1)) TRS: b(a(x1)) -> x1 c(a(x1)) -> a(c(c(b(x1)))) c(b(x1)) -> b(a(x1)) graph: c#(a(x1)) -> c#(c(b(x1))) -> c#(b(x1)) -> b#(a(x1)) c#(a(x1)) -> c#(c(b(x1))) -> c#(a(x1)) -> c#(c(b(x1))) c#(a(x1)) -> c#(c(b(x1))) -> c#(a(x1)) -> c#(b(x1)) c#(a(x1)) -> c#(c(b(x1))) -> c#(a(x1)) -> b#(x1) c#(a(x1)) -> c#(b(x1)) -> c#(b(x1)) -> b#(a(x1)) c#(a(x1)) -> c#(b(x1)) -> c#(a(x1)) -> c#(c(b(x1))) c#(a(x1)) -> c#(b(x1)) -> c#(a(x1)) -> c#(b(x1)) c#(a(x1)) -> c#(b(x1)) -> c#(a(x1)) -> b#(x1) SCC Processor: #sccs: 1 #rules: 2 #arcs: 8/16 DPs: c#(a(x1)) -> c#(c(b(x1))) c#(a(x1)) -> c#(b(x1)) TRS: b(a(x1)) -> x1 c(a(x1)) -> a(c(c(b(x1)))) c(b(x1)) -> b(a(x1)) Arctic Interpretation Processor: dimension: 1 usable rules: b(a(x1)) -> x1 c(a(x1)) -> a(c(c(b(x1)))) c(b(x1)) -> b(a(x1)) interpretation: [c#](x0) = x0 + 0, [a](x0) = 1x0 + 3, [b](x0) = -1x0 + 0, [c](x0) = 1x0 + 2 orientation: c#(a(x1)) = 1x1 + 3 >= x1 + 2 = c#(c(b(x1))) c#(a(x1)) = 1x1 + 3 >= -1x1 + 0 = c#(b(x1)) b(a(x1)) = x1 + 2 >= x1 = x1 c(a(x1)) = 2x1 + 4 >= 2x1 + 4 = a(c(c(b(x1)))) c(b(x1)) = x1 + 2 >= x1 + 2 = b(a(x1)) problem: DPs: TRS: b(a(x1)) -> x1 c(a(x1)) -> a(c(c(b(x1)))) c(b(x1)) -> b(a(x1)) Qed
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard