Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733353
details
property
value
status
complete
benchmark
ExProp7_Luc06.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.41595196724 seconds
cpu usage
3.319669769
max memory
1.98340608E8
stage attributes
key
value
output-size
3838
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 32 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 6 ms] (6) CSR (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(0) -> cons(0, f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X The replacement map contains the following entries: f: {1} 0: empty set cons: {1} s: {1} p: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(0) -> cons(0, f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X The replacement map contains the following entries: f: {1} 0: empty set cons: {1} s: {1} p: {1} Used ordering: Polynomial interpretation [POLO]: POL(0) = 1 POL(cons(x_1, x_2)) = 1 + x_1 POL(f(x_1)) = 1 + x_1 POL(p(x_1)) = x_1 POL(s(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: p(s(X)) -> X ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(0) -> cons(0, f(s(0))) f(s(0)) -> f(p(s(0))) The replacement map contains the following entries: f: {1} 0: empty set cons: {1} s: {1} p: {1} ---------------------------------------- (3) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(0) -> cons(0, f(s(0)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651