details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.62707 seconds
cpu usage	3.53938
user time	3.36518
system time	0.174203
max virtual memory	1.8609628E7
max residence set size	269604.0

stage attributes

key	value
starexec-result	YES

output

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) QTRS Reverse [SOUND, 0 ms] (2) QTRS (3) RFCMatchBoundsTRSProof [EQUIVALENT, 17 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(f(a))) -> mark(c(f(g(f(a))))) active(f(X)) -> f(active(X)) active(g(X)) -> g(active(X)) f(mark(X)) -> mark(f(X)) g(mark(X)) -> mark(g(X)) proper(f(X)) -> f(proper(X)) proper(a) -> ok(a) proper(c(X)) -> c(proper(X)) proper(g(X)) -> g(proper(X)) f(ok(X)) -> ok(f(X)) c(ok(X)) -> ok(c(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(f(x0)) active(g(x0)) f(mark(x0)) g(mark(x0)) proper(f(x0)) proper(a) proper(c(x0)) proper(g(x0)) f(ok(x0)) c(ok(x0)) g(ok(x0)) top(mark(x0)) top(ok(x0)) ---------------------------------------- (1) QTRS Reverse (SOUND) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a'(f(f(active(x)))) -> a'(f(g(f(c(mark(x)))))) f(active(X)) -> active(f(X)) g(active(X)) -> active(g(X)) mark(f(X)) -> f(mark(X)) mark(g(X)) -> g(mark(X)) f(proper(X)) -> proper(f(X)) a'(proper(x)) -> a'(ok(x)) c(proper(X)) -> proper(c(X)) g(proper(X)) -> proper(g(X)) ok(f(X)) -> f(ok(X)) ok(c(X)) -> c(ok(X)) ok(g(X)) -> g(ok(X)) mark(top(X)) -> proper(top(X)) ok(top(X)) -> active(top(X)) Q is empty. ---------------------------------------- (3) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 6. This implies Q-termination of R. The following rules were used to construct the certificate: a'(f(f(active(x)))) -> a'(f(g(f(c(mark(x)))))) f(active(X)) -> active(f(X)) g(active(X)) -> active(g(X)) mark(f(X)) -> f(mark(X)) mark(g(X)) -> g(mark(X)) f(proper(X)) -> proper(f(X)) a'(proper(x)) -> a'(ok(x)) c(proper(X)) -> proper(c(X)) g(proper(X)) -> proper(g(X)) ok(f(X)) -> f(ok(X)) ok(c(X)) -> c(ok(X)) ok(g(X)) -> g(ok(X)) mark(top(X)) -> proper(top(X)) popout

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

job log

popout

actions

all output return to TRS Innermost