details

property	value
status	complete
benchmark	ExProp7_Luc06_FR.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n178.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0741571 seconds
cpu usage	0.058119
user time	0.025864
system time	0.032255
max virtual memory	113188.0
max residence set size	5480.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S) (RULES 0 -> n__0 activate(n__0) -> 0 activate(n__f(X:S)) -> f(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X:S) -> n__f(X:S) p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__f(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__f(X:S)) -> F(activate(X:S)) ACTIVATE(n__s(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__s(X:S)) -> S(activate(X:S)) F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X:S)) -> f(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X:S) -> n__f(X:S) p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__f(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__f(X:S)) -> F(activate(X:S)) ACTIVATE(n__s(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__s(X:S)) -> S(activate(X:S)) F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X:S)) -> f(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X:S) -> n__f(X:S) p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(0)) -> F(p(s(0))) ->->-> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X:S)) -> f(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X:S) -> n__f(X:S) p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) ->->Cycle: ->->-> Pairs: ACTIVATE(n__f(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__s(X:S)) -> ACTIVATE(X:S) ->->-> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X:S)) -> f(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X:S) -> n__f(X:S) p(s(X:S)) -> X:S s(X:S) -> n__s(X:S) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard