details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.7446680069 seconds
cpu usage	3.879557613
max memory	2.06626816E8

stage attributes

key	value
output-size	3286
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(c(c(a(a(a(a(x1)))))))) -> a(a(a(a(a(b(c(c(a(a(b(c(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(c(c(b(a(x1)))))))) -> c(c(b(a(a(c(c(b(a(a(a(a(a(x1))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(a(a(c(c(b(a(x1)))))))) -> c(c(b(a(a(c(c(b(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(c(c(b(x))))))) -> c(c(b(a(a(c(c(b(a(a(a(a(x)))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(c(c(b(x))))))) -> c(c(b(a(a(c(c(b(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(c(c(b(x))))))) -> c(c(b(a(a(c(c(b(a(a(a(a(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88 Node 53 is start node and node 54 is final node. Those nodes are connected through the following edges: * 53 to 55 labelled c_1(0)* 54 to 54 labelled #_1(0)* 55 to 56 labelled c_1(0)* 56 to 57 labelled b_1(0)* 57 to 58 labelled a_1(0)* 58 to 59 labelled a_1(0)* 59 to 60 labelled c_1(0)* 60 to 61 labelled c_1(0)* 61 to 62 labelled b_1(0)* 62 to 63 labelled a_1(0)* 62 to 78 labelled c_1(1)* 63 to 64 labelled a_1(0)* 63 to 78 labelled c_1(1)* 64 to 65 labelled a_1(0)* 64 to 78 labelled c_1(1)* 65 to 54 labelled a_1(0)* 65 to 78 labelled c_1(1)* 78 to 79 labelled c_1(1)* 79 to 80 labelled b_1(1)* 80 to 81 labelled a_1(1)* 81 to 82 labelled a_1(1)* 82 to 83 labelled c_1(1)* 83 to 84 labelled c_1(1)* 84 to 85 labelled b_1(1)* 85 to 86 labelled a_1(1)* 85 to 78 labelled c_1(1)* 86 to 87 labelled a_1(1)* 86 to 78 labelled c_1(1)* 87 to 88 labelled a_1(1)* 87 to 78 labelled c_1(1)* 88 to 54 labelled a_1(1)* 88 to 78 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