details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0630798339844 seconds
cpu usage	0.057218695
max memory	4009984.0

stage attributes

key	value
output-size	4538
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 X1 X2 Y) (RULES a__f(g(X),Y) -> a__f(mark(X),f(g(X),Y)) a__f(X1,X2) -> f(X1,X2) mark(f(X1,X2)) -> a__f(mark(X1),X2) mark(g(X)) -> g(mark(X)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(g(X),Y) -> A__F(mark(X),f(g(X),Y)) A__F(g(X),Y) -> MARK(X) MARK(f(X1,X2)) -> A__F(mark(X1),X2) MARK(f(X1,X2)) -> MARK(X1) MARK(g(X)) -> MARK(X) -> Rules: a__f(g(X),Y) -> a__f(mark(X),f(g(X),Y)) a__f(X1,X2) -> f(X1,X2) mark(f(X1,X2)) -> a__f(mark(X1),X2) mark(g(X)) -> g(mark(X)) Problem 1: SCC Processor: -> Pairs: A__F(g(X),Y) -> A__F(mark(X),f(g(X),Y)) A__F(g(X),Y) -> MARK(X) MARK(f(X1,X2)) -> A__F(mark(X1),X2) MARK(f(X1,X2)) -> MARK(X1) MARK(g(X)) -> MARK(X) -> Rules: a__f(g(X),Y) -> a__f(mark(X),f(g(X),Y)) a__f(X1,X2) -> f(X1,X2) mark(f(X1,X2)) -> a__f(mark(X1),X2) mark(g(X)) -> g(mark(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(g(X),Y) -> A__F(mark(X),f(g(X),Y)) A__F(g(X),Y) -> MARK(X) MARK(f(X1,X2)) -> A__F(mark(X1),X2) MARK(f(X1,X2)) -> MARK(X1) MARK(g(X)) -> MARK(X) ->->-> Rules: a__f(g(X),Y) -> a__f(mark(X),f(g(X),Y)) a__f(X1,X2) -> f(X1,X2) mark(f(X1,X2)) -> a__f(mark(X1),X2) mark(g(X)) -> g(mark(X)) Problem 1: Reduction Pairs Processor: -> Pairs: A__F(g(X),Y) -> A__F(mark(X),f(g(X),Y)) A__F(g(X),Y) -> MARK(X) MARK(f(X1,X2)) -> A__F(mark(X1),X2) MARK(f(X1,X2)) -> MARK(X1) MARK(g(X)) -> MARK(X) -> Rules: a__f(g(X),Y) -> a__f(mark(X),f(g(X),Y)) a__f(X1,X2) -> f(X1,X2) mark(f(X1,X2)) -> a__f(mark(X1),X2) mark(g(X)) -> g(mark(X)) -> Usable rules: a__f(g(X),Y) -> a__f(mark(X),f(g(X),Y)) a__f(X1,X2) -> f(X1,X2) mark(f(X1,X2)) -> a__f(mark(X1),X2) mark(g(X)) -> g(mark(X)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__f](X1,X2) = 2.X1 + 2 [mark](X) = 2.X + 1 [f](X1,X2) = 2.X1 + 2 [g](X) = 2.X + 2 [A__F](X1,X2) = X1 [MARK](X) = 2.X + 2 Problem 1: popout

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

job log

popout

actions

all output return to TRS Inner 89993