Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487092956
details
property
value
status
complete
benchmark
#4.31.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
AG01_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
87.7237 seconds
cpu usage
87.503
user time
80.2092
system time
7.29382
max virtual memory
751928.0
max residence set size
44440.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES a(c(x:S)) -> x:S a(d(x:S)) -> d(c(b(a(x:S)))) b(c(x:S)) -> c(d(a(b(x:S)))) b(d(x:S)) -> x:S ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A(d(x:S)) -> A(x:S) A(d(x:S)) -> B(a(x:S)) B(c(x:S)) -> A(b(x:S)) B(c(x:S)) -> B(x:S) -> Rules: a(c(x:S)) -> x:S a(d(x:S)) -> d(c(b(a(x:S)))) b(c(x:S)) -> c(d(a(b(x:S)))) b(d(x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: A(d(x:S)) -> A(x:S) A(d(x:S)) -> B(a(x:S)) B(c(x:S)) -> A(b(x:S)) B(c(x:S)) -> B(x:S) -> Rules: a(c(x:S)) -> x:S a(d(x:S)) -> d(c(b(a(x:S)))) b(c(x:S)) -> c(d(a(b(x:S)))) b(d(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(d(x:S)) -> A(x:S) A(d(x:S)) -> B(a(x:S)) B(c(x:S)) -> A(b(x:S)) B(c(x:S)) -> B(x:S) ->->-> Rules: a(c(x:S)) -> x:S a(d(x:S)) -> d(c(b(a(x:S)))) b(c(x:S)) -> c(d(a(b(x:S)))) b(d(x:S)) -> x:S Problem 1: Narrowing Processor: -> Pairs: A(d(x:S)) -> A(x:S) A(d(x:S)) -> B(a(x:S)) B(c(x:S)) -> A(b(x:S)) B(c(x:S)) -> B(x:S) -> Rules: a(c(x:S)) -> x:S a(d(x:S)) -> d(c(b(a(x:S)))) b(c(x:S)) -> c(d(a(b(x:S)))) b(d(x:S)) -> x:S ->Narrowed Pairs: ->->Original Pair: A(d(x:S)) -> B(a(x:S)) ->-> Narrowed pairs: A(d(c(x:S))) -> B(x:S) A(d(d(x:S))) -> B(d(c(b(a(x:S))))) ->->Original Pair: B(c(x:S)) -> A(b(x:S)) ->-> Narrowed pairs: B(c(c(x:S))) -> A(c(d(a(b(x:S))))) B(c(d(x:S))) -> A(x:S) Problem 1: SCC Processor: -> Pairs: A(d(c(x:S))) -> B(x:S) A(d(d(x:S))) -> B(d(c(b(a(x:S))))) A(d(x:S)) -> A(x:S) B(c(c(x:S))) -> A(c(d(a(b(x:S))))) B(c(d(x:S))) -> A(x:S) B(c(x:S)) -> B(x:S) -> Rules: a(c(x:S)) -> x:S a(d(x:S)) -> d(c(b(a(x:S)))) b(c(x:S)) -> c(d(a(b(x:S)))) b(d(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(d(c(x:S))) -> B(x:S) A(d(x:S)) -> A(x:S) B(c(d(x:S))) -> A(x:S) B(c(x:S)) -> B(x:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost