details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0172529220581 seconds
cpu usage	0.014718055
max memory	1724416.0

stage attributes

key	value
output-size	3031
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 x y) (RULES f(0) -> true f(1) -> false f(s(x)) -> f(x) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) g(x,c(y)) -> c(g(x,y)) if(false,s(x),s(y)) -> s(y) if(true,s(x),s(y)) -> s(x) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(s(x)) -> F(x) G(x,c(y)) -> F(x) G(x,c(y)) -> G(s(x),y) G(x,c(y)) -> G(x,if(f(x),c(g(s(x),y)),c(y))) G(x,c(y)) -> G(x,y) G(x,c(y)) -> IF(f(x),c(g(s(x),y)),c(y)) -> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) g(x,c(y)) -> c(g(x,y)) if(false,s(x),s(y)) -> s(y) if(true,s(x),s(y)) -> s(x) Problem 1: SCC Processor: -> Pairs: F(s(x)) -> F(x) G(x,c(y)) -> F(x) G(x,c(y)) -> G(s(x),y) G(x,c(y)) -> G(x,if(f(x),c(g(s(x),y)),c(y))) G(x,c(y)) -> G(x,y) G(x,c(y)) -> IF(f(x),c(g(s(x),y)),c(y)) -> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) g(x,c(y)) -> c(g(x,y)) if(false,s(x),s(y)) -> s(y) if(true,s(x),s(y)) -> s(x) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(x)) -> F(x) ->->-> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) g(x,c(y)) -> c(g(x,y)) if(false,s(x),s(y)) -> s(y) if(true,s(x),s(y)) -> s(x) ->->Cycle: ->->-> Pairs: G(x,c(y)) -> G(s(x),y) G(x,c(y)) -> G(x,y) ->->-> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) g(x,c(y)) -> c(g(x,y)) if(false,s(x),s(y)) -> s(y) if(true,s(x),s(y)) -> s(x) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: F(s(x)) -> F(x) -> Rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) g(x,c(y)) -> c(g(x,y)) if(false,s(x),s(y)) -> s(y) if(true,s(x),s(y)) -> s(x) ->Projection: popout

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

job log

popout

actions

all output return to TRS Stand 20472