Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733337
details
property
value
status
complete
benchmark
Ex3_3_25_Bor03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.45649886131 seconds
cpu usage
3.431735424
max memory
2.09698816E8
stage attributes
key
value
output-size
5083
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 33 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 9 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: app(nil, YS) -> YS app(cons(X, XS), YS) -> cons(X, app(XS, YS)) from(X) -> cons(X, from(s(X))) zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS)) prefix(L) -> cons(nil, zWadr(L, prefix(L))) The replacement map contains the following entries: app: {1, 2} nil: empty set cons: {1} from: {1} s: {1} zWadr: {1, 2} prefix: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: app(nil, YS) -> YS app(cons(X, XS), YS) -> cons(X, app(XS, YS)) from(X) -> cons(X, from(s(X))) zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS)) prefix(L) -> cons(nil, zWadr(L, prefix(L))) The replacement map contains the following entries: app: {1, 2} nil: empty set cons: {1} from: {1} s: {1} zWadr: {1, 2} prefix: {1} Used ordering: Polynomial interpretation [POLO]: POL(app(x_1, x_2)) = x_1 + x_2 POL(cons(x_1, x_2)) = 1 + x_1 POL(from(x_1)) = 1 + x_1 POL(nil) = 0 POL(prefix(x_1)) = 1 + x_1 POL(s(x_1)) = x_1 POL(zWadr(x_1, x_2)) = 1 + x_1 + x_2 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS)) ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: app(nil, YS) -> YS app(cons(X, XS), YS) -> cons(X, app(XS, YS))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651