details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.75534701347 seconds
cpu usage	7.067673278
max memory	5.7319424E8

stage attributes

key	value
output-size	12695
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 75 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 29 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__fst(0, Z) -> nil a__fst(s(X), cons(Y, Z)) -> cons(mark(Y), fst(X, Z)) a__from(X) -> cons(mark(X), from(s(X))) a__add(0, X) -> mark(X) a__add(s(X), Y) -> s(add(X, Y)) a__len(nil) -> 0 a__len(cons(X, Z)) -> s(len(Z)) mark(fst(X1, X2)) -> a__fst(mark(X1), mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(add(X1, X2)) -> a__add(mark(X1), mark(X2)) mark(len(X)) -> a__len(mark(X)) mark(0) -> 0 mark(s(X)) -> s(X) mark(nil) -> nil mark(cons(X1, X2)) -> cons(mark(X1), X2) a__fst(X1, X2) -> fst(X1, X2) a__from(X) -> from(X) a__add(X1, X2) -> add(X1, X2) a__len(X) -> len(X) The set Q consists of the following terms: a__from(x0) mark(fst(x0, x1)) mark(from(x0)) mark(add(x0, x1)) mark(len(x0)) mark(0) mark(s(x0)) mark(nil) mark(cons(x0, x1)) a__fst(x0, x1) a__add(x0, x1) a__len(x0) ---------------------------------------- (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__FST(s(X), cons(Y, Z)) -> MARK(Y) A__FROM(X) -> MARK(X) A__ADD(0, X) -> MARK(X) MARK(fst(X1, X2)) -> A__FST(mark(X1), mark(X2)) MARK(fst(X1, X2)) -> MARK(X1) MARK(fst(X1, X2)) -> MARK(X2) MARK(from(X)) -> A__FROM(mark(X)) MARK(from(X)) -> MARK(X) MARK(add(X1, X2)) -> A__ADD(mark(X1), mark(X2)) MARK(add(X1, X2)) -> MARK(X1) MARK(add(X1, X2)) -> MARK(X2) MARK(len(X)) -> A__LEN(mark(X)) MARK(len(X)) -> MARK(X) MARK(cons(X1, X2)) -> MARK(X1) The TRS R consists of the following rules: a__fst(0, Z) -> nil popout

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

job log

popout

actions

all output return to TRS Inner 89993