details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.445482969284 seconds
cpu usage	0.33497919
max memory	7766016.0

stage attributes

key	value
output-size	6556
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 i(0(x1:S)) -> p(s(p(s(0(p(s(p(s(x1:S))))))))) i(s(x1:S)) -> p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))))))))) j(0(x1:S)) -> p(s(p(p(s(s(0(p(s(p(s(x1:S))))))))))) j(s(x1:S)) -> s(s(s(s(p(p(s(s(i(p(s(p(s(x1:S))))))))))))) p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(s(s(s(s(s(s(x1:S))))))))) p(s(x1:S)) -> x1:S ) Problem 1: Dependency Pairs Processor: -> Pairs: I(0(x1:S)) -> P(s(p(s(0(p(s(p(s(x1:S))))))))) I(0(x1:S)) -> P(s(p(s(x1:S)))) I(0(x1:S)) -> P(s(0(p(s(p(s(x1:S))))))) I(0(x1:S)) -> P(s(x1:S)) I(s(x1:S)) -> J(p(s(p(s(p(p(p(p(s(s(s(s(x1:S))))))))))))) I(s(x1:S)) -> P(p(p(p(s(s(s(s(x1:S)))))))) I(s(x1:S)) -> P(p(p(s(s(s(s(x1:S))))))) I(s(x1:S)) -> P(p(s(s(s(s(x1:S)))))) I(s(x1:S)) -> P(s(p(p(p(p(s(s(s(s(x1:S)))))))))) I(s(x1:S)) -> P(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))) I(s(x1:S)) -> P(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))))))))) I(s(x1:S)) -> P(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))))))) I(s(x1:S)) -> P(s(s(s(s(x1:S))))) J(0(x1:S)) -> P(p(s(s(0(p(s(p(s(x1:S))))))))) J(0(x1:S)) -> P(s(p(p(s(s(0(p(s(p(s(x1:S))))))))))) J(0(x1:S)) -> P(s(p(s(x1:S)))) J(0(x1:S)) -> P(s(s(0(p(s(p(s(x1:S)))))))) J(0(x1:S)) -> P(s(x1:S)) J(s(x1:S)) -> I(p(s(p(s(x1:S))))) J(s(x1:S)) -> P(p(s(s(i(p(s(p(s(x1:S))))))))) J(s(x1:S)) -> P(s(p(s(x1:S)))) J(s(x1:S)) -> P(s(s(i(p(s(p(s(x1:S)))))))) J(s(x1:S)) -> P(s(x1:S)) P(p(s(x1:S))) -> P(x1:S) -> Rules: i(0(x1:S)) -> p(s(p(s(0(p(s(p(s(x1:S))))))))) i(s(x1:S)) -> p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))))))))) j(0(x1:S)) -> p(s(p(p(s(s(0(p(s(p(s(x1:S))))))))))) j(s(x1:S)) -> s(s(s(s(p(p(s(s(i(p(s(p(s(x1:S))))))))))))) p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(s(s(s(s(s(s(x1:S))))))))) p(s(x1:S)) -> x1:S Problem 1: SCC Processor: -> Pairs: I(0(x1:S)) -> P(s(p(s(0(p(s(p(s(x1:S))))))))) I(0(x1:S)) -> P(s(p(s(x1:S)))) I(0(x1:S)) -> P(s(0(p(s(p(s(x1:S))))))) I(0(x1:S)) -> P(s(x1:S)) I(s(x1:S)) -> J(p(s(p(s(p(p(p(p(s(s(s(s(x1:S))))))))))))) I(s(x1:S)) -> P(p(p(p(s(s(s(s(x1:S)))))))) I(s(x1:S)) -> P(p(p(s(s(s(s(x1:S))))))) I(s(x1:S)) -> P(p(s(s(s(s(x1:S)))))) I(s(x1:S)) -> P(s(p(p(p(p(s(s(s(s(x1:S)))))))))) I(s(x1:S)) -> P(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))) I(s(x1:S)) -> P(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))))))))) I(s(x1:S)) -> P(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))))))) I(s(x1:S)) -> P(s(s(s(s(x1:S))))) J(0(x1:S)) -> P(p(s(s(0(p(s(p(s(x1:S))))))))) J(0(x1:S)) -> P(s(p(p(s(s(0(p(s(p(s(x1:S))))))))))) J(0(x1:S)) -> P(s(p(s(x1:S)))) J(0(x1:S)) -> P(s(s(0(p(s(p(s(x1:S)))))))) J(0(x1:S)) -> P(s(x1:S)) J(s(x1:S)) -> I(p(s(p(s(x1:S))))) J(s(x1:S)) -> P(p(s(s(i(p(s(p(s(x1:S))))))))) J(s(x1:S)) -> P(s(p(s(x1:S)))) J(s(x1:S)) -> P(s(s(i(p(s(p(s(x1:S)))))))) J(s(x1:S)) -> P(s(x1:S)) P(p(s(x1:S))) -> P(x1:S) -> Rules: i(0(x1:S)) -> p(s(p(s(0(p(s(p(s(x1:S))))))))) i(s(x1:S)) -> p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1:S)))))))))))))))))) j(0(x1:S)) -> p(s(p(p(s(s(0(p(s(p(s(x1:S))))))))))) j(s(x1:S)) -> s(s(s(s(p(p(s(s(i(p(s(p(s(x1:S))))))))))))) p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(s(s(s(s(s(s(x1:S))))))))) p(s(x1:S)) -> x1:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(p(s(x1:S))) -> P(x1:S) ->->-> Rules: i(0(x1:S)) -> p(s(p(s(0(p(s(p(s(x1:S))))))))) popout

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

job log

popout

actions

all output return to SRS Standard