details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	5.53819799423 seconds
cpu usage	18.584156053
max memory	1.28249856E9

stage attributes

key	value
output-size	5240
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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 25 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 1 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 56 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 83 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(c(x1))) -> b(x1) c(b(b(x1))) -> a(x1) c(x1) -> b(x1) a(a(x1)) -> c(b(a(c(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: c(b(a(x1))) -> b(x1) b(b(c(x1))) -> a(x1) c(x1) -> b(x1) a(a(x1)) -> c(a(b(c(x1)))) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a(x_1)) = 3 + x_1 POL(b(x_1)) = 1 + x_1 POL(c(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: c(b(a(x1))) -> b(x1) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(c(x1))) -> a(x1) c(x1) -> b(x1) a(a(x1)) -> c(a(b(c(x1)))) Q is empty. ---------------------------------------- (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: popout

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

job log

popout

actions

all output return to SRS Standard