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