details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.48255991936 seconds
cpu usage	22.40741856
max memory	3.4919424E9

stage attributes

key	value
output-size	4769
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 15 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 39 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(a(c(b(x1)))) b(b(x1)) -> a(a(x1)) c(a(x1)) -> 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(a(x1)) -> B(a(c(b(x1)))) A(a(x1)) -> A(c(b(x1))) A(a(x1)) -> C(b(x1)) A(a(x1)) -> B(x1) B(b(x1)) -> A(a(x1)) B(b(x1)) -> A(x1) The TRS R consists of the following rules: a(a(x1)) -> b(a(c(b(x1)))) b(b(x1)) -> a(a(x1)) c(a(x1)) -> 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: B(b(x1)) -> A(a(x1)) A(a(x1)) -> B(a(c(b(x1)))) B(b(x1)) -> A(x1) A(a(x1)) -> A(c(b(x1))) A(a(x1)) -> B(x1) The TRS R consists of the following rules: a(a(x1)) -> b(a(c(b(x1)))) b(b(x1)) -> a(a(x1)) c(a(x1)) -> 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]. The following pairs can be oriented strictly and are deleted. B(b(x1)) -> A(x1) A(a(x1)) -> A(c(b(x1))) popout

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

job log

popout

actions

all output return to SRS Stand 10685