details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.63725 seconds
cpu usage	3.49723
user time	3.31116
system time	0.186069
max virtual memory	1.8342904E7
max residence set size	241288.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: a(b(x)) -> b(a(x)) a(c(x)) -> x 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: a(b(x)) -> b(a(x)) a(c(x)) -> x 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 b_1(0), b_1(1)* 1 to 2 labelled a_1(0), b_1(0), c_1(0), a_1(1), b_1(1), c_1(1)* 1 to 4 labelled b_1(1)* 2 to 2 labelled #_1(0)* 3 to 2 labelled a_1(0), a_1(1), b_1(1), c_1(1)* 3 to 1 labelled b_1(1)* 3 to 3 labelled b_1(1)* 4 to 2 labelled a_1(1), b_1(1), c_1(1)* 4 to 3 labelled b_1(1) ---------------------------------------- (2) YES popout

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

job log

popout

actions

all output return to TRS Standard