details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.02165 seconds
cpu usage	16.0318
user time	15.249
system time	0.782872
max virtual memory	3.9368548E7
max residence set size	2039916.0

stage attributes

key	value
starexec-result	YES

output

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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 21 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 12 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) MRRProof [EQUIVALENT, 35 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 88 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(b(x1))) a(x1) -> d(c(d(x1))) b(b(b(x1))) -> a(f(x1)) b(b(x1)) -> c(c(c(x1))) c(c(x1)) -> d(d(d(x1))) c(d(d(x1))) -> f(x1) f(f(x1)) -> f(a(x1)) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(b(x1))) a(x1) -> d(c(d(x1))) b(b(b(x1))) -> f(a(x1)) b(b(x1)) -> c(c(c(x1))) c(c(x1)) -> d(d(d(x1))) d(d(c(x1))) -> f(x1) f(f(x1)) -> a(f(x1)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a(x_1)) = 39 + x_1 POL(b(x_1)) = 26 + x_1 POL(c(x_1)) = 17 + x_1 POL(d(x_1)) = 11 + x_1 POL(f(x_1)) = 39 + 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))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(b(x1))) a(x1) -> d(c(d(x1))) b(b(b(x1))) -> f(a(x1)) d(d(c(x1))) -> f(x1) f(f(x1)) -> a(f(x1)) Q is empty. ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. popout

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

job log

popout

actions

all output return to SRS Standard