details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.27443909645 seconds
cpu usage	5.492369175
max memory	3.54521088E8

stage attributes

key	value
output-size	5832
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) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 13 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 43 ms] (12) QDP (13) PisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, f(a, y)) -> f(a, f(f(f(a, x), h(a)), y)) 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: F(x, f(a, y)) -> F(a, f(f(f(a, x), h(a)), y)) F(x, f(a, y)) -> F(f(f(a, x), h(a)), y) F(x, f(a, y)) -> F(f(a, x), h(a)) F(x, f(a, y)) -> F(a, x) The TRS R consists of the following rules: f(x, f(a, y)) -> f(a, f(f(f(a, x), h(a)), y)) 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: F(x, f(a, y)) -> F(f(f(a, x), h(a)), y) F(x, f(a, y)) -> F(a, f(f(f(a, x), h(a)), y)) F(x, f(a, y)) -> F(a, x) The TRS R consists of the following rules: f(x, f(a, y)) -> f(a, f(f(f(a, x), h(a)), y)) 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. F(x, f(a, y)) -> F(a, x) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(F(x_1, x_2)) = x_1 + x_2 POL(a) = 0 POL(f(x_1, x_2)) = 1 + x_2 POL(h(x_1)) = 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472