details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0197539329529 seconds
cpu usage	0.016240297
max memory	1871872.0

stage attributes

key	value
output-size	5390
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 x y) (RULES le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false m -> s(s(s(s(0)))) pop(empty) -> empty pop(push(x,y)) -> x | le(size(x),m) -> true size(empty) -> 0 size(push(x,y)) -> s(size(x)) top(empty) -> eentry top(push(x,y)) -> y | le(size(x),m) -> true ) Problem 1: Valid CTRS Processor: -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false m -> s(s(s(s(0)))) pop(empty) -> empty pop(push(x,y)) -> x | le(size(x),m) -> true size(empty) -> 0 size(push(x,y)) -> s(size(x)) top(empty) -> eentry top(push(x,y)) -> y | le(size(x),m) -> 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) SIZE(push(x,y)) -> SIZE(x) -> QPairs: Empty -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false m -> s(s(s(s(0)))) pop(empty) -> empty pop(push(x,y)) -> x | le(size(x),m) -> true size(empty) -> 0 size(push(x,y)) -> s(size(x)) top(empty) -> eentry top(push(x,y)) -> y | le(size(x),m) -> true Conditional Termination Problem 2: -> Pairs: POP(push(x,y)) -> LE(size(x),m) POP(push(x,y)) -> M POP(push(x,y)) -> SIZE(x) TOP(push(x,y)) -> LE(size(x),m) TOP(push(x,y)) -> M TOP(push(x,y)) -> SIZE(x) -> QPairs: LE(s(x),s(y)) -> LE(x,y) SIZE(push(x,y)) -> SIZE(x) -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false m -> s(s(s(s(0)))) pop(empty) -> empty pop(push(x,y)) -> x | le(size(x),m) -> true size(empty) -> 0 size(push(x,y)) -> s(size(x)) top(empty) -> eentry top(push(x,y)) -> y | le(size(x),m) -> true The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: LE(s(x),s(y)) -> LE(x,y) SIZE(push(x,y)) -> SIZE(x) -> QPairs: Empty -> Rules: le(0,s(x)) -> true le(s(x),s(y)) -> le(x,y) le(x,0) -> false m -> s(s(s(s(0)))) popout

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

job log

popout

actions

all output return to TRS Condi 20667