details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.7113 seconds
cpu usage	3.24148
user time	3.10051
system time	0.140965
max virtual memory	1.8275312E7
max residence set size	214116.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 of the given GTRS could be disproven: (0) GTRS (1) CritRuleProof [COMPLETE, 0 ms] (2) NO ---------------------------------------- (0) Obligation: Generalized rewrite system (where rules with free variables on rhs are allowed): The TRS R consists of the following rules: tail(cons(X)) -> XS pairNs -> cons(0) oddNs -> incr(pairNs) incr(cons(X)) -> cons(s(X)) take(0, XS) -> nil take(s(N), cons(X)) -> cons(X) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X), cons(Y)) -> cons(pair(X, Y)) repItems(nil) -> nil repItems(cons(X)) -> cons(X) ---------------------------------------- (1) CritRuleProof (COMPLETE) The rule tail(cons(X)) -> XS contains free variables in its right-hand side. Hence the TRS is not-terminating. ---------------------------------------- (2) NO popout

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

job log

popout

actions

all output return to TRS Standard