details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0704388618469 seconds
cpu usage	0.022433748
max memory	1880064.0

stage attributes

key	value
output-size	4959
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 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,++(y:S,z:S)) -> ++(++(x:S,y:S),z:S) ++(x:S,nil) -> x:S make(x:S) -> .(x:S,nil) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil ) Problem 1: Dependency Pairs Processor: -> Pairs: ++#(.(x:S,y:S),z:S) -> ++#(y:S,z:S) ++#(x:S,++(y:S,z:S)) -> ++#(++(x:S,y:S),z:S) ++#(x:S,++(y:S,z:S)) -> ++#(x:S,y: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,++(y:S,z:S)) -> ++(++(x:S,y:S),z:S) ++(x:S,nil) -> x:S make(x:S) -> .(x:S,nil) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil Problem 1: SCC Processor: -> Pairs: ++#(.(x:S,y:S),z:S) -> ++#(y:S,z:S) ++#(x:S,++(y:S,z:S)) -> ++#(++(x:S,y:S),z:S) ++#(x:S,++(y:S,z:S)) -> ++#(x:S,y: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,++(y:S,z:S)) -> ++(++(x:S,y:S),z:S) ++(x:S,nil) -> x:S make(x:S) -> .(x:S,nil) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ++#(.(x:S,y:S),z:S) -> ++#(y:S,z:S) ++#(x:S,++(y:S,z:S)) -> ++#(++(x:S,y:S),z:S) ++#(x:S,++(y:S,z:S)) -> ++#(x:S,y:S) ->->-> Rules: ++(.(x:S,y:S),z:S) -> .(x:S,++(y:S,z:S)) ++(nil,y:S) -> y:S ++(x:S,++(y:S,z:S)) -> ++(++(x:S,y:S),z:S) ++(x:S,nil) -> x:S make(x:S) -> .(x:S,nil) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil ->->Cycle: ->->-> Pairs: 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,++(y:S,z:S)) -> ++(++(x:S,y:S),z:S) ++(x:S,nil) -> x:S make(x:S) -> .(x:S,nil) rev(++(x:S,y:S)) -> ++(rev(y:S),rev(x:S)) rev(rev(x:S)) -> x:S rev(nil) -> nil The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: ++#(.(x:S,y:S),z:S) -> ++#(y:S,z:S) ++#(x:S,++(y:S,z:S)) -> ++#(++(x:S,y:S),z:S) ++#(x:S,++(y:S,z:S)) -> ++#(x:S,y:S) popout

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

job log

popout

actions

all output return to TRS Standard