details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.220650196075 seconds
cpu usage	0.199748995
max memory	5292032.0

stage attributes

key	value
output-size	3369
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(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(x:S,f(a,y:S)) -> F(f(f(a,x:S),h(a)),y:S) F(x:S,f(a,y:S)) -> F(f(a,x:S),h(a)) F(x:S,f(a,y:S)) -> F(a,f(f(f(a,x:S),h(a)),y:S)) F(x:S,f(a,y:S)) -> F(a,x:S) -> Rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) Problem 1: SCC Processor: -> Pairs: F(x:S,f(a,y:S)) -> F(f(f(a,x:S),h(a)),y:S) F(x:S,f(a,y:S)) -> F(f(a,x:S),h(a)) F(x:S,f(a,y:S)) -> F(a,f(f(f(a,x:S),h(a)),y:S)) F(x:S,f(a,y:S)) -> F(a,x:S) -> Rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(x:S,f(a,y:S)) -> F(f(f(a,x:S),h(a)),y:S) F(x:S,f(a,y:S)) -> F(a,f(f(f(a,x:S),h(a)),y:S)) F(x:S,f(a,y:S)) -> F(a,x:S) ->->-> Rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) Problem 1: Reduction Pair Processor: -> Pairs: F(x:S,f(a,y:S)) -> F(f(f(a,x:S),h(a)),y:S) F(x:S,f(a,y:S)) -> F(a,f(f(f(a,x:S),h(a)),y:S)) F(x:S,f(a,y:S)) -> F(a,x:S) -> Rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) -> Usable rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X1,X2) = 2.X2 + 2 [a] = 0 [h](X) = 0 [F](X1,X2) = 2.X1 + 2.X2 Problem 1: SCC Processor: -> Pairs: F(x:S,f(a,y:S)) -> F(f(f(a,x:S),h(a)),y:S) F(x:S,f(a,y:S)) -> F(a,f(f(f(a,x:S),h(a)),y:S)) -> Rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(x:S,f(a,y:S)) -> F(f(f(a,x:S),h(a)),y:S) F(x:S,f(a,y:S)) -> F(a,f(f(f(a,x:S),h(a)),y:S)) ->->-> Rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) Problem 1: Reduction Pair Processor: -> Pairs: F(x:S,f(a,y:S)) -> F(f(f(a,x:S),h(a)),y:S) F(x:S,f(a,y:S)) -> F(a,f(f(f(a,x:S),h(a)),y:S)) -> Rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) -> Usable rules: f(x:S,f(a,y:S)) -> f(a,f(f(f(a,x:S),h(a)),y:S)) ->Interpretation type: Linear ->Coefficients: popout

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

job log

popout

actions

all output return to TRS Standard