Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487071883
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
n191.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.3009 seconds
cpu usage
27.4222
user time
26.5162
system time
0.906053
max virtual memory
3.6709528E7
max residence set size
1925728.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) QTRSRRRProof [EQUIVALENT, 101 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 23 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 21 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 31 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 26 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) MRRProof [EQUIVALENT, 0 ms] (14) QDP (15) MRRProof [EQUIVALENT, 12 ms] (16) QDP (17) MRRProof [EQUIVALENT, 18 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 107 ms] (24) QDP (25) TransformationProof [EQUIVALENT, 0 ms] (26) QDP (27) MRRProof [EQUIVALENT, 18 ms] (28) QDP (29) MRRProof [EQUIVALENT, 18 ms] (30) QDP (31) MRRProof [EQUIVALENT, 0 ms] (32) QDP (33) NonTerminationLoopProof [COMPLETE, 46 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 POL(nil) = 0 POL(oddNs) = 0 POL(pair(x_1, x_2)) = x_1 + x_2 POL(pairNs) = 0 POL(repItems(x_1)) = 2*x_1 POL(s(x_1)) = 2*x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard