Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487091576
details
property
value
status
complete
benchmark
z086.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
Zantema_04
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
45.0838 seconds
cpu usage
176.408
user time
172.499
system time
3.90899
max virtual memory
1.1869528E7
max residence set size
102120.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: a(a(x1)) -> c(b(x1)) b(b(x1)) -> c(a(x1)) c(c(x1)) -> b(a(x1)) Proof: String Reversal Processor: a(a(x1)) -> b(c(x1)) b(b(x1)) -> a(c(x1)) c(c(x1)) -> a(b(x1)) DP Processor: DPs: a#(a(x1)) -> c#(x1) a#(a(x1)) -> b#(c(x1)) b#(b(x1)) -> c#(x1) b#(b(x1)) -> a#(c(x1)) c#(c(x1)) -> b#(x1) c#(c(x1)) -> a#(b(x1)) TRS: a(a(x1)) -> b(c(x1)) b(b(x1)) -> a(c(x1)) c(c(x1)) -> a(b(x1)) TDG Processor: DPs: a#(a(x1)) -> c#(x1) a#(a(x1)) -> b#(c(x1)) b#(b(x1)) -> c#(x1) b#(b(x1)) -> a#(c(x1)) c#(c(x1)) -> b#(x1) c#(c(x1)) -> a#(b(x1)) TRS: a(a(x1)) -> b(c(x1)) b(b(x1)) -> a(c(x1)) c(c(x1)) -> a(b(x1)) graph: b#(b(x1)) -> c#(x1) -> c#(c(x1)) -> a#(b(x1)) b#(b(x1)) -> c#(x1) -> c#(c(x1)) -> b#(x1) b#(b(x1)) -> a#(c(x1)) -> a#(a(x1)) -> b#(c(x1)) b#(b(x1)) -> a#(c(x1)) -> a#(a(x1)) -> c#(x1) c#(c(x1)) -> b#(x1) -> b#(b(x1)) -> a#(c(x1)) c#(c(x1)) -> b#(x1) -> b#(b(x1)) -> c#(x1) c#(c(x1)) -> a#(b(x1)) -> a#(a(x1)) -> b#(c(x1)) c#(c(x1)) -> a#(b(x1)) -> a#(a(x1)) -> c#(x1) a#(a(x1)) -> b#(c(x1)) -> b#(b(x1)) -> a#(c(x1)) a#(a(x1)) -> b#(c(x1)) -> b#(b(x1)) -> c#(x1) a#(a(x1)) -> c#(x1) -> c#(c(x1)) -> a#(b(x1)) a#(a(x1)) -> c#(x1) -> c#(c(x1)) -> b#(x1) Arctic Interpretation Processor: dimension: 1 usable rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> a(c(x1)) c(c(x1)) -> a(b(x1)) interpretation: [c#](x0) = x0 + 0, [b](x0) = 2x0 + 0, [a#](x0) = x0 + 0, [b#](x0) = x0, [a](x0) = 2x0 + 0, [c](x0) = 2x0 + 0 orientation: a#(a(x1)) = 2x1 + 0 >= x1 + 0 = c#(x1) a#(a(x1)) = 2x1 + 0 >= 2x1 + 0 = b#(c(x1)) b#(b(x1)) = 2x1 + 0 >= x1 + 0 = c#(x1) b#(b(x1)) = 2x1 + 0 >= 2x1 + 0 = a#(c(x1)) c#(c(x1)) = 2x1 + 0 >= x1 = b#(x1) c#(c(x1)) = 2x1 + 0 >= 2x1 + 0 = a#(b(x1)) a(a(x1)) = 4x1 + 2 >= 4x1 + 2 = b(c(x1)) b(b(x1)) = 4x1 + 2 >= 4x1 + 2 = a(c(x1)) c(c(x1)) = 4x1 + 2 >= 4x1 + 2 = a(b(x1)) problem: DPs: a#(a(x1)) -> c#(x1) a#(a(x1)) -> b#(c(x1)) b#(b(x1)) -> c#(x1) b#(b(x1)) -> a#(c(x1)) c#(c(x1)) -> a#(b(x1)) TRS: a(a(x1)) -> b(c(x1)) b(b(x1)) -> a(c(x1)) c(c(x1)) -> a(b(x1)) Restore Modifier: DPs: a#(a(x1)) -> c#(x1) a#(a(x1)) -> b#(c(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard