details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	13.5557951927 seconds
cpu usage	28.945749551
max memory	4.336910336E9

stage attributes

key	value
output-size	4760
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) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) TransformationProof [EQUIVALENT, 0 ms] (6) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 354 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: h(f(x, y)) -> f(y, f(h(h(x)), a)) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: h(f(x, y)) -> f(y, f(h(h(x)), a)) The set Q consists of the following terms: h(f(x0, x1)) ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: H(f(x, y)) -> H(h(x)) H(f(x, y)) -> H(x) The TRS R consists of the following rules: h(f(x, y)) -> f(y, f(h(h(x)), a)) The set Q consists of the following terms: h(f(x0, x1)) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) TransformationProof (EQUIVALENT) By narrowing [LPAR04] the rule H(f(x, y)) -> H(h(x)) at position [0] we obtained the following new rules [LPAR04]: (H(f(f(x0, x1), y1)) -> H(f(x1, f(h(h(x0)), a))),H(f(f(x0, x1), y1)) -> H(f(x1, f(h(h(x0)), a)))) ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: H(f(x, y)) -> H(x) H(f(f(x0, x1), y1)) -> H(f(x1, f(h(h(x0)), a))) The TRS R 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