details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.61262202263 seconds
cpu usage	3.663900858
max memory	2.29793792E8

stage attributes

key	value
output-size	2064
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) QTRSRRRProof [EQUIVALENT, 63 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(c(X, s(Y))) -> f(c(s(X), Y)) g(c(s(X), Y)) -> f(c(X, s(Y))) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(c(x_1, x_2)) = x_1 + 2*x_2 POL(f(x_1)) = 2*x_1 POL(g(x_1)) = 2 + 2*x_1 POL(s(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: g(c(s(X), Y)) -> f(c(X, s(Y))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(c(X, s(Y))) -> f(c(s(X), Y)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(c(x_1, x_2)) = x_1 + 2*x_2 POL(f(x_1)) = 2*x_1 POL(s(x_1)) = 2 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f(c(X, s(Y))) -> f(c(s(X), Y)) ---------------------------------------- (4) Obligation: Q restricted rewrite system: R is empty. Q is empty. ---------------------------------------- (5) RisEmptyProof (EQUIVALENT) The TRS R is empty. Hence, termination is trivially proven. ---------------------------------------- (6) YES popout

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

job log

popout

actions

all output return to TRS Stand 20472