details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.49694 seconds
cpu usage	3.24754
user time	3.09862
system time	0.148921
max virtual memory	1.8478328E7
max residence set size	223628.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) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (2) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(h(x)) -> f(i(x)) g(i(x)) -> g(h(x)) h(a) -> b i(a) -> b Q is empty. ---------------------------------------- (1) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. This implies Q-termination of R. The following rules were used to construct the certificate: f(h(x)) -> f(i(x)) g(i(x)) -> g(h(x)) h(a) -> b i(a) -> b The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 2, 3, 4 Node 1 is start node and node 2 is final node. Those nodes are connected through the following edges: * 1 to 3 labelled f_1(0)* 1 to 4 labelled g_1(0)* 1 to 2 labelled b(0)* 2 to 2 labelled #_1(0)* 3 to 2 labelled i_1(0), b(1)* 4 to 2 labelled h_1(0), b(1) ---------------------------------------- (2) YES popout

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

job log

popout

actions

all output return to TRS Standard