details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.292228 seconds
cpu usage	0.290733
user time	0.230615
system time	0.060118
max virtual memory	113188.0
max residence set size	5604.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x0:S x1:S x2:S x3:S) (RULES p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(b(x1:S))),p(a(a(x0:S)),x3:S)) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(x0:S)),x3:S) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) -> Rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) Problem 1: SCC Processor: -> Pairs: P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(b(x1:S))),p(a(a(x0:S)),x3:S)) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(x0:S)),x3:S) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) -> Rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(b(x1:S))),p(a(a(x0:S)),x3:S)) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(x0:S)),x3:S) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) ->->-> Rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) Problem 1: Reduction Pair Processor: -> Pairs: P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(b(x1:S))),p(a(a(x0:S)),x3:S)) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(x0:S)),x3:S) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) -> Rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) -> Usable rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [p](X1,X2) = X1 + X2 + 2 [a](X) = 2.X [b](X) = 0 [P](X1,X2) = 2.X1 + 2.X2 Problem 1: SCC Processor: -> Pairs: P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(x0:S)),x3:S) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) -> Rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(x0:S)),x3:S) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) ->->-> Rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) Problem 1: Reduction Pair Processor: -> Pairs: P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(a(a(x0:S)),x3:S) P(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> P(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) -> Rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) -> Usable rules: p(a(a(x0:S)),p(x1:S,p(a(x2:S),x3:S))) -> p(x2:S,p(a(a(b(x1:S))),p(a(a(x0:S)),x3:S))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [p](X1,X2) = 2.X1 + X2 + 2 popout

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

job log

popout

actions

all output return to TRS Standard