details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.18345999718 seconds
cpu usage	5.546447561
max memory	4.7130624E8

stage attributes

key	value
output-size	6570
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [SOUND, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 24 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(X)) -> mark(if(X, c, f(true))) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) active(f(X)) -> f(active(X)) active(if(X1, X2, X3)) -> if(active(X1), X2, X3) active(if(X1, X2, X3)) -> if(X1, active(X2), X3) f(mark(X)) -> mark(f(X)) if(mark(X1), X2, X3) -> mark(if(X1, X2, X3)) if(X1, mark(X2), X3) -> mark(if(X1, X2, X3)) proper(f(X)) -> f(proper(X)) proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) proper(c) -> ok(c) proper(true) -> ok(true) proper(false) -> ok(false) f(ok(X)) -> ok(f(X)) 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(f(x0)) active(if(x0, x1, x2)) f(mark(x0)) if(mark(x0), x1, x2) if(x0, mark(x1), x2) proper(f(x0)) proper(if(x0, x1, x2)) proper(c) proper(true) proper(false) f(ok(x0)) if(ok(x0), ok(x1), ok(x2)) top(mark(x0)) top(ok(x0)) ---------------------------------------- (1) QTRSToCSRProof (SOUND) The following Q TRS is given: Q restricted rewrite system: The TRS R consists of the following rules: active(f(X)) -> mark(if(X, c, f(true))) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) active(f(X)) -> f(active(X)) active(if(X1, X2, X3)) -> if(active(X1), X2, X3) active(if(X1, X2, X3)) -> if(X1, active(X2), X3) f(mark(X)) -> mark(f(X)) if(mark(X1), X2, X3) -> mark(if(X1, X2, X3)) if(X1, mark(X2), X3) -> mark(if(X1, X2, X3)) proper(f(X)) -> f(proper(X)) proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) proper(c) -> ok(c) proper(true) -> ok(true) proper(false) -> ok(false) f(ok(X)) -> ok(f(X)) 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(f(x0)) active(if(x0, x1, x2)) f(mark(x0)) popout

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

job log

popout

actions

all output return to TRS Innermost