details

property	value
status	complete
benchmark	uni-5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n169.star.cs.uiowa.edu
space	Waldmann_06_SRS

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	5.68540287018 seconds
cpu usage	19.279275236
max memory	1.3612032E9

stage attributes

key	value
output-size	5530
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) DependencyPairsProof [EQUIVALENT, 27 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 3 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 211 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 44 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> x1 b(b(x1)) -> c(c(c(c(x1)))) c(c(x1)) -> a(c(b(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: B(b(x1)) -> C(c(c(c(x1)))) B(b(x1)) -> C(c(c(x1))) B(b(x1)) -> C(c(x1)) B(b(x1)) -> C(x1) C(c(x1)) -> A(c(b(x1))) C(c(x1)) -> C(b(x1)) C(c(x1)) -> B(x1) The TRS R consists of the following rules: a(a(x1)) -> x1 b(b(x1)) -> c(c(c(c(x1)))) c(c(x1)) -> a(c(b(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: C(c(x1)) -> C(b(x1)) C(c(x1)) -> B(x1) B(b(x1)) -> C(c(c(c(x1)))) B(b(x1)) -> C(c(c(x1))) B(b(x1)) -> C(c(x1)) B(b(x1)) -> C(x1) The TRS R consists of the following rules: a(a(x1)) -> x1 b(b(x1)) -> c(c(c(c(x1)))) c(c(x1)) -> a(c(b(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. popout

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

job log

popout

actions

all output return to SRS Standard