details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.99050879478 seconds
cpu usage	8.378445509
max memory	7.23222528E8

stage attributes

key	value
output-size	4121
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 56 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 3 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) MRRProof [EQUIVALENT, 33 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(c(c(c(x1)))) b(c(x1)) -> d(d(d(d(x1)))) a(x1) -> d(c(d(x1))) b(b(x1)) -> c(c(c(x1))) c(c(x1)) -> d(d(d(x1))) c(d(d(x1))) -> a(x1) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a(x_1)) = 25 + x_1 POL(b(x_1)) = 17 + x_1 POL(c(x_1)) = 11 + x_1 POL(d(x_1)) = 7 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: b(b(x1)) -> c(c(c(x1))) c(c(x1)) -> d(d(d(x1))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(c(c(c(x1)))) b(c(x1)) -> d(d(d(d(x1)))) a(x1) -> d(c(d(x1))) c(d(d(x1))) -> a(x1) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A(a(x1)) -> B(c(c(c(x1)))) A(a(x1)) -> C(c(c(x1))) A(a(x1)) -> C(c(x1)) A(a(x1)) -> C(x1) A(x1) -> C(d(x1)) C(d(d(x1))) -> A(x1) The TRS R consists of the following rules: a(a(x1)) -> b(c(c(c(x1)))) b(c(x1)) -> d(d(d(d(x1)))) a(x1) -> d(c(d(x1))) c(d(d(x1))) -> a(x1) Q is empty. popout

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

job log

popout

actions

all output return to SRS Stand 10685