details

property	value
status	complete
benchmark	6.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n073.star.cs.uiowa.edu
space	Secret_06_TRS

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.8325529099 seconds
cpu usage	18.415946085
max memory	6.04176384E8

stage attributes

key	value
output-size	15269
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) TransformationProof [EQUIVALENT, 0 ms] (4) QDP (5) TransformationProof [EQUIVALENT, 0 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 24 ms] (14) QDP (15) TransformationProof [EQUIVALENT, 0 ms] (16) QDP (17) TransformationProof [EQUIVALENT, 0 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) QDP (21) QDPOrderProof [EQUIVALENT, 46 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 0 ms] (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 14 ms] (28) QDP (29) DependencyGraphProof [EQUIVALENT, 0 ms] (30) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(x, y) -> c(a(c(y), a(0, x))) a(y, x) -> y a(y, c(b(a(0, x), 0))) -> b(a(c(b(0, y)), x), 0) 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(x, y) -> A(c(y), a(0, x)) B(x, y) -> A(0, x) A(y, c(b(a(0, x), 0))) -> B(a(c(b(0, y)), x), 0) A(y, c(b(a(0, x), 0))) -> A(c(b(0, y)), x) A(y, c(b(a(0, x), 0))) -> B(0, y) The TRS R consists of the following rules: b(x, y) -> c(a(c(y), a(0, x))) a(y, x) -> y a(y, c(b(a(0, x), 0))) -> b(a(c(b(0, y)), x), 0) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) TransformationProof (EQUIVALENT) By instantiating [LPAR04] the rule B(x, y) -> A(c(y), a(0, x)) we obtained the following new rules [LPAR04]: (B(y_3, 0) -> A(c(0), a(0, y_3)),B(y_3, 0) -> A(c(0), a(0, y_3))) (B(0, y_0) -> A(c(y_0), a(0, 0)),B(0, y_0) -> A(c(y_0), a(0, 0))) ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: popout

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

job log

popout

actions

all output return to TRS Stand 20472