details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0716540813446 seconds
cpu usage	0.049704648
max memory	4145152.0

stage attributes

key	value
output-size	6075
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 l:S x:S y:S) (RULES rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(x:S),nil) -> s(x:S) rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S) rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S))) rev2(x:S,nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(x:S),nil) -> s(x:S) rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S) rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S))) rev2(x:S,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: REV(cons(x:S,l:S)) -> REV1(x:S,l:S) REV(cons(x:S,l:S)) -> REV2(x:S,l:S) REV1(x:S,cons(y:S,l:S)) -> REV1(y:S,l:S) REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S))) REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S) -> Rules: rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(x:S),nil) -> s(x:S) rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S) rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S))) rev2(x:S,nil) -> nil Problem 1: SCC Processor: -> Pairs: REV(cons(x:S,l:S)) -> REV1(x:S,l:S) REV(cons(x:S,l:S)) -> REV2(x:S,l:S) REV1(x:S,cons(y:S,l:S)) -> REV1(y:S,l:S) REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S))) REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S) -> Rules: rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(x:S),nil) -> s(x:S) rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S) rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S))) rev2(x:S,nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: REV1(x:S,cons(y:S,l:S)) -> REV1(y:S,l:S) ->->-> Rules: rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(x:S),nil) -> s(x:S) rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S) rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S))) rev2(x:S,nil) -> nil ->->Cycle: ->->-> Pairs: REV(cons(x:S,l:S)) -> REV2(x:S,l:S) REV2(x:S,cons(y:S,l:S)) -> REV(cons(x:S,rev2(y:S,l:S))) REV2(x:S,cons(y:S,l:S)) -> REV2(y:S,l:S) ->->-> Rules: rev(cons(x:S,l:S)) -> cons(rev1(x:S,l:S),rev2(x:S,l:S)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(x:S),nil) -> s(x:S) rev1(x:S,cons(y:S,l:S)) -> rev1(y:S,l:S) rev2(x:S,cons(y:S,l:S)) -> rev(cons(x:S,rev2(y:S,l:S))) rev2(x:S,nil) -> nil The problem is decomposed in 2 subproblems. Problem 1.1: popout

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

job log

popout

actions

all output return to TRS Standard