details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0179810523987 seconds
cpu usage	0.015265503
max memory	1855488.0

stage attributes

key	value
output-size	6181
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 l x y) (RULES le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false min(cons(x,nil)) -> x min(cons(x,l)) -> min(l) | le(x,min(l)) -> false min(cons(x,l)) -> min(l) | min(l) -> x min(cons(x,l)) -> x | le(x,min(l)) -> true ) Problem 1: Valid CTRS Processor: -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false min(cons(x,nil)) -> x min(cons(x,l)) -> min(l) | le(x,min(l)) -> false min(cons(x,l)) -> min(l) | min(l) -> x min(cons(x,l)) -> x | le(x,min(l)) -> true -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: LE(s(x),s(y)) -> LE(x,y) MIN(cons(x,l)) -> MIN(l) | le(x,min(l)) -> false MIN(cons(x,l)) -> MIN(l) | min(l) -> x -> QPairs: Empty -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false min(cons(x,nil)) -> x min(cons(x,l)) -> min(l) | le(x,min(l)) -> false min(cons(x,l)) -> min(l) | min(l) -> x min(cons(x,l)) -> x | le(x,min(l)) -> true Conditional Termination Problem 2: -> Pairs: MIN(cons(x,l)) -> LE(x,min(l)) MIN(cons(x,l)) -> MIN(l) -> QPairs: LE(s(x),s(y)) -> LE(x,y) MIN(cons(x,l)) -> MIN(l) | le(x,min(l)) -> false MIN(cons(x,l)) -> MIN(l) | min(l) -> x -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false min(cons(x,nil)) -> x min(cons(x,l)) -> min(l) | le(x,min(l)) -> false min(cons(x,l)) -> min(l) | min(l) -> x min(cons(x,l)) -> x | le(x,min(l)) -> true The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: LE(s(x),s(y)) -> LE(x,y) MIN(cons(x,l)) -> MIN(l) | le(x,min(l)) -> false MIN(cons(x,l)) -> MIN(l) | min(l) -> x -> QPairs: Empty -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false min(cons(x,nil)) -> x min(cons(x,l)) -> min(l) | le(x,min(l)) -> false min(cons(x,l)) -> min(l) | min(l) -> x min(cons(x,l)) -> x | le(x,min(l)) -> true ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MIN(cons(x,l)) -> MIN(l) | le(x,min(l)) -> false MIN(cons(x,l)) -> MIN(l) | min(l) -> x ->->-> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false min(cons(x,nil)) -> x popout

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

job log

popout

actions

all output return to TRS Condi 20667