details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.77285 seconds
cpu usage	3.49149
user time	3.33479
system time	0.156702
max virtual memory	1.8343148E7
max residence set size	234516.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/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) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(X, g(X)) -> f(1, g(X)) g(1) -> g(0) The set Q consists of the following terms: f(x0, g(x0)) g(1) ---------------------------------------- (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, g(X)) -> F(1, g(X)) G(1) -> G(0) The TRS R consists of the following rules: f(X, g(X)) -> f(1, g(X)) g(1) -> g(0) The set Q consists of the following terms: f(x0, g(x0)) g(1) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 2 less nodes. ---------------------------------------- (4) TRUE popout

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

job log

popout

actions

all output return to TRS Innermost