details

property	value
status	complete
benchmark	size-12-alpha-3-num-281.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n189.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.10829806328 seconds
cpu usage	14.007523373
max memory	1.846714368E9

stage attributes

key	value
output-size	6417
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPOrderProof [EQUIVALENT, 103 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 54 ms] (14) QDP (15) PisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> x1 a(b(x1)) -> c(b(a(a(x1)))) b(x1) -> c(x1) c(c(x1)) -> 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: A(b(x1)) -> C(b(a(a(x1)))) A(b(x1)) -> B(a(a(x1))) A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) B(x1) -> C(x1) C(c(x1)) -> B(x1) The TRS R consists of the following rules: a(x1) -> x1 a(b(x1)) -> c(b(a(a(x1)))) b(x1) -> c(x1) c(c(x1)) -> 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 2 SCCs with 2 less nodes. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: The TRS P consists of the following rules: C(c(x1)) -> B(x1) B(x1) -> C(x1) The TRS R consists of the following rules: a(x1) -> x1 a(b(x1)) -> c(b(a(a(x1)))) b(x1) -> c(x1) c(c(x1)) -> b(x1) Q is empty. popout

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

job log

popout

actions

all output return to SRS Standard