Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487091520
details
property
value
status
complete
benchmark
z110.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
1.89445 seconds
cpu usage
1.27931
user time
0.890944
system time
0.388365
max virtual memory
706128.0
max residence set size
6188.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES a(a(x1:S)) -> b(x1:S) b(a(x1:S)) -> a(b(x1:S)) b(b(c(x1:S))) -> c(a(x1:S)) b(b(x1:S)) -> a(a(a(x1:S))) c(a(x1:S)) -> b(a(c(x1:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(a(x1:S)) -> B(x1:S) B(a(x1:S)) -> A(b(x1:S)) B(a(x1:S)) -> B(x1:S) B(b(c(x1:S))) -> A(x1:S) B(b(c(x1:S))) -> C(a(x1:S)) B(b(x1:S)) -> A(a(a(x1:S))) B(b(x1:S)) -> A(a(x1:S)) B(b(x1:S)) -> A(x1:S) C(a(x1:S)) -> A(c(x1:S)) C(a(x1:S)) -> B(a(c(x1:S))) C(a(x1:S)) -> C(x1:S) -> Rules: a(a(x1:S)) -> b(x1:S) b(a(x1:S)) -> a(b(x1:S)) b(b(c(x1:S))) -> c(a(x1:S)) b(b(x1:S)) -> a(a(a(x1:S))) c(a(x1:S)) -> b(a(c(x1:S))) Problem 1: SCC Processor: -> Pairs: A(a(x1:S)) -> B(x1:S) B(a(x1:S)) -> A(b(x1:S)) B(a(x1:S)) -> B(x1:S) B(b(c(x1:S))) -> A(x1:S) B(b(c(x1:S))) -> C(a(x1:S)) B(b(x1:S)) -> A(a(a(x1:S))) B(b(x1:S)) -> A(a(x1:S)) B(b(x1:S)) -> A(x1:S) C(a(x1:S)) -> A(c(x1:S)) C(a(x1:S)) -> B(a(c(x1:S))) C(a(x1:S)) -> C(x1:S) -> Rules: a(a(x1:S)) -> b(x1:S) b(a(x1:S)) -> a(b(x1:S)) b(b(c(x1:S))) -> c(a(x1:S)) b(b(x1:S)) -> a(a(a(x1:S))) c(a(x1:S)) -> b(a(c(x1:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(a(x1:S)) -> B(x1:S) B(a(x1:S)) -> A(b(x1:S)) B(a(x1:S)) -> B(x1:S) B(b(c(x1:S))) -> A(x1:S) B(b(c(x1:S))) -> C(a(x1:S)) B(b(x1:S)) -> A(a(a(x1:S))) B(b(x1:S)) -> A(a(x1:S)) B(b(x1:S)) -> A(x1:S) C(a(x1:S)) -> A(c(x1:S)) C(a(x1:S)) -> B(a(c(x1:S))) C(a(x1:S)) -> C(x1:S) ->->-> Rules: a(a(x1:S)) -> b(x1:S) b(a(x1:S)) -> a(b(x1:S)) b(b(c(x1:S))) -> c(a(x1:S)) b(b(x1:S)) -> a(a(a(x1:S))) c(a(x1:S)) -> b(a(c(x1:S))) Problem 1: Reduction Pair Processor: -> Pairs: A(a(x1:S)) -> B(x1:S) B(a(x1:S)) -> A(b(x1:S)) B(a(x1:S)) -> B(x1:S) B(b(c(x1:S))) -> A(x1:S) B(b(c(x1:S))) -> C(a(x1:S)) B(b(x1:S)) -> A(a(a(x1:S))) B(b(x1:S)) -> A(a(x1:S)) B(b(x1:S)) -> A(x1:S) C(a(x1:S)) -> A(c(x1:S)) C(a(x1:S)) -> B(a(c(x1:S))) C(a(x1:S)) -> C(x1:S) -> Rules: a(a(x1:S)) -> b(x1:S) b(a(x1:S)) -> a(b(x1:S)) b(b(c(x1:S))) -> c(a(x1:S)) b(b(x1:S)) -> a(a(a(x1:S))) c(a(x1:S)) -> b(a(c(x1:S))) -> Usable rules: a(a(x1:S)) -> b(x1:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard