details

property	value
status	complete
benchmark	abbcaaaaa-aaaaaabbcaabbc.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.75377011299 seconds
cpu usage	4.083979294
max memory	3.30825728E8

stage attributes

key	value
output-size	3451
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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) Strip Symbols Proof [SOUND, 0 ms] (4) QTRS (5) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(b(c(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(b(b(c(a(a(b(b(c(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: a(a(a(a(a(c(b(b(a(x1))))))))) -> c(b(b(a(a(c(b(b(a(a(a(a(a(a(x1)))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(a(a(a(c(b(b(a(x1))))))))) -> c(b(b(a(a(c(b(b(a(a(a(a(a(a(x1)))))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(a(a(a(a(c(b(b(x)))))))) -> c(b(b(a(a(c(b(b(a(a(a(a(a(x))))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(a(c(b(b(x)))))))) -> c(b(b(a(a(c(b(b(a(a(a(a(a(x))))))))))))) Q is empty. ---------------------------------------- (5) 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(a(a(a(a(c(b(b(x)))))))) -> c(b(b(a(a(c(b(b(a(a(a(a(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 7, 8, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106 Node 7 is start node and node 8 is final node. Those nodes are connected through the following edges: * 7 to 58 labelled c_1(0)* 8 to 8 labelled #_1(0)* 58 to 59 labelled b_1(0)* 59 to 60 labelled b_1(0)* 60 to 61 labelled a_1(0)* 61 to 62 labelled a_1(0)* 62 to 63 labelled c_1(0)* 63 to 64 labelled b_1(0)* 64 to 65 labelled b_1(0)* 65 to 66 labelled a_1(0)* 65 to 95 labelled c_1(1)* 66 to 67 labelled a_1(0)* 66 to 95 labelled c_1(1)* 67 to 68 labelled a_1(0)* 67 to 95 labelled c_1(1)* 68 to 69 labelled a_1(0)* 68 to 95 labelled c_1(1)* 69 to 8 labelled a_1(0)* 69 to 95 labelled c_1(1)* 95 to 96 labelled b_1(1)* 96 to 97 labelled b_1(1)* 97 to 98 labelled a_1(1)* 98 to 99 labelled a_1(1)* 99 to 100 labelled c_1(1)* 100 to 101 labelled b_1(1)* 101 to 102 labelled b_1(1)* 102 to 103 labelled a_1(1)* 102 to 95 labelled c_1(1)* 103 to 104 labelled a_1(1)* 103 to 95 labelled c_1(1)* 104 to 105 labelled a_1(1)* 104 to 95 labelled c_1(1)* 105 to 106 labelled a_1(1)* 105 to 95 labelled c_1(1)* 106 to 8 labelled a_1(1)* 106 to 95 labelled c_1(1) ---------------------------------------- (6) YES popout

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

job log

popout

actions

all output return to SRS Stand 10685