details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.55481696129 seconds
cpu usage	3.494633432
max memory	2.56733184E8

stage attributes

key	value
output-size	2632
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(b(a(a(x1))))) -> a(a(b(b(a(b(a(b(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: a(a(b(a(b(x1))))) -> a(b(a(b(a(b(b(a(a(x1))))))))) Q is empty. ---------------------------------------- (3) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. This implies Q-termination of R. The following rules were used to construct the certificate: a(a(b(a(b(x1))))) -> a(b(a(b(a(b(b(a(a(x1))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94 Node 69 is start node and node 70 is final node. Those nodes are connected through the following edges: * 69 to 71 labelled a_1(0)* 70 to 70 labelled #_1(0)* 71 to 72 labelled b_1(0)* 72 to 73 labelled a_1(0)* 73 to 74 labelled b_1(0)* 74 to 75 labelled a_1(0)* 75 to 76 labelled b_1(0)* 76 to 77 labelled b_1(0)* 77 to 78 labelled a_1(0)* 77 to 79 labelled a_1(1)* 78 to 70 labelled a_1(0)* 78 to 79 labelled a_1(1)* 79 to 80 labelled b_1(1)* 80 to 81 labelled a_1(1)* 81 to 82 labelled b_1(1)* 82 to 83 labelled a_1(1)* 83 to 84 labelled b_1(1)* 84 to 85 labelled b_1(1)* 85 to 86 labelled a_1(1)* 85 to 79 labelled a_1(1)* 85 to 87 labelled a_1(2)* 86 to 70 labelled a_1(1)* 86 to 79 labelled a_1(1)* 86 to 82 labelled a_1(1)* 87 to 88 labelled b_1(2)* 88 to 89 labelled a_1(2)* 89 to 90 labelled b_1(2)* 90 to 91 labelled a_1(2)* 91 to 92 labelled b_1(2)* 92 to 93 labelled b_1(2)* 93 to 94 labelled a_1(2)* 94 to 82 labelled a_1(2) ---------------------------------------- (4) YES popout

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

job log

popout

actions

all output return to SRS Stand 10685