details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0612480640411 seconds
cpu usage	0.060428918
max memory	3645440.0

stage attributes

key	value
output-size	2873
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 x1:S) (RULES 0(x1:S) -> 1(x1:S) 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: 4#(5(4(5(x1:S)))) -> 4#(4(5(5(x1:S)))) 4#(5(4(5(x1:S)))) -> 4#(5(5(x1:S))) 4#(5(4(5(x1:S)))) -> 5#(5(x1:S)) -> Rules: 0(x1:S) -> 1(x1:S) 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) Problem 1: SCC Processor: -> Pairs: 4#(5(4(5(x1:S)))) -> 4#(4(5(5(x1:S)))) 4#(5(4(5(x1:S)))) -> 4#(5(5(x1:S))) 4#(5(4(5(x1:S)))) -> 5#(5(x1:S)) -> Rules: 0(x1:S) -> 1(x1:S) 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: 4#(5(4(5(x1:S)))) -> 4#(4(5(5(x1:S)))) 4#(5(4(5(x1:S)))) -> 4#(5(5(x1:S))) ->->-> Rules: 0(x1:S) -> 1(x1:S) 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) Problem 1: Reduction Pair Processor: -> Pairs: 4#(5(4(5(x1:S)))) -> 4#(4(5(5(x1:S)))) 4#(5(4(5(x1:S)))) -> 4#(5(5(x1:S))) -> Rules: 0(x1:S) -> 1(x1:S) 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) -> Usable rules: 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [4](X) = X + 2 [5](X) = 2.X + 2 [2](X) = X + 1 [4#](X) = 2.X Problem 1: SCC Processor: -> Pairs: 4#(5(4(5(x1:S)))) -> 4#(5(5(x1:S))) -> Rules: 0(x1:S) -> 1(x1:S) 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: 4#(5(4(5(x1:S)))) -> 4#(5(5(x1:S))) ->->-> Rules: 0(x1:S) -> 1(x1:S) 4(5(4(5(x1:S)))) -> 4(4(5(5(x1:S)))) 5(5(5(5(5(5(4(4(4(4(4(4(x1:S)))))))))))) -> 2(x1:S) Problem 1: Reduction Pair Processor: -> Pairs: popout

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

job log

popout

actions

all output return to SRS Standard