details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0644 seconds
cpu usage	0.068028
user time	0.031335
system time	0.036693
max virtual memory	113188.0
max residence set size	5476.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES f(c(x:S),y:S) -> f(x:S,s(x:S)) f(s(x:S),y:S) -> f(x:S,s(x:S)) f(x:S,s(y:S)) -> f(y:S,x:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(c(x:S),y:S) -> F(x:S,s(x:S)) F(s(x:S),y:S) -> F(x:S,s(x:S)) F(x:S,s(y:S)) -> F(y:S,x:S) -> Rules: f(c(x:S),y:S) -> f(x:S,s(x:S)) f(s(x:S),y:S) -> f(x:S,s(x:S)) f(x:S,s(y:S)) -> f(y:S,x:S) Problem 1: SCC Processor: -> Pairs: F(c(x:S),y:S) -> F(x:S,s(x:S)) F(s(x:S),y:S) -> F(x:S,s(x:S)) F(x:S,s(y:S)) -> F(y:S,x:S) -> Rules: f(c(x:S),y:S) -> f(x:S,s(x:S)) f(s(x:S),y:S) -> f(x:S,s(x:S)) f(x:S,s(y:S)) -> f(y:S,x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(c(x:S),y:S) -> F(x:S,s(x:S)) F(s(x:S),y:S) -> F(x:S,s(x:S)) F(x:S,s(y:S)) -> F(y:S,x:S) ->->-> Rules: f(c(x:S),y:S) -> f(x:S,s(x:S)) f(s(x:S),y:S) -> f(x:S,s(x:S)) f(x:S,s(y:S)) -> f(y:S,x:S) Problem 1: Reduction Pair Processor: -> Pairs: F(c(x:S),y:S) -> F(x:S,s(x:S)) F(s(x:S),y:S) -> F(x:S,s(x:S)) F(x:S,s(y:S)) -> F(y:S,x:S) -> Rules: f(c(x:S),y:S) -> f(x:S,s(x:S)) f(s(x:S),y:S) -> f(x:S,s(x:S)) f(x:S,s(y:S)) -> f(y:S,x:S) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [c](X) = 2.X + 2 [s](X) = 2.X [F](X1,X2) = 2.X1 + X2 Problem 1: SCC Processor: -> Pairs: F(s(x:S),y:S) -> F(x:S,s(x:S)) F(x:S,s(y:S)) -> F(y:S,x:S) -> Rules: f(c(x:S),y:S) -> f(x:S,s(x:S)) f(s(x:S),y:S) -> f(x:S,s(x:S)) f(x:S,s(y:S)) -> f(y:S,x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(x:S),y:S) -> F(x:S,s(x:S)) F(x:S,s(y:S)) -> F(y:S,x:S) ->->-> Rules: f(c(x:S),y:S) -> f(x:S,s(x:S)) f(s(x:S),y:S) -> f(x:S,s(x:S)) f(x:S,s(y:S)) -> f(y:S,x:S) Problem 1: Reduction Pair Processor: -> Pairs: F(s(x:S),y:S) -> F(x:S,s(x:S)) F(x:S,s(y:S)) -> F(y:S,x:S) -> Rules: f(c(x:S),y:S) -> f(x:S,s(x:S)) popout

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

job log

popout

actions

all output return to TRS Standard