details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	3.59458994865 seconds
cpu usage	11.020037546
max memory	1.212309504E9

stage attributes

key	value
output-size	3761
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 59 ms] (2) QTRS (3) Overlay + Local Confluence [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QReductionProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(c(x1)) -> c(b(x1)) c(b(x1)) -> a(a(a(x1))) a(a(a(a(x1)))) -> b(c(x1)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a(x_1)) = 2 + x_1 POL(b(x_1)) = x_1 POL(c(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: c(b(x1)) -> a(a(a(x1))) a(a(a(a(x1)))) -> b(c(x1)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(c(x1)) -> c(b(x1)) Q is empty. ---------------------------------------- (3) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(c(x1)) -> c(b(x1)) The set Q consists of the following terms: b(c(x0)) ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: B(c(x1)) -> B(x1) popout

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

job log

popout

actions

all output return to SRS Standard