Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Context Sensitive pair #487523803
details
property
value
status
complete
benchmark
Ex5_DLMMU04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.7753238678 seconds
cpu usage
4.227448733
max memory
2.49204736E8
stage attributes
key
value
output-size
14145
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 78 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 15 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 6 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 9 ms] (14) CSR (15) CSRRRRProof [EQUIVALENT, 0 ms] (16) CSR (17) RisEmptyProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: pairNs -> cons(0, incr(oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), incr(XS)) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS)) tail(cons(X, XS)) -> XS repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) The replacement map contains the following entries: pairNs: empty set cons: {1} 0: empty set incr: {1} oddNs: empty set s: {1} take: {1, 2} nil: empty set zip: {1, 2} pair: {1, 2} tail: {1} repItems: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: pairNs -> cons(0, incr(oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), incr(XS)) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS)) tail(cons(X, XS)) -> XS repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) The replacement map contains the following entries: pairNs: empty set cons: {1} 0: empty set incr: {1} oddNs: empty set s: {1} take: {1, 2} nil: empty set zip: {1, 2} pair: {1, 2} tail: {1} repItems: {1}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Context Sensitive