details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.032215 seconds
cpu usage	0.030135
user time	0.011503
system time	0.018632
max virtual memory	113176.0
max residence set size	4368.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.03 YES 0.00/0.03 0.00/0.03 Problem 1: 0.00/0.03 0.00/0.03 (VAR X Y) 0.00/0.03 (STRATEGY CONTEXTSENSITIVE 0.00/0.03 (from 1) 0.00/0.03 (length) 0.00/0.03 (length1) 0.00/0.03 (0) 0.00/0.03 (cons 1) 0.00/0.03 (nil) 0.00/0.03 (s 1) 0.00/0.03 ) 0.00/0.03 (RULES 0.00/0.03 from(X) -> cons(X,from(s(X))) 0.00/0.03 length(cons(X,Y)) -> s(length1(Y)) 0.00/0.03 length(nil) -> 0 0.00/0.03 length1(X) -> length(X) 0.00/0.03 ) 0.00/0.03 0.00/0.03 Problem 1: 0.00/0.03 0.00/0.03 Innermost Equivalent Processor: 0.00/0.03 -> Rules: 0.00/0.03 from(X) -> cons(X,from(s(X))) 0.00/0.03 length(cons(X,Y)) -> s(length1(Y)) 0.00/0.03 length(nil) -> 0 0.00/0.03 length1(X) -> length(X) 0.00/0.03 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. 0.00/0.03 0.00/0.03 0.00/0.03 Problem 1: 0.00/0.03 0.00/0.03 Dependency Pairs Processor: 0.00/0.03 -> Pairs: 0.00/0.03 LENGTH(cons(X,Y)) -> LENGTH1(Y) 0.00/0.03 LENGTH1(X) -> LENGTH(X) 0.00/0.03 -> Rules: 0.00/0.03 from(X) -> cons(X,from(s(X))) 0.00/0.03 length(cons(X,Y)) -> s(length1(Y)) 0.00/0.03 length(nil) -> 0 0.00/0.03 length1(X) -> length(X) 0.00/0.03 -> Unhiding Rules: 0.00/0.03 Empty 0.00/0.03 0.00/0.03 Problem 1: 0.00/0.03 0.00/0.03 SCC Processor: 0.00/0.03 -> Pairs: 0.00/0.03 LENGTH(cons(X,Y)) -> LENGTH1(Y) 0.00/0.03 LENGTH1(X) -> LENGTH(X) 0.00/0.03 -> Rules: 0.00/0.03 from(X) -> cons(X,from(s(X))) 0.00/0.03 length(cons(X,Y)) -> s(length1(Y)) 0.00/0.03 length(nil) -> 0 0.00/0.03 length1(X) -> length(X) 0.00/0.03 -> Unhiding rules: 0.00/0.03 Empty 0.00/0.03 ->Strongly Connected Components: 0.00/0.03 ->->Cycle: 0.00/0.03 ->->-> Pairs: 0.00/0.03 LENGTH(cons(X,Y)) -> LENGTH1(Y) 0.00/0.03 LENGTH1(X) -> LENGTH(X) 0.00/0.03 ->->-> Rules: 0.00/0.03 from(X) -> cons(X,from(s(X))) 0.00/0.03 length(cons(X,Y)) -> s(length1(Y)) 0.00/0.03 length(nil) -> 0 0.00/0.03 length1(X) -> length(X) 0.00/0.03 ->->-> Unhiding rules: 0.00/0.03 Empty 0.00/0.03 0.00/0.03 Problem 1: 0.00/0.03 0.00/0.03 Reduction Pairs Processor: 0.00/0.03 -> Pairs: 0.00/0.03 LENGTH(cons(X,Y)) -> LENGTH1(Y) 0.00/0.03 LENGTH1(X) -> LENGTH(X) 0.00/0.03 -> Rules: 0.00/0.03 from(X) -> cons(X,from(s(X))) 0.00/0.03 length(cons(X,Y)) -> s(length1(Y)) 0.00/0.03 length(nil) -> 0 0.00/0.03 length1(X) -> length(X) 0.00/0.03 -> Unhiding rules: 0.00/0.03 Empty 0.00/0.03 -> Usable rules: 0.00/0.03 Empty 0.00/0.03 ->Interpretation type: 0.00/0.03 Linear 0.00/0.03 ->Coefficients: 0.00/0.03 Natural Numbers 0.00/0.03 ->Dimension: 0.00/0.03 1 0.00/0.03 ->Bound: 0.00/0.03 2 0.00/0.03 ->Interpretation: 0.00/0.03 0.00/0.03 [cons](X1,X2) = 2.X2 + 2 0.00/0.03 [LENGTH](X) = 2.X + 2 0.00/0.03 [LENGTH1](X) = 2.X + 2 popout

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

job log

popout

actions

all output return to TRS_Contextsensitive 2019-03-21 05.07