Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962595
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.21292090416 seconds
cpu usage
5.912432128
max memory
4.82893824E8
stage attributes
key
value
output-size
5564
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRSToCSRProof [EQUIVALENT, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 59 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(and(tt, X)) -> mark(X) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(s(length(L))) active(cons(X1, X2)) -> cons(active(X1), X2) active(and(X1, X2)) -> and(active(X1), X2) active(length(X)) -> length(active(X)) active(s(X)) -> s(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) length(mark(X)) -> mark(length(X)) s(mark(X)) -> mark(s(X)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(length(X)) -> length(proper(X)) proper(nil) -> ok(nil) proper(s(X)) -> s(proper(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) length(ok(X)) -> ok(length(X)) s(ok(X)) -> ok(s(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(and(tt, X)) -> mark(X) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(s(length(L))) active(cons(X1, X2)) -> cons(active(X1), X2) active(and(X1, X2)) -> and(active(X1), X2) active(length(X)) -> length(active(X)) active(s(X)) -> s(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) length(mark(X)) -> mark(length(X)) s(mark(X)) -> mark(s(X)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(length(X)) -> length(proper(X)) proper(nil) -> ok(nil) proper(s(X)) -> s(proper(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) length(ok(X)) -> ok(length(X)) s(ok(X)) -> ok(s(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: zeros: empty set cons: {1} 0: empty set and: {1}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard