details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.84346199036 seconds
cpu usage	4.310882935
max memory	2.58125824E8

stage attributes

key	value
output-size	12189
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [SOUND, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 58 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 5 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) RisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(minus(0, Y)) -> mark(0) active(minus(s(X), s(Y))) -> mark(minus(X, Y)) active(geq(X, 0)) -> mark(true) active(geq(0, s(Y))) -> mark(false) active(geq(s(X), s(Y))) -> mark(geq(X, Y)) active(div(0, s(Y))) -> mark(0) active(div(s(X), s(Y))) -> mark(if(geq(X, Y), s(div(minus(X, Y), s(Y))), 0)) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) active(s(X)) -> s(active(X)) active(div(X1, X2)) -> div(active(X1), X2) active(if(X1, X2, X3)) -> if(active(X1), X2, X3) s(mark(X)) -> mark(s(X)) div(mark(X1), X2) -> mark(div(X1, X2)) if(mark(X1), X2, X3) -> mark(if(X1, X2, X3)) proper(minus(X1, X2)) -> minus(proper(X1), proper(X2)) proper(0) -> ok(0) proper(s(X)) -> s(proper(X)) proper(geq(X1, X2)) -> geq(proper(X1), proper(X2)) proper(true) -> ok(true) proper(false) -> ok(false) proper(div(X1, X2)) -> div(proper(X1), proper(X2)) proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) minus(ok(X1), ok(X2)) -> ok(minus(X1, X2)) s(ok(X)) -> ok(s(X)) geq(ok(X1), ok(X2)) -> ok(geq(X1, X2)) div(ok(X1), ok(X2)) -> ok(div(X1, X2)) if(ok(X1), ok(X2), ok(X3)) -> ok(if(X1, X2, X3)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(minus(0, x0)) active(minus(s(x0), s(x1))) active(geq(x0, 0)) active(geq(0, s(x0))) active(geq(s(x0), s(x1))) active(s(x0)) active(div(x0, x1)) active(if(x0, x1, x2)) s(mark(x0)) div(mark(x0), x1) if(mark(x0), x1, x2) proper(minus(x0, x1)) proper(0) proper(s(x0)) proper(geq(x0, x1)) proper(true) proper(false) proper(div(x0, x1)) proper(if(x0, x1, x2)) minus(ok(x0), ok(x1)) s(ok(x0)) geq(ok(x0), ok(x1)) div(ok(x0), ok(x1)) if(ok(x0), ok(x1), ok(x2)) top(mark(x0)) top(ok(x0)) ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Innermost