details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.192363977432 seconds
cpu usage	0.093375497
max memory	4034560.0

stage attributes

key	value
output-size	5530
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 v_NonEmpty:S x1:S) (RULES p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(s(x1:S)))) p(s(x1:S)) -> x1:S q(0(x1:S)) -> p(p(s(s(0(s(s(s(s(x1:S))))))))) q(s(x1:S)) -> p(p(s(s(s(s(s(s(r(p(p(s(s(x1:S))))))))))))) r(0(x1:S)) -> p(s(p(s(0(p(p(p(s(s(s(x1:S))))))))))) r(s(x1:S)) -> p(s(p(s(s(q(p(s(p(s(x1:S)))))))))) ) Problem 1: Dependency Pairs Processor: -> Pairs: P(p(s(x1:S))) -> P(x1:S) Q(0(x1:S)) -> P(p(s(s(0(s(s(s(s(x1:S))))))))) Q(0(x1:S)) -> P(s(s(0(s(s(s(s(x1:S)))))))) Q(s(x1:S)) -> P(p(s(s(s(s(s(s(r(p(p(s(s(x1:S))))))))))))) Q(s(x1:S)) -> P(p(s(s(x1:S)))) Q(s(x1:S)) -> P(s(s(s(s(s(s(r(p(p(s(s(x1:S)))))))))))) Q(s(x1:S)) -> P(s(s(x1:S))) Q(s(x1:S)) -> R(p(p(s(s(x1:S))))) R(0(x1:S)) -> P(p(p(s(s(s(x1:S)))))) R(0(x1:S)) -> P(p(s(s(s(x1:S))))) R(0(x1:S)) -> P(s(p(s(0(p(p(p(s(s(s(x1:S))))))))))) R(0(x1:S)) -> P(s(0(p(p(p(s(s(s(x1:S))))))))) R(0(x1:S)) -> P(s(s(s(x1:S)))) R(s(x1:S)) -> P(s(p(s(s(q(p(s(p(s(x1:S)))))))))) R(s(x1:S)) -> P(s(p(s(x1:S)))) R(s(x1:S)) -> P(s(s(q(p(s(p(s(x1:S)))))))) R(s(x1:S)) -> P(s(x1:S)) R(s(x1:S)) -> Q(p(s(p(s(x1:S))))) -> Rules: p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(s(x1:S)))) p(s(x1:S)) -> x1:S q(0(x1:S)) -> p(p(s(s(0(s(s(s(s(x1:S))))))))) q(s(x1:S)) -> p(p(s(s(s(s(s(s(r(p(p(s(s(x1:S))))))))))))) r(0(x1:S)) -> p(s(p(s(0(p(p(p(s(s(s(x1:S))))))))))) r(s(x1:S)) -> p(s(p(s(s(q(p(s(p(s(x1:S)))))))))) Problem 1: SCC Processor: -> Pairs: P(p(s(x1:S))) -> P(x1:S) Q(0(x1:S)) -> P(p(s(s(0(s(s(s(s(x1:S))))))))) Q(0(x1:S)) -> P(s(s(0(s(s(s(s(x1:S)))))))) Q(s(x1:S)) -> P(p(s(s(s(s(s(s(r(p(p(s(s(x1:S))))))))))))) Q(s(x1:S)) -> P(p(s(s(x1:S)))) Q(s(x1:S)) -> P(s(s(s(s(s(s(r(p(p(s(s(x1:S)))))))))))) Q(s(x1:S)) -> P(s(s(x1:S))) Q(s(x1:S)) -> R(p(p(s(s(x1:S))))) R(0(x1:S)) -> P(p(p(s(s(s(x1:S)))))) R(0(x1:S)) -> P(p(s(s(s(x1:S))))) R(0(x1:S)) -> P(s(p(s(0(p(p(p(s(s(s(x1:S))))))))))) R(0(x1:S)) -> P(s(0(p(p(p(s(s(s(x1:S))))))))) R(0(x1:S)) -> P(s(s(s(x1:S)))) R(s(x1:S)) -> P(s(p(s(s(q(p(s(p(s(x1:S)))))))))) R(s(x1:S)) -> P(s(p(s(x1:S)))) R(s(x1:S)) -> P(s(s(q(p(s(p(s(x1:S)))))))) R(s(x1:S)) -> P(s(x1:S)) R(s(x1:S)) -> Q(p(s(p(s(x1:S))))) -> Rules: p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(s(x1:S)))) p(s(x1:S)) -> x1:S q(0(x1:S)) -> p(p(s(s(0(s(s(s(s(x1:S))))))))) q(s(x1:S)) -> p(p(s(s(s(s(s(s(r(p(p(s(s(x1:S))))))))))))) r(0(x1:S)) -> p(s(p(s(0(p(p(p(s(s(s(x1:S))))))))))) r(s(x1:S)) -> p(s(p(s(s(q(p(s(p(s(x1:S)))))))))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(p(s(x1:S))) -> P(x1:S) ->->-> Rules: p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(s(x1:S)))) p(s(x1:S)) -> x1:S q(0(x1:S)) -> p(p(s(s(0(s(s(s(s(x1:S))))))))) q(s(x1:S)) -> p(p(s(s(s(s(s(s(r(p(p(s(s(x1:S))))))))))))) r(0(x1:S)) -> p(s(p(s(0(p(p(p(s(s(s(x1:S))))))))))) r(s(x1:S)) -> p(s(p(s(s(q(p(s(p(s(x1:S)))))))))) ->->Cycle: ->->-> Pairs: Q(s(x1:S)) -> R(p(p(s(s(x1:S))))) R(s(x1:S)) -> Q(p(s(p(s(x1:S))))) ->->-> Rules: p(p(s(x1:S))) -> p(x1:S) popout

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

job log

popout

actions

all output return to SRS Standard