details

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

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	10.3173439503 seconds
cpu usage	27.448104216
max memory	9.75036416E8

stage attributes

key	value
output-size	41275
starexec-result	"NO"

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 142 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 39 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 35 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 34 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 18 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) MRRProof [EQUIVALENT, 39 ms] (14) QDP (15) MRRProof [EQUIVALENT, 25 ms] (16) QDP (17) MRRProof [EQUIVALENT, 0 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 93 ms] (24) QDP (25) TransformationProof [EQUIVALENT, 0 ms] (26) QDP (27) MRRProof [EQUIVALENT, 29 ms] (28) QDP (29) MRRProof [EQUIVALENT, 22 ms] (30) QDP (31) MRRProof [EQUIVALENT, 0 ms] (32) QDP (33) NonTerminationLoopProof [COMPLETE, 55 ms] (34) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: pairNs -> cons(0, n__incr(n__oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS))) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), n__zip(activate(XS), activate(YS))) tail(cons(X, XS)) -> activate(XS) repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, n__cons(X, n__repItems(activate(XS)))) incr(X) -> n__incr(X) oddNs -> n__oddNs take(X1, X2) -> n__take(X1, X2) zip(X1, X2) -> n__zip(X1, X2) cons(X1, X2) -> n__cons(X1, X2) repItems(X) -> n__repItems(X) activate(n__incr(X)) -> incr(activate(X)) activate(n__oddNs) -> oddNs activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) activate(n__zip(X1, X2)) -> zip(activate(X1), activate(X2)) activate(n__cons(X1, X2)) -> cons(activate(X1), X2) activate(n__repItems(X)) -> repItems(activate(X)) activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(activate(x_1)) = x_1 POL(cons(x_1, x_2)) = x_1 + x_2 POL(incr(x_1)) = 2*x_1 POL(n__cons(x_1, x_2)) = x_1 + x_2 POL(n__incr(x_1)) = 2*x_1 POL(n__oddNs) = 0 POL(n__repItems(x_1)) = 2*x_1 POL(n__take(x_1, x_2)) = 2*x_1 + 2*x_2 POL(n__zip(x_1, x_2)) = x_1 + x_2 popout

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

job log

popout

actions

all output return to TRS Standard