Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733269
details
property
value
status
complete
benchmark
MYNAT_nokinds-peanoSimple.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n024.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.5436770916 seconds
cpu usage
3.667226054
max memory
2.34713088E8
stage attributes
key
value
output-size
10357
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, 59 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 2 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 3 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 0 ms] (14) CSR (15) RisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: U11(tt, N) -> N U21(tt, M, N) -> s(plus(N, M)) and(tt, X) -> X isNat(0) -> tt isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2)) isNat(s(V1)) -> isNat(V1) plus(N, 0) -> U11(isNat(N), N) plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N) The replacement map contains the following entries: U11: {1} tt: empty set U21: {1} s: {1} plus: {1, 2} and: {1} isNat: empty set 0: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: U11(tt, N) -> N U21(tt, M, N) -> s(plus(N, M)) and(tt, X) -> X isNat(0) -> tt isNat(plus(V1, V2)) -> and(isNat(V1), isNat(V2)) isNat(s(V1)) -> isNat(V1) plus(N, 0) -> U11(isNat(N), N) plus(N, s(M)) -> U21(and(isNat(M), isNat(N)), M, N) The replacement map contains the following entries: U11: {1} tt: empty set U21: {1} s: {1} plus: {1, 2} and: {1} isNat: empty set 0: empty set Used ordering: Polynomial interpretation [POLO]: POL(0) = 2 POL(U11(x_1, x_2)) = 2*x_1 + x_2 POL(U21(x_1, x_2, x_3)) = 2*x_1 + x_2 + x_3 POL(and(x_1, x_2)) = 2*x_1 + 2*x_2 POL(isNat(x_1)) = 0 POL(plus(x_1, x_2)) = x_1 + x_2 POL(s(x_1)) = x_1 POL(tt) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: plus(N, 0) -> U11(isNat(N), N)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651