details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.71423697472 seconds
cpu usage	3.755914378
max memory	2.60345856E8

stage attributes

key	value
output-size	2727
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) RFCMatchBoundsTRSProof [EQUIVALENT, 20 ms] (2) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(g(X)) -> mark(h(X)) active(c) -> mark(d) active(h(d)) -> mark(g(c)) mark(g(X)) -> active(g(X)) mark(h(X)) -> active(h(X)) mark(c) -> active(c) mark(d) -> active(d) g(mark(X)) -> g(X) g(active(X)) -> g(X) h(mark(X)) -> h(X) h(active(X)) -> h(X) The set Q consists of the following terms: active(g(x0)) active(c) active(h(d)) mark(g(x0)) mark(h(x0)) mark(c) mark(d) g(mark(x0)) g(active(x0)) h(mark(x0)) h(active(x0)) ---------------------------------------- (1) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 4. This implies Q-termination of R. The following rules were used to construct the certificate: active(g(X)) -> mark(h(X)) active(c) -> mark(d) active(h(d)) -> mark(g(c)) mark(g(X)) -> active(g(X)) mark(h(X)) -> active(h(X)) mark(c) -> active(c) mark(d) -> active(d) g(mark(X)) -> g(X) g(active(X)) -> g(X) h(mark(X)) -> h(X) h(active(X)) -> h(X) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 2, 5, 6, 7, 8, 16, 17, 18, 19, 20 Node 1 is start node and node 2 is final node. Those nodes are connected through the following edges: * 1 to 5 labelled mark_1(0), active_1(0), active_1(1), mark_1(1)* 1 to 6 labelled mark_1(0)* 1 to 8 labelled active_1(0)* 1 to 7 labelled active_1(0)* 1 to 2 labelled g_1(0), h_1(0), g_1(1), h_1(1)* 1 to 16 labelled active_1(1), mark_1(1)* 1 to 17 labelled active_1(2)* 1 to 18 labelled mark_1(2)* 1 to 19 labelled mark_1(3), active_1(3)* 1 to 20 labelled active_1(4)* 2 to 2 labelled #_1(0)* 5 to 2 labelled h_1(0), d(0), h_1(1)* 6 to 7 labelled g_1(0)* 7 to 2 labelled c(0), c(1)* 8 to 2 labelled g_1(0), g_1(1)* 16 to 2 labelled h_1(1), d(1)* 16 to 7 labelled g_1(1)* 17 to 2 labelled h_1(2), d(2), h_1(1)* 17 to 7 labelled g_1(2)* 18 to 7 labelled h_1(2)* 19 to 7 labelled h_1(3)* 20 to 7 labelled h_1(4) ---------------------------------------- (2) YES popout

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

job log

popout

actions

all output return to TRS Innermost