details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.06783485413 seconds
cpu usage	8.575472599
max memory	9.88172288E8

stage attributes

key	value
output-size	4319
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: 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, 11 ms] (4) QTRS (5) Overlay + Local Confluence [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 10 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QReductionProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(b(x1))) b(x1) -> c(c(d(x1))) c(x1) -> d(d(d(x1))) b(c(x1)) -> c(b(x1)) b(c(d(x1))) -> 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))) b(x1) -> d(c(c(x1))) c(x1) -> d(d(d(x1))) c(b(x1)) -> b(c(x1)) d(c(b(x1))) -> a(x1) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a(x_1)) = 47 + x_1 POL(b(x_1)) = 31 + x_1 POL(c(x_1)) = 13 + x_1 POL(d(x_1)) = 4 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a(a(x1)) -> b(b(b(x1))) b(x1) -> d(c(c(x1))) c(x1) -> d(d(d(x1))) d(c(b(x1))) -> a(x1) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c(b(x1)) -> b(c(x1)) Q is empty. ---------------------------------------- (5) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Standard