Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Context Sensitive pair #516978731
details
property
value
status
complete
benchmark
ExIntrod_GM01.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.14069700241 seconds
cpu usage
5.514401948
max memory
4.77257728E8
stage attributes
key
value
output-size
10972
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 65 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 6 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 6 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: incr(nil) -> nil incr(cons(X, L)) -> cons(s(X), incr(L)) adx(nil) -> nil adx(cons(X, L)) -> incr(cons(X, adx(L))) nats -> adx(zeros) zeros -> cons(0, zeros) head(cons(X, L)) -> X tail(cons(X, L)) -> L The replacement map contains the following entries: incr: {1} nil: empty set cons: {1} s: {1} adx: {1} nats: empty set zeros: empty set 0: empty set head: {1} tail: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: incr(nil) -> nil incr(cons(X, L)) -> cons(s(X), incr(L)) adx(nil) -> nil adx(cons(X, L)) -> incr(cons(X, adx(L))) nats -> adx(zeros) zeros -> cons(0, zeros) head(cons(X, L)) -> X tail(cons(X, L)) -> L The replacement map contains the following entries: incr: {1} nil: empty set cons: {1} s: {1} adx: {1} nats: empty set zeros: empty set 0: empty set head: {1} tail: {1} Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(adx(x_1)) = x_1 POL(cons(x_1, x_2)) = x_1 + x_2 POL(head(x_1)) = 2*x_1 POL(incr(x_1)) = x_1 POL(nats) = 2 POL(nil) = 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Context Sensitive