Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487071408
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n175.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.0885 seconds
cpu usage
3.88382
user time
3.68922
system time
0.1946
max virtual memory
1.840914E7
max residence set size
243968.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) QTRSToCSRProof [EQUIVALENT, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 64 ms] (4) CSR (5) ContextSensitiveLoopProof [COMPLETE, 0 ms] (6) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(zeros) -> mark(cons(0, zeros)) active(U11(tt, L)) -> mark(U12(tt, L)) active(U12(tt, L)) -> mark(s(length(L))) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(U11(tt, L)) active(cons(X1, X2)) -> cons(active(X1), X2) active(U11(X1, X2)) -> U11(active(X1), X2) active(U12(X1, X2)) -> U12(active(X1), X2) active(s(X)) -> s(active(X)) active(length(X)) -> length(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) U11(mark(X1), X2) -> mark(U11(X1, X2)) U12(mark(X1), X2) -> mark(U12(X1, X2)) s(mark(X)) -> mark(s(X)) length(mark(X)) -> mark(length(X)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(U12(X1, X2)) -> U12(proper(X1), proper(X2)) proper(s(X)) -> s(proper(X)) proper(length(X)) -> length(proper(X)) proper(nil) -> ok(nil) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) U12(ok(X1), ok(X2)) -> ok(U12(X1, X2)) s(ok(X)) -> ok(s(X)) length(ok(X)) -> ok(length(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Q is empty. ---------------------------------------- (1) QTRSToCSRProof (EQUIVALENT) The following Q TRS is given: Q restricted rewrite system: The TRS R consists of the following rules: active(zeros) -> mark(cons(0, zeros)) active(U11(tt, L)) -> mark(U12(tt, L)) active(U12(tt, L)) -> mark(s(length(L))) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(U11(tt, L)) active(cons(X1, X2)) -> cons(active(X1), X2) active(U11(X1, X2)) -> U11(active(X1), X2) active(U12(X1, X2)) -> U12(active(X1), X2) active(s(X)) -> s(active(X)) active(length(X)) -> length(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) U11(mark(X1), X2) -> mark(U11(X1, X2)) U12(mark(X1), X2) -> mark(U12(X1, X2)) s(mark(X)) -> mark(s(X)) length(mark(X)) -> mark(length(X)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(U12(X1, X2)) -> U12(proper(X1), proper(X2)) proper(s(X)) -> s(proper(X)) proper(length(X)) -> length(proper(X)) proper(nil) -> ok(nil) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) U12(ok(X1), ok(X2)) -> ok(U12(X1, X2)) s(ok(X)) -> ok(s(X)) length(ok(X)) -> ok(length(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Q is empty. Special symbols used for the transformation (see [GM04]): top: top_1, active: active_1, mark: mark_1, ok: ok_1, proper: proper_1 The replacement map contains the following entries:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard