details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	10.3219869137 seconds
cpu usage	37.5725872
max memory	1.8695168E9

stage attributes

key	value
output-size	6466
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 53 ms] (4) QDP (5) MRRProof [EQUIVALENT, 12 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 26 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(x1)) -> b(d(x1)) a(c(x1)) -> d(d(d(x1))) b(d(x1)) -> a(c(b(x1))) c(f(x1)) -> d(d(c(x1))) d(d(x1)) -> f(x1) f(f(x1)) -> a(x1) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: A(b(x1)) -> B(d(x1)) A(b(x1)) -> D(x1) A(c(x1)) -> D(d(d(x1))) A(c(x1)) -> D(d(x1)) A(c(x1)) -> D(x1) B(d(x1)) -> A(c(b(x1))) B(d(x1)) -> C(b(x1)) B(d(x1)) -> B(x1) C(f(x1)) -> D(d(c(x1))) C(f(x1)) -> D(c(x1)) C(f(x1)) -> C(x1) D(d(x1)) -> F(x1) F(f(x1)) -> A(x1) The TRS R consists of the following rules: a(b(x1)) -> b(d(x1)) a(c(x1)) -> d(d(d(x1))) b(d(x1)) -> a(c(b(x1))) c(f(x1)) -> d(d(c(x1))) d(d(x1)) -> f(x1) f(f(x1)) -> a(x1) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. A(b(x1)) -> D(x1) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = x_1 POL(B(x_1)) = 1 + x_1 POL(C(x_1)) = x_1 POL(D(x_1)) = x_1 POL(F(x_1)) = x_1 POL(a(x_1)) = x_1 POL(b(x_1)) = 1 + x_1 POL(c(x_1)) = x_1 popout

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

job log

popout

actions

all output return to SRS Standard