details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.63165307045 seconds
cpu usage	18.881275811
max memory	2.225012736E9

stage attributes

key	value
output-size	3038
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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) DependencyPairsProof [EQUIVALENT, 29 ms] (2) QDP (3) MRRProof [EQUIVALENT, 50 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(x1) b(a(x1)) -> a(b(x1)) b(b(c(x1))) -> c(a(x1)) b(b(x1)) -> a(a(a(x1))) c(a(x1)) -> b(a(c(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(a(x1)) -> B(x1) B(a(x1)) -> A(b(x1)) B(a(x1)) -> B(x1) B(b(c(x1))) -> C(a(x1)) B(b(c(x1))) -> A(x1) B(b(x1)) -> A(a(a(x1))) B(b(x1)) -> A(a(x1)) B(b(x1)) -> A(x1) C(a(x1)) -> B(a(c(x1))) C(a(x1)) -> A(c(x1)) C(a(x1)) -> C(x1) The TRS R consists of the following rules: a(a(x1)) -> b(x1) b(a(x1)) -> a(b(x1)) b(b(c(x1))) -> c(a(x1)) b(b(x1)) -> a(a(a(x1))) c(a(x1)) -> b(a(c(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) MRRProof (EQUIVALENT) By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented. Strictly oriented dependency pairs: B(a(x1)) -> A(b(x1)) B(a(x1)) -> B(x1) B(b(c(x1))) -> A(x1) B(b(x1)) -> A(a(a(x1))) B(b(x1)) -> A(a(x1)) B(b(x1)) -> A(x1) C(a(x1)) -> B(a(c(x1))) C(a(x1)) -> A(c(x1)) C(a(x1)) -> C(x1) Strictly oriented rules of the TRS R: a(a(x1)) -> b(x1) c(a(x1)) -> b(a(c(x1))) Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = 1 + x_1 POL(B(x_1)) = 3 + x_1 POL(C(x_1)) = 2 + 3*x_1 POL(a(x_1)) = 2 + x_1 POL(b(x_1)) = 3 + x_1 POL(c(x_1)) = 2 + 3*x_1 popout

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

job log

popout

actions

all output return to SRS Stand 10685