details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0770211219788 seconds
cpu usage	0.072103252
max memory	4063232.0

stage attributes

key	value
output-size	2728
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x y) (RULES a(y,0) -> b(y,0) b(b(0,y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0))) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(y,0) -> B(y,0) C(c(c(y))) -> A(a(c(b(0,y)),0),0) C(c(c(y))) -> A(c(b(0,y)),0) C(c(c(y))) -> C(a(a(c(b(0,y)),0),0)) C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0))) -> Rules: a(y,0) -> b(y,0) b(b(0,y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0))) Problem 1: SCC Processor: -> Pairs: A(y,0) -> B(y,0) C(c(c(y))) -> A(a(c(b(0,y)),0),0) C(c(c(y))) -> A(c(b(0,y)),0) C(c(c(y))) -> C(a(a(c(b(0,y)),0),0)) C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0))) -> Rules: a(y,0) -> b(y,0) b(b(0,y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C(c(c(y))) -> C(a(a(c(b(0,y)),0),0)) C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0))) ->->-> Rules: a(y,0) -> b(y,0) b(b(0,y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0))) Problem 1: Reduction Pair Processor: -> Pairs: C(c(c(y))) -> C(a(a(c(b(0,y)),0),0)) C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0))) -> Rules: a(y,0) -> b(y,0) b(b(0,y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0))) -> Usable rules: a(y,0) -> b(y,0) b(b(0,y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a](X1,X2) = X1 [b](X1,X2) = X1 + X2 [c](X) = 2.X + 2 [0] = 0 [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0))) -> Rules: a(y,0) -> b(y,0) b(b(0,y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0))) ->->-> Rules: a(y,0) -> b(y,0) b(b(0,y),x) -> y popout

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

job log

popout

actions

all output return to TRS Stand 20472