details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.88018393517 seconds
cpu usage	12.148111777
max memory	1.48697088E9

stage attributes

key	value
output-size	4954
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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, 2 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 150 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 2 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> b(c(x1)) b(b(x1)) -> x1 c(c(b(x1))) -> a(a(c(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(x1) -> B(c(x1)) A(x1) -> C(x1) C(c(b(x1))) -> A(a(c(x1))) C(c(b(x1))) -> A(c(x1)) C(c(b(x1))) -> C(x1) The TRS R consists of the following rules: a(x1) -> b(c(x1)) b(b(x1)) -> x1 c(c(b(x1))) -> a(a(c(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: A(x1) -> C(x1) C(c(b(x1))) -> A(a(c(x1))) C(c(b(x1))) -> A(c(x1)) C(c(b(x1))) -> C(x1) The TRS R consists of the following rules: a(x1) -> b(c(x1)) b(b(x1)) -> x1 c(c(b(x1))) -> a(a(c(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. A(x1) -> C(x1) The remaining pairs can at least be oriented weakly. popout

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

job log

popout

actions

all output return to SRS Standard