details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.16572403908 seconds
cpu usage	5.706972406
max memory	4.97324032E8

stage attributes

key	value
output-size	1476
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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) RFCMatchBoundsTRSProof [EQUIVALENT, 9 ms] (2) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(x))) -> b(a(b(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(a(x))) -> b(a(b(x))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 2, 5, 6, 7, 8 Node 1 is start node and node 2 is final node. Those nodes are connected through the following edges: * 1 to 5 labelled b_1(0)* 2 to 2 labelled #_1(0)* 5 to 6 labelled a_1(0)* 5 to 7 labelled b_1(1)* 6 to 2 labelled b_1(0)* 7 to 8 labelled a_1(1)* 7 to 7 labelled b_1(1)* 8 to 2 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