details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0969579219818 seconds
cpu usage	0.052471005
max memory	3313664.0

stage attributes

key	value
output-size	2776
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 v_NonEmpty:S x:S y:S) (RULES f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S))) g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S)) g(s(f(x:S))) -> g(f(x:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: F(c(s(x:S),y:S)) -> F(c(x:S,s(y:S))) G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S)) G(s(f(x:S))) -> G(f(x:S)) -> Rules: f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S))) g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S)) g(s(f(x:S))) -> g(f(x:S)) Problem 1: SCC Processor: -> Pairs: F(c(s(x:S),y:S)) -> F(c(x:S,s(y:S))) G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S)) G(s(f(x:S))) -> G(f(x:S)) -> Rules: f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S))) g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S)) g(s(f(x:S))) -> g(f(x:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S)) ->->-> Rules: f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S))) g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S)) g(s(f(x:S))) -> g(f(x:S)) ->->Cycle: ->->-> Pairs: F(c(s(x:S),y:S)) -> F(c(x:S,s(y:S))) ->->-> Rules: f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S))) g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S)) g(s(f(x:S))) -> g(f(x:S)) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: G(c(x:S,s(y:S))) -> G(c(s(x:S),y:S)) -> Rules: f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S))) g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S)) g(s(f(x:S))) -> g(f(x:S)) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = 0 [g](X) = 0 [c](X1,X2) = 2.X2 [fSNonEmpty] = 0 [s](X) = 2.X + 2 [F](X) = 0 [G](X) = 2.X Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: f(c(s(x:S),y:S)) -> f(c(x:S,s(y:S))) g(c(x:S,s(y:S))) -> g(c(s(x:S),y:S)) g(s(f(x:S))) -> g(f(x:S)) ->Strongly Connected Components: There is no strongly connected component popout

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

job log

popout

actions

all output return to TRS Innermost