details

property	value
status	complete
benchmark	#3.17a.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n003.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0672562122345 seconds
cpu usage	0.065820187
max memory	4804608.0

stage attributes

key	value
output-size	9338
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 k l x y) (RULES app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(plus(cons(0,x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ) Problem 1: Dependency Pairs Processor: -> Pairs: APP(cons(x,l),k) -> APP(l,k) PLUS(s(x),y) -> PLUS(x,y) SUM(app(l,cons(x,cons(y,k)))) -> APP(l,sum(cons(x,cons(y,k)))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(cons(x,cons(y,k))) SUM(plus(cons(0,x),cons(y,l))) -> PRED(sum(cons(s(x),cons(y,l)))) SUM(plus(cons(0,x),cons(y,l))) -> SUM(cons(s(x),cons(y,l))) SUM(cons(x,cons(y,l))) -> PLUS(x,y) SUM(cons(x,cons(y,l))) -> SUM(cons(plus(x,y),l)) -> Rules: app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(plus(cons(0,x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) Problem 1: SCC Processor: -> Pairs: APP(cons(x,l),k) -> APP(l,k) PLUS(s(x),y) -> PLUS(x,y) SUM(app(l,cons(x,cons(y,k)))) -> APP(l,sum(cons(x,cons(y,k)))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(cons(x,cons(y,k))) SUM(plus(cons(0,x),cons(y,l))) -> PRED(sum(cons(s(x),cons(y,l)))) SUM(plus(cons(0,x),cons(y,l))) -> SUM(cons(s(x),cons(y,l))) SUM(cons(x,cons(y,l))) -> PLUS(x,y) SUM(cons(x,cons(y,l))) -> SUM(cons(plus(x,y),l)) -> Rules: app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(plus(cons(0,x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(s(x),y) -> PLUS(x,y) ->->-> Rules: app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(plus(cons(0,x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ->->Cycle: ->->-> Pairs: SUM(cons(x,cons(y,l))) -> SUM(cons(plus(x,y),l)) ->->-> Rules: app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(plus(cons(0,x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) popout

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

job log

popout

actions

all output return to TRS Stand 20472