details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.91191 seconds
cpu usage	4.32698
user time	4.12057
system time	0.206414
max virtual memory	1.8411988E7
max residence set size	314204.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 32 ms] (6) QDP (7) PisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(x, a), a) -> f(f(f(a, a), f(x, a)), a) 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(f(x, a), a) -> F(f(f(a, a), f(x, a)), a) F(f(x, a), a) -> F(f(a, a), f(x, a)) F(f(x, a), a) -> F(a, a) The TRS R consists of the following rules: f(f(x, a), a) -> f(f(f(a, a), f(x, a)), a) 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 2 less nodes. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: F(f(x, a), a) -> F(f(f(a, a), f(x, a)), a) The TRS R consists of the following rules: f(f(x, a), a) -> f(f(f(a, a), f(x, a)), a) 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(f(x, a), a) -> F(f(f(a, a), f(x, a)), a) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation: POL( F_2(x_1, x_2) ) = x_1 POL( f_2(x_1, x_2) ) = max{0, x_2 - 1} POL( a ) = 2 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: f(f(x, a), a) -> f(f(f(a, a), f(x, a)), a) ---------------------------------------- (6) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: f(f(x, a), a) -> f(f(f(a, a), f(x, a)), a) popout

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

job log

popout

actions

all output return to TRS Standard