details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.51512098312 seconds
cpu usage	3.33934119
max memory	2.17382912E8

stage attributes

key	value
output-size	2585
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) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (2) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(n__f(n__a)) -> f(n__g(n__f(n__a))) f(X) -> n__f(X) a -> n__a g(X) -> n__g(X) activate(n__f(X)) -> f(X) activate(n__a) -> a activate(n__g(X)) -> g(activate(X)) activate(X) -> X Q is empty. ---------------------------------------- (1) 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: f(n__f(n__a)) -> f(n__g(n__f(n__a))) f(X) -> n__f(X) a -> n__a g(X) -> n__g(X) activate(n__f(X)) -> f(X) activate(n__a) -> a activate(n__g(X)) -> g(activate(X)) activate(X) -> X The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 Node 1 is start node and node 2 is final node. Those nodes are connected through the following edges: * 1 to 3 labelled f_1(0), n__f_1(1)* 1 to 2 labelled n__f_1(0), n__a(0), n__g_1(0), f_1(0), a(0), g_1(0), activate_1(0), n__f_1(1), n__a(1), n__g_1(1), f_1(1), a(1), g_1(1), activate_1(1), n__f_1(2), n__a(2), n__g_1(2)* 1 to 6 labelled g_1(0), n__g_1(1)* 1 to 7 labelled f_1(1), n__f_1(2)* 1 to 10 labelled g_1(1), n__g_1(2)* 1 to 1 labelled g_1(1), n__g_1(2)* 2 to 2 labelled #_1(0)* 3 to 4 labelled n__g_1(0)* 4 to 5 labelled n__f_1(0)* 5 to 2 labelled n__a(0)* 6 to 2 labelled activate_1(0), f_1(1), a(1), n__f_1(1), n__a(1), n__g_1(1), g_1(1), activate_1(1), n__f_1(2), n__a(2), n__g_1(2)* 6 to 1 labelled g_1(1), n__g_1(2)* 6 to 7 labelled f_1(1), n__f_1(2)* 7 to 8 labelled n__g_1(1)* 8 to 9 labelled n__f_1(1)* 9 to 2 labelled n__a(1)* 10 to 2 labelled activate_1(1), f_1(1), a(1), n__f_1(1), n__a(1), n__g_1(1), g_1(1), n__f_1(2), n__a(2), n__g_1(2)* 10 to 1 labelled g_1(1), n__g_1(2)* 10 to 7 labelled f_1(1), n__f_1(2) ---------------------------------------- (2) YES popout

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

job log

popout

actions

all output return to TRS Stand 20472