details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.9777 seconds
cpu usage	16.8476
user time	16.2399
system time	0.6077
max virtual memory	3.6715072E7
max residence set size	987568.0

stage attributes

key	value
starexec-result	NO

output

NO 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 disproven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 14 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) TransformationProof [EQUIVALENT, 0 ms] (12) QDP (13) TransformationProof [EQUIVALENT, 0 ms] (14) QDP (15) MNOCProof [EQUIVALENT, 0 ms] (16) QDP (17) NonTerminationLoopProof [COMPLETE, 0 ms] (18) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: ap(ap(f, x), x) -> ap(ap(x, ap(f, x)), ap(ap(cons, x), nil)) ap(ap(ap(foldr, g), h), nil) -> h ap(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> ap(ap(g, x), ap(ap(ap(foldr, g), h), xs)) 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: ap(ap(f, x), x) -> ap(ap(x, ap(f, x)), ap(ap(cons, x), nil)) ap(ap(ap(foldr, g), h), nil) -> h ap(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> ap(ap(g, x), ap(ap(ap(foldr, g), h), xs)) The set Q consists of the following terms: ap(ap(f, x0), x0) ap(ap(ap(foldr, x0), x1), nil) ap(ap(ap(foldr, x0), x1), ap(ap(cons, x2), x3)) ---------------------------------------- (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: AP(ap(f, x), x) -> AP(ap(x, ap(f, x)), ap(ap(cons, x), nil)) AP(ap(f, x), x) -> AP(x, ap(f, x)) AP(ap(f, x), x) -> AP(ap(cons, x), nil) AP(ap(f, x), x) -> AP(cons, x) AP(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> AP(ap(g, x), ap(ap(ap(foldr, g), h), xs)) AP(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> AP(g, x) AP(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> AP(ap(ap(foldr, g), h), xs) The TRS R consists of the following rules: ap(ap(f, x), x) -> ap(ap(x, ap(f, x)), ap(ap(cons, x), nil)) ap(ap(ap(foldr, g), h), nil) -> h ap(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> ap(ap(g, x), ap(ap(ap(foldr, g), h), xs)) The set Q consists of the following terms: ap(ap(f, x0), x0) ap(ap(ap(foldr, x0), x1), nil) ap(ap(ap(foldr, x0), x1), ap(ap(cons, x2), x3)) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes. ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Standard