details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.61574196815 seconds
cpu usage	3.443083615
max memory	2.20925952E8

stage attributes

key	value
output-size	1484
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, 0 ms] (2) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(x)) -> f(x) g(0) -> g(f(0)) The set Q consists of the following terms: f(f(x0)) g(0) ---------------------------------------- (1) 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: f(f(x)) -> f(x) g(0) -> g(f(0)) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 2, 3, 4 Node 1 is start node and node 2 is final node. Those nodes are connected through the following edges: * 1 to 2 labelled f_1(0), f_1(1)* 1 to 3 labelled g_1(0)* 2 to 2 labelled #_1(0)* 3 to 4 labelled f_1(0)* 4 to 2 labelled 0(0) ---------------------------------------- (2) YES popout

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

job log

popout

actions

all output return to TRS Innermost