Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733346
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nokinds.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n023.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.1591258049 seconds
cpu usage
5.371851316
max memory
3.74996992E8
stage attributes
key
value
output-size
24274
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, 55 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 26 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 13 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRInnermostProof [EQUIVALENT, 0 ms] (10) CSR (11) CSDependencyPairsProof [EQUIVALENT, 0 ms] (12) QCSDP (13) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (14) AND (15) QCSDP (16) QCSDPSubtermProof [EQUIVALENT, 0 ms] (17) QCSDP (18) PIsEmptyProof [EQUIVALENT, 0 ms] (19) YES (20) QCSDP (21) QCSUsableRulesProof [EQUIVALENT, 0 ms] (22) QCSDP (23) QCSDPMuMonotonicPoloProof [EQUIVALENT, 5 ms] (24) QCSDP (25) PIsEmptyProof [EQUIVALENT, 0 ms] (26) YES (27) QCSDP (28) QCSDPReductionPairProof [EQUIVALENT, 20 ms] (29) QCSDP (30) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (31) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) U11(tt, L) -> s(length(L)) and(tt, X) -> X isNat(0) -> tt isNat(length(V1)) -> isNatList(V1) isNat(s(V1)) -> isNat(V1) isNatIList(V) -> isNatList(V) isNatIList(zeros) -> tt isNatIList(cons(V1, V2)) -> and(isNat(V1), isNatIList(V2)) isNatList(nil) -> tt isNatList(cons(V1, V2)) -> and(isNat(V1), isNatList(V2)) length(nil) -> 0 length(cons(N, L)) -> U11(and(isNatList(L), isNat(N)), L) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set U11: {1} tt: empty set s: {1} length: {1} and: {1} isNat: empty set isNatList: empty set isNatIList: empty set nil: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) U11(tt, L) -> s(length(L)) and(tt, X) -> X isNat(0) -> tt isNat(length(V1)) -> isNatList(V1) isNat(s(V1)) -> isNat(V1) isNatIList(V) -> isNatList(V) isNatIList(zeros) -> tt isNatIList(cons(V1, V2)) -> and(isNat(V1), isNatIList(V2)) isNatList(nil) -> tt isNatList(cons(V1, V2)) -> and(isNat(V1), isNatList(V2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651