details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0675349235535 seconds
cpu usage	0.022673376
max memory	1990656.0

stage attributes

key	value
output-size	7900
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 x:S y:S z:S) (RULES ++(++(x:S,y:S),z:S) -> ++(x:S,++(y:S,z:S)) ++(nil,y:S) -> y:S ++(x:S,nil) -> x:S flatten(++(unit(x:S),y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(++(x:S,y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(flatten(x:S)) -> flatten(x:S) flatten(nil) -> nil flatten(unit(x:S)) -> flatten(x:S) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil rev(unit(x:S)) -> unit(x:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ++#(++(x:S,y:S),z:S) -> ++#(x:S,++(y:S,z:S)) ++#(++(x:S,y:S),z:S) -> ++#(y:S,z:S) FLATTEN(++(unit(x:S),y:S)) -> ++#(flatten(x:S),flatten(y:S)) FLATTEN(++(unit(x:S),y:S)) -> FLATTEN(x:S) FLATTEN(++(unit(x:S),y:S)) -> FLATTEN(y:S) FLATTEN(++(x:S,y:S)) -> ++#(flatten(x:S),flatten(y:S)) FLATTEN(++(x:S,y:S)) -> FLATTEN(x:S) FLATTEN(++(x:S,y:S)) -> FLATTEN(y:S) FLATTEN(unit(x:S)) -> FLATTEN(x:S) REV(++(x:S,y:S)) -> ++#(rev(y:S),rev(x:S)) REV(++(x:S,y:S)) -> REV(x:S) REV(++(x:S,y:S)) -> REV(y:S) -> Rules: ++(++(x:S,y:S),z:S) -> ++(x:S,++(y:S,z:S)) ++(nil,y:S) -> y:S ++(x:S,nil) -> x:S flatten(++(unit(x:S),y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(++(x:S,y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(flatten(x:S)) -> flatten(x:S) flatten(nil) -> nil flatten(unit(x:S)) -> flatten(x:S) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil rev(unit(x:S)) -> unit(x:S) Problem 1: SCC Processor: -> Pairs: ++#(++(x:S,y:S),z:S) -> ++#(x:S,++(y:S,z:S)) ++#(++(x:S,y:S),z:S) -> ++#(y:S,z:S) FLATTEN(++(unit(x:S),y:S)) -> ++#(flatten(x:S),flatten(y:S)) FLATTEN(++(unit(x:S),y:S)) -> FLATTEN(x:S) FLATTEN(++(unit(x:S),y:S)) -> FLATTEN(y:S) FLATTEN(++(x:S,y:S)) -> ++#(flatten(x:S),flatten(y:S)) FLATTEN(++(x:S,y:S)) -> FLATTEN(x:S) FLATTEN(++(x:S,y:S)) -> FLATTEN(y:S) FLATTEN(unit(x:S)) -> FLATTEN(x:S) REV(++(x:S,y:S)) -> ++#(rev(y:S),rev(x:S)) REV(++(x:S,y:S)) -> REV(x:S) REV(++(x:S,y:S)) -> REV(y:S) -> Rules: ++(++(x:S,y:S),z:S) -> ++(x:S,++(y:S,z:S)) ++(nil,y:S) -> y:S ++(x:S,nil) -> x:S flatten(++(unit(x:S),y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(++(x:S,y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(flatten(x:S)) -> flatten(x:S) flatten(nil) -> nil flatten(unit(x:S)) -> flatten(x:S) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil rev(unit(x:S)) -> unit(x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ++#(++(x:S,y:S),z:S) -> ++#(x:S,++(y:S,z:S)) ++#(++(x:S,y:S),z:S) -> ++#(y:S,z:S) ->->-> Rules: ++(++(x:S,y:S),z:S) -> ++(x:S,++(y:S,z:S)) ++(nil,y:S) -> y:S ++(x:S,nil) -> x:S flatten(++(unit(x:S),y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(++(x:S,y:S)) -> ++(flatten(x:S),flatten(y:S)) flatten(flatten(x:S)) -> flatten(x:S) flatten(nil) -> nil flatten(unit(x:S)) -> flatten(x:S) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) popout

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

job log

popout

actions

all output return to TRS Standard