details

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

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	1.95614290237 seconds
cpu usage	3.902039841
max memory	2.62623232E8

stage attributes

key	value
output-size	1360
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: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished 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)) -> c c -> d h(X) -> c Q is empty. ---------------------------------------- (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)) -> c c -> d h(X) -> c The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 3 Node 1 is start node and node 3 is final node. Those nodes are connected through the following edges: * 1 to 3 labelled c(0), d(0), d(1)* 3 to 3 labelled #_1(0) ---------------------------------------- (2) YES popout

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

job log

popout

actions

all output return to TRS Standard