details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.020462 seconds
cpu usage	0.020969
user time	0.008983
system time	0.011986
max virtual memory	113176.0
max residence set size	6556.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR N X Y Z) 0.00/0.01 (STRATEGY CONTEXTSENSITIVE 0.00/0.01 (2ndsneg 1 2) 0.00/0.01 (2ndspos 1 2) 0.00/0.01 (from 1) 0.00/0.01 (pi 1) 0.00/0.01 (plus 1 2) 0.00/0.01 (square 1) 0.00/0.01 (times 1 2) 0.00/0.01 (0) 0.00/0.01 (cons 1) 0.00/0.01 (negrecip 1) 0.00/0.01 (posrecip 1) 0.00/0.01 (rcons 1 2) 0.00/0.01 (rnil) 0.00/0.01 (s 1) 0.00/0.01 ) 0.00/0.01 (RULES 0.00/0.01 2ndsneg(0,Z) -> rnil 0.00/0.01 2ndsneg(s(N),cons(X,cons(Y,Z))) -> rcons(negrecip(Y),2ndspos(N,Z)) 0.00/0.01 2ndspos(0,Z) -> rnil 0.00/0.01 2ndspos(s(N),cons(X,cons(Y,Z))) -> rcons(posrecip(Y),2ndsneg(N,Z)) 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 pi(X) -> 2ndspos(X,from(0)) 0.00/0.01 plus(0,Y) -> Y 0.00/0.01 plus(s(X),Y) -> s(plus(X,Y)) 0.00/0.01 square(X) -> times(X,X) 0.00/0.01 times(0,Y) -> 0 0.00/0.01 times(s(X),Y) -> plus(Y,times(X,Y)) 0.00/0.01 ) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Innermost Equivalent Processor: 0.00/0.01 -> Rules: 0.00/0.01 2ndsneg(0,Z) -> rnil 0.00/0.01 2ndsneg(s(N),cons(X,cons(Y,Z))) -> rcons(negrecip(Y),2ndspos(N,Z)) 0.00/0.01 2ndspos(0,Z) -> rnil 0.00/0.01 2ndspos(s(N),cons(X,cons(Y,Z))) -> rcons(posrecip(Y),2ndsneg(N,Z)) 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 pi(X) -> 2ndspos(X,from(0)) 0.00/0.01 plus(0,Y) -> Y 0.00/0.01 plus(s(X),Y) -> s(plus(X,Y)) 0.00/0.01 square(X) -> times(X,X) 0.00/0.01 times(0,Y) -> 0 0.00/0.01 times(s(X),Y) -> plus(Y,times(X,Y)) 0.00/0.01 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. 0.00/0.01 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Dependency Pairs Processor: 0.00/0.01 -> Pairs: 0.00/0.01 2NDSNEG(s(N),cons(X,cons(Y,Z))) -> 2NDSPOS(N,Z) 0.00/0.01 2NDSNEG(s(N),cons(X,cons(Y,Z))) -> Y 0.00/0.01 2NDSNEG(s(N),cons(X,cons(Y,Z))) -> Z 0.00/0.01 2NDSPOS(s(N),cons(X,cons(Y,Z))) -> 2NDSNEG(N,Z) 0.00/0.01 2NDSPOS(s(N),cons(X,cons(Y,Z))) -> Y 0.00/0.01 2NDSPOS(s(N),cons(X,cons(Y,Z))) -> Z 0.00/0.01 PI(X) -> 2NDSPOS(X,from(0)) 0.00/0.01 PI(X) -> FROM(0) 0.00/0.01 PLUS(s(X),Y) -> PLUS(X,Y) 0.00/0.01 SQUARE(X) -> TIMES(X,X) 0.00/0.01 TIMES(s(X),Y) -> PLUS(Y,times(X,Y)) 0.00/0.01 TIMES(s(X),Y) -> TIMES(X,Y) 0.00/0.01 -> Rules: 0.00/0.01 2ndsneg(0,Z) -> rnil 0.00/0.01 2ndsneg(s(N),cons(X,cons(Y,Z))) -> rcons(negrecip(Y),2ndspos(N,Z)) 0.00/0.01 2ndspos(0,Z) -> rnil 0.00/0.01 2ndspos(s(N),cons(X,cons(Y,Z))) -> rcons(posrecip(Y),2ndsneg(N,Z)) 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 pi(X) -> 2ndspos(X,from(0)) 0.00/0.01 plus(0,Y) -> Y 0.00/0.01 plus(s(X),Y) -> s(plus(X,Y)) 0.00/0.01 square(X) -> times(X,X) 0.00/0.01 times(0,Y) -> 0 0.00/0.01 times(s(X),Y) -> plus(Y,times(X,Y)) 0.00/0.01 -> Unhiding Rules: 0.00/0.01 from(s(X)) -> FROM(s(X)) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 2NDSNEG(s(N),cons(X,cons(Y,Z))) -> 2NDSPOS(N,Z) 0.00/0.01 2NDSNEG(s(N),cons(X,cons(Y,Z))) -> Y 0.00/0.01 2NDSNEG(s(N),cons(X,cons(Y,Z))) -> Z 0.00/0.01 2NDSPOS(s(N),cons(X,cons(Y,Z))) -> 2NDSNEG(N,Z) 0.00/0.01 2NDSPOS(s(N),cons(X,cons(Y,Z))) -> Y 0.00/0.01 2NDSPOS(s(N),cons(X,cons(Y,Z))) -> Z 0.00/0.01 PI(X) -> 2NDSPOS(X,from(0)) 0.00/0.01 PI(X) -> FROM(0) 0.00/0.01 PLUS(s(X),Y) -> PLUS(X,Y) 0.00/0.01 SQUARE(X) -> TIMES(X,X) 0.00/0.01 TIMES(s(X),Y) -> PLUS(Y,times(X,Y)) 0.00/0.01 TIMES(s(X),Y) -> TIMES(X,Y) 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