details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.122072935104 seconds
cpu usage	0.085965947
max memory	4796416.0

stage attributes

key	value
output-size	13351
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR M N X Y Z) (RULES append(add(N,X),Y) -> add(N,append(X,Y)) append(nil,Y) -> Y f_1(pair(X,Z),N,M,Y) -> f_2(lt(N,M),N,M,Y,X,Z) f_2(false,N,M,Y,X,Z) -> pair(add(M,X),Z) f_2(true,N,M,Y,X,Z) -> pair(X,add(M,Z)) f_3(pair(Y,Z),N,X) -> append(qsort(Y),add(X,qsort(Z))) lt(0,s(X)) -> true lt(s(X),0) -> false lt(s(X),s(Y)) -> lt(X,Y) qsort(add(N,X)) -> f_3(split(N,X),N,X) qsort(nil) -> nil split(N,add(M,Y)) -> f_1(split(N,Y),N,M,Y) split(N,nil) -> pair(nil,nil) ) Problem 1: Innermost Equivalent Processor: -> Rules: append(add(N,X),Y) -> add(N,append(X,Y)) append(nil,Y) -> Y f_1(pair(X,Z),N,M,Y) -> f_2(lt(N,M),N,M,Y,X,Z) f_2(false,N,M,Y,X,Z) -> pair(add(M,X),Z) f_2(true,N,M,Y,X,Z) -> pair(X,add(M,Z)) f_3(pair(Y,Z),N,X) -> append(qsort(Y),add(X,qsort(Z))) lt(0,s(X)) -> true lt(s(X),0) -> false lt(s(X),s(Y)) -> lt(X,Y) qsort(add(N,X)) -> f_3(split(N,X),N,X) qsort(nil) -> nil split(N,add(M,Y)) -> f_1(split(N,Y),N,M,Y) split(N,nil) -> pair(nil,nil) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APPEND(add(N,X),Y) -> APPEND(X,Y) F_1(pair(X,Z),N,M,Y) -> F_2(lt(N,M),N,M,Y,X,Z) F_1(pair(X,Z),N,M,Y) -> LT(N,M) F_3(pair(Y,Z),N,X) -> APPEND(qsort(Y),add(X,qsort(Z))) F_3(pair(Y,Z),N,X) -> QSORT(Y) F_3(pair(Y,Z),N,X) -> QSORT(Z) LT(s(X),s(Y)) -> LT(X,Y) QSORT(add(N,X)) -> F_3(split(N,X),N,X) QSORT(add(N,X)) -> SPLIT(N,X) SPLIT(N,add(M,Y)) -> F_1(split(N,Y),N,M,Y) SPLIT(N,add(M,Y)) -> SPLIT(N,Y) -> Rules: append(add(N,X),Y) -> add(N,append(X,Y)) append(nil,Y) -> Y f_1(pair(X,Z),N,M,Y) -> f_2(lt(N,M),N,M,Y,X,Z) f_2(false,N,M,Y,X,Z) -> pair(add(M,X),Z) f_2(true,N,M,Y,X,Z) -> pair(X,add(M,Z)) f_3(pair(Y,Z),N,X) -> append(qsort(Y),add(X,qsort(Z))) lt(0,s(X)) -> true lt(s(X),0) -> false lt(s(X),s(Y)) -> lt(X,Y) qsort(add(N,X)) -> f_3(split(N,X),N,X) qsort(nil) -> nil split(N,add(M,Y)) -> f_1(split(N,Y),N,M,Y) split(N,nil) -> pair(nil,nil) Problem 1: SCC Processor: -> Pairs: APPEND(add(N,X),Y) -> APPEND(X,Y) F_1(pair(X,Z),N,M,Y) -> F_2(lt(N,M),N,M,Y,X,Z) F_1(pair(X,Z),N,M,Y) -> LT(N,M) F_3(pair(Y,Z),N,X) -> APPEND(qsort(Y),add(X,qsort(Z))) F_3(pair(Y,Z),N,X) -> QSORT(Y) F_3(pair(Y,Z),N,X) -> QSORT(Z) LT(s(X),s(Y)) -> LT(X,Y) QSORT(add(N,X)) -> F_3(split(N,X),N,X) QSORT(add(N,X)) -> SPLIT(N,X) SPLIT(N,add(M,Y)) -> F_1(split(N,Y),N,M,Y) SPLIT(N,add(M,Y)) -> SPLIT(N,Y) -> Rules: append(add(N,X),Y) -> add(N,append(X,Y)) append(nil,Y) -> Y f_1(pair(X,Z),N,M,Y) -> f_2(lt(N,M),N,M,Y,X,Z) f_2(false,N,M,Y,X,Z) -> pair(add(M,X),Z) f_2(true,N,M,Y,X,Z) -> pair(X,add(M,Z)) f_3(pair(Y,Z),N,X) -> append(qsort(Y),add(X,qsort(Z))) lt(0,s(X)) -> true popout

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

job log

popout

actions

all output return to TRS Stand 20472