details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0676879882812 seconds
cpu usage	0.065733458
max memory	4071424.0

stage attributes

key	value
output-size	4757
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 f(0) -> true f(1) -> false f(s(x)) -> f(x) g(s(x),s(y)) -> if(f(x),s(x),s(y)) g(x,c(y)) -> g(x,g(s(c(y)),y)) if(false,x,y) -> y if(true,x,y) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(s(x),s(y)) -> if(f(x),s(x),s(y)) g(x,c(y)) -> g(x,g(s(c(y)),y)) if(false,x,y) -> y if(true,x,y) -> x -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(s(x)) -> F(x) G(s(x),s(y)) -> F(x) G(s(x),s(y)) -> IF(f(x),s(x),s(y)) G(x,c(y)) -> G(s(c(y)),y) G(x,c(y)) -> G(x,g(s(c(y)),y)) -> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(s(x),s(y)) -> if(f(x),s(x),s(y)) g(x,c(y)) -> g(x,g(s(c(y)),y)) if(false,x,y) -> y if(true,x,y) -> x Problem 1: SCC Processor: -> Pairs: F(s(x)) -> F(x) G(s(x),s(y)) -> F(x) G(s(x),s(y)) -> IF(f(x),s(x),s(y)) G(x,c(y)) -> G(s(c(y)),y) G(x,c(y)) -> G(x,g(s(c(y)),y)) -> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(s(x),s(y)) -> if(f(x),s(x),s(y)) g(x,c(y)) -> g(x,g(s(c(y)),y)) if(false,x,y) -> y if(true,x,y) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(x)) -> F(x) ->->-> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(s(x),s(y)) -> if(f(x),s(x),s(y)) g(x,c(y)) -> g(x,g(s(c(y)),y)) if(false,x,y) -> y if(true,x,y) -> x ->->Cycle: ->->-> Pairs: G(x,c(y)) -> G(s(c(y)),y) G(x,c(y)) -> G(x,g(s(c(y)),y)) ->->-> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(s(x),s(y)) -> if(f(x),s(x),s(y)) g(x,c(y)) -> g(x,g(s(c(y)),y)) if(false,x,y) -> y if(true,x,y) -> x 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 Stand 20472