details

property	value
status	complete
benchmark	size-12-alpha-3-num-559.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)	11.6877400875 seconds
cpu usage	43.108936454
max memory	4.322328576E9

stage attributes

key	value
output-size	4282
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 223 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(x1)) -> x1 a(c(x1)) -> c(b(c(c(x1)))) b(c(x1)) -> a(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(c(x1)) -> B(c(c(x1))) B(c(x1)) -> A(b(x1)) B(c(x1)) -> B(x1) The TRS R consists of the following rules: a(b(x1)) -> x1 a(c(x1)) -> c(b(c(c(x1)))) b(c(x1)) -> a(b(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B(c(x1)) -> A(b(x1)) The remaining pairs can at least be oriented weakly. Used ordering: Matrix interpretation [MATRO] with arctic integers [ARCTIC,STERNAGEL_THIEMANN_RTA14]: <<< POL(A(x_1)) = [[0A]] + [[-I, 0A, -I]] * x_1 >>> <<< POL(c(x_1)) = [[0A], [1A], [-I]] + [[-I, -1A, -I], [-I, 1A, -I], [-1A, 0A, 1A]] * x_1 >>> <<< POL(B(x_1)) = [[1A]] + [[-I, -1A, -I]] * x_1 >>> <<< POL(b(x_1)) = [[0A], [-I], [-I]] + [[-1A, 0A, 1A], [-I, -1A, -I], [-I, -I, -1A]] * x_1 >>> <<< POL(a(x_1)) = [[-I], [0A], [-I]] + [[1A, -1A, -I], [-I, 1A, -I], [-I, 0A, 1A]] * x_1 >>> The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: b(c(x1)) -> a(b(x1)) a(c(x1)) -> c(b(c(c(x1)))) a(b(x1)) -> x1 popout

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

job log

popout

actions

all output return to SRS Stand 10685