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	n051.star.cs.uiowa.edu
space	Secret_06_SRS

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.842231035233 seconds
cpu usage	0.805846759
max memory	9269248.0

stage attributes

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

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

job log

popout

actions

all output return to SRS Stand 10685