details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.06397 seconds
cpu usage	8.6557
user time	8.3213
system time	0.334402
max virtual memory	5.5406572E7
max residence set size	592812.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, 40 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPQMonotonicMRRProof [EQUIVALENT, 106 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 72 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPQMonotonicMRRProof [EQUIVALENT, 35 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__app(nil, YS) -> mark(YS) a__app(cons(X, XS), YS) -> cons(mark(X), app(XS, YS)) a__from(X) -> cons(mark(X), from(s(X))) a__zWadr(nil, YS) -> nil a__zWadr(XS, nil) -> nil a__zWadr(cons(X, XS), cons(Y, YS)) -> cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS)) a__prefix(L) -> cons(nil, zWadr(L, prefix(L))) mark(app(X1, X2)) -> a__app(mark(X1), mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(zWadr(X1, X2)) -> a__zWadr(mark(X1), mark(X2)) mark(prefix(X)) -> a__prefix(mark(X)) mark(nil) -> nil mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(s(X)) -> s(mark(X)) a__app(X1, X2) -> app(X1, X2) a__from(X) -> from(X) a__zWadr(X1, X2) -> zWadr(X1, X2) a__prefix(X) -> prefix(X) The set Q consists of the following terms: a__from(x0) a__prefix(x0) mark(app(x0, x1)) mark(from(x0)) mark(zWadr(x0, x1)) mark(prefix(x0)) mark(nil) mark(cons(x0, x1)) mark(s(x0)) a__app(x0, x1) a__zWadr(x0, x1) ---------------------------------------- (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: A__APP(nil, YS) -> MARK(YS) A__APP(cons(X, XS), YS) -> MARK(X) A__FROM(X) -> MARK(X) A__ZWADR(cons(X, XS), cons(Y, YS)) -> A__APP(mark(Y), cons(mark(X), nil)) A__ZWADR(cons(X, XS), cons(Y, YS)) -> MARK(Y) A__ZWADR(cons(X, XS), cons(Y, YS)) -> MARK(X) MARK(app(X1, X2)) -> A__APP(mark(X1), mark(X2)) MARK(app(X1, X2)) -> MARK(X1) MARK(app(X1, X2)) -> MARK(X2) MARK(from(X)) -> A__FROM(mark(X)) MARK(from(X)) -> MARK(X) MARK(zWadr(X1, X2)) -> A__ZWADR(mark(X1), mark(X2)) MARK(zWadr(X1, X2)) -> MARK(X1) MARK(zWadr(X1, X2)) -> MARK(X2) MARK(prefix(X)) -> A__PREFIX(mark(X)) MARK(prefix(X)) -> MARK(X) MARK(cons(X1, X2)) -> MARK(X1) MARK(s(X)) -> MARK(X) The TRS R consists of the following rules: a__app(nil, YS) -> mark(YS) a__app(cons(X, XS), YS) -> cons(mark(X), app(XS, YS)) a__from(X) -> cons(mark(X), from(s(X))) popout

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

job log

popout

actions

all output return to TRS Innermost