details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.112102031708 seconds
cpu usage	0.03706435
max memory	3112960.0

stage attributes

key	value
output-size	1909
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 v_NonEmpty:S a:S k:S x:S y:S) (RULES f(cons(a:S,k:S),y:S) -> f(y:S,k:S) f(empty,cons(a:S,k:S)) -> f(cons(a:S,k:S),k:S) f(x:S,empty) -> x:S ) Problem 1: Dependency Pairs Processor: -> Pairs: F(cons(a:S,k:S),y:S) -> F(y:S,k:S) F(empty,cons(a:S,k:S)) -> F(cons(a:S,k:S),k:S) -> Rules: f(cons(a:S,k:S),y:S) -> f(y:S,k:S) f(empty,cons(a:S,k:S)) -> f(cons(a:S,k:S),k:S) f(x:S,empty) -> x:S Problem 1: SCC Processor: -> Pairs: F(cons(a:S,k:S),y:S) -> F(y:S,k:S) F(empty,cons(a:S,k:S)) -> F(cons(a:S,k:S),k:S) -> Rules: f(cons(a:S,k:S),y:S) -> f(y:S,k:S) f(empty,cons(a:S,k:S)) -> f(cons(a:S,k:S),k:S) f(x:S,empty) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(cons(a:S,k:S),y:S) -> F(y:S,k:S) F(empty,cons(a:S,k:S)) -> F(cons(a:S,k:S),k:S) ->->-> Rules: f(cons(a:S,k:S),y:S) -> f(y:S,k:S) f(empty,cons(a:S,k:S)) -> f(cons(a:S,k:S),k:S) f(x:S,empty) -> x:S Problem 1: Reduction Pair Processor: -> Pairs: F(cons(a:S,k:S),y:S) -> F(y:S,k:S) F(empty,cons(a:S,k:S)) -> F(cons(a:S,k:S),k:S) -> Rules: f(cons(a:S,k:S),y:S) -> f(y:S,k:S) f(empty,cons(a:S,k:S)) -> f(cons(a:S,k:S),k:S) f(x:S,empty) -> x:S -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [cons](X1,X2) = 2.X1 + 2.X2 + 2 [empty] = 0 [F](X1,X2) = X1 + 2.X2 Problem 1: SCC Processor: -> Pairs: F(empty,cons(a:S,k:S)) -> F(cons(a:S,k:S),k:S) -> Rules: f(cons(a:S,k:S),y:S) -> f(y:S,k:S) f(empty,cons(a:S,k:S)) -> f(cons(a:S,k:S),k:S) f(x:S,empty) -> x:S ->Strongly Connected Components: There is no strongly connected component The problem is finite. popout

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

job log

popout

actions

all output return to TRS Standard