details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.133944988251 seconds
cpu usage	0.116990754
max memory	3739648.0

stage attributes

key	value
output-size	6511
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 X3 X4 Y Z) (RULES plus(s(X),plus(Y,Z)) -> plus(X,plus(s(s(Y)),Z)) plus(s(X1),plus(X2,plus(X3,X4))) -> plus(X1,plus(X3,plus(X2,X4))) ) Problem 1: Dependency Pairs Processor: -> Pairs: PLUS(s(X),plus(Y,Z)) -> PLUS(s(s(Y)),Z) PLUS(s(X),plus(Y,Z)) -> PLUS(X,plus(s(s(Y)),Z)) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X1,plus(X3,plus(X2,X4))) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X2,X4) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X3,plus(X2,X4)) -> Rules: plus(s(X),plus(Y,Z)) -> plus(X,plus(s(s(Y)),Z)) plus(s(X1),plus(X2,plus(X3,X4))) -> plus(X1,plus(X3,plus(X2,X4))) Problem 1: SCC Processor: -> Pairs: PLUS(s(X),plus(Y,Z)) -> PLUS(s(s(Y)),Z) PLUS(s(X),plus(Y,Z)) -> PLUS(X,plus(s(s(Y)),Z)) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X1,plus(X3,plus(X2,X4))) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X2,X4) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X3,plus(X2,X4)) -> Rules: plus(s(X),plus(Y,Z)) -> plus(X,plus(s(s(Y)),Z)) plus(s(X1),plus(X2,plus(X3,X4))) -> plus(X1,plus(X3,plus(X2,X4))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(s(X),plus(Y,Z)) -> PLUS(s(s(Y)),Z) PLUS(s(X),plus(Y,Z)) -> PLUS(X,plus(s(s(Y)),Z)) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X1,plus(X3,plus(X2,X4))) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X2,X4) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X3,plus(X2,X4)) ->->-> Rules: plus(s(X),plus(Y,Z)) -> plus(X,plus(s(s(Y)),Z)) plus(s(X1),plus(X2,plus(X3,X4))) -> plus(X1,plus(X3,plus(X2,X4))) Problem 1: Reduction Pair Processor: -> Pairs: PLUS(s(X),plus(Y,Z)) -> PLUS(s(s(Y)),Z) PLUS(s(X),plus(Y,Z)) -> PLUS(X,plus(s(s(Y)),Z)) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X1,plus(X3,plus(X2,X4))) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X2,X4) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X3,plus(X2,X4)) -> Rules: plus(s(X),plus(Y,Z)) -> plus(X,plus(s(s(Y)),Z)) plus(s(X1),plus(X2,plus(X3,X4))) -> plus(X1,plus(X3,plus(X2,X4))) -> Usable rules: plus(s(X),plus(Y,Z)) -> plus(X,plus(s(s(Y)),Z)) plus(s(X1),plus(X2,plus(X3,X4))) -> plus(X1,plus(X3,plus(X2,X4))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [plus](X1,X2) = 2.X1 + X2 + 2 [s](X) = X [PLUS](X1,X2) = 2.X1 + X2 Problem 1: SCC Processor: -> Pairs: PLUS(s(X),plus(Y,Z)) -> PLUS(X,plus(s(s(Y)),Z)) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X1,plus(X3,plus(X2,X4))) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X2,X4) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X3,plus(X2,X4)) -> Rules: plus(s(X),plus(Y,Z)) -> plus(X,plus(s(s(Y)),Z)) plus(s(X1),plus(X2,plus(X3,X4))) -> plus(X1,plus(X3,plus(X2,X4))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(s(X),plus(Y,Z)) -> PLUS(X,plus(s(s(Y)),Z)) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X1,plus(X3,plus(X2,X4))) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X2,X4) PLUS(s(X1),plus(X2,plus(X3,X4))) -> PLUS(X3,plus(X2,X4)) popout

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

job log

popout

actions

all output return to TRS Stand 20472