details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.59968 seconds
cpu usage	3.6878
user time	3.51818
system time	0.169622
max virtual memory	1.8943252E7
max residence set size	264040.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 [EQUIVALENT, 0 ms] (2) QTRS (3) RFCMatchBoundsTRSProof [EQUIVALENT, 6 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(c(b(x1))) -> b(a(b(a(x1)))) b(x1) -> c(a(c(x1))) a(a(x1)) -> a(b(c(a(x1)))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(c(a(x1))) -> a(b(a(b(x1)))) b(x1) -> c(a(c(x1))) a(a(x1)) -> a(c(b(a(x1)))) Q is empty. ---------------------------------------- (3) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 3. This implies Q-termination of R. The following rules were used to construct the certificate: b(c(a(x1))) -> a(b(a(b(x1)))) b(x1) -> c(a(c(x1))) a(a(x1)) -> a(c(b(a(x1)))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60 Node 23 is start node and node 24 is final node. Those nodes are connected through the following edges: * 23 to 25 labelled a_1(0)* 23 to 28 labelled c_1(0)* 23 to 30 labelled a_1(0)* 24 to 24 labelled #_1(0)* 25 to 26 labelled b_1(0)* 25 to 33 labelled c_1(1)* 26 to 27 labelled a_1(0)* 26 to 51 labelled a_1(1)* 27 to 24 labelled b_1(0)* 27 to 35 labelled c_1(1)* 27 to 39 labelled a_1(1)* 28 to 29 labelled a_1(0)* 29 to 24 labelled c_1(0)* 30 to 31 labelled c_1(0)* 31 to 32 labelled b_1(0)* 31 to 37 labelled c_1(1)* 32 to 24 labelled a_1(0)* 32 to 42 labelled a_1(1)* 33 to 34 labelled a_1(1)* 34 to 26 labelled c_1(1)* 35 to 36 labelled a_1(1)* 36 to 24 labelled c_1(1)* 37 to 38 labelled a_1(1)* 38 to 32 labelled c_1(1)* 39 to 40 labelled b_1(1)* 39 to 45 labelled c_1(2)* 40 to 41 labelled a_1(1)* 40 to 56 labelled a_1(2)* 41 to 24 labelled b_1(1)* 41 to 47 labelled c_1(2)* 41 to 39 labelled a_1(1)* 42 to 43 labelled c_1(1)* 43 to 44 labelled b_1(1)* 43 to 49 labelled c_1(2)* 44 to 24 labelled a_1(1)* 44 to 42 labelled a_1(1)* 45 to 46 labelled a_1(2)* 46 to 40 labelled c_1(2)* 47 to 48 labelled a_1(2)* 48 to 24 labelled c_1(2)* 49 to 50 labelled a_1(2)* 50 to 44 labelled c_1(2)* 51 to 52 labelled c_1(1)* 52 to 53 labelled b_1(1)* 52 to 54 labelled c_1(2)* 53 to 39 labelled a_1(1)* 54 to 55 labelled a_1(2)* 55 to 53 labelled c_1(2)* 56 to 57 labelled c_1(2)* 57 to 58 labelled b_1(2)* 57 to 59 labelled c_1(3)* 58 to 39 labelled a_1(2)* 59 to 60 labelled a_1(3)* 60 to 58 labelled c_1(3) ---------------------------------------- (4) YES popout

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

job log

popout

actions

all output return to SRS Standard