Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715327
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nokinds_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n071.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.31746196747 seconds
cpu usage
6.013472814
max memory
4.43990016E8
stage attributes
key
value
output-size
27738
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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [EQUIVALENT, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 61 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 10 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) CSRInnermostProof [EQUIVALENT, 0 ms] (12) CSR (13) CSDependencyPairsProof [EQUIVALENT, 0 ms] (14) QCSDP (15) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (16) AND (17) QCSDP (18) QCSDPSubtermProof [EQUIVALENT, 9 ms] (19) QCSDP (20) PIsEmptyProof [EQUIVALENT, 0 ms] (21) YES (22) QCSDP (23) QCSUsableRulesProof [EQUIVALENT, 0 ms] (24) QCSDP (25) QCSDPMuMonotonicPoloProof [EQUIVALENT, 8 ms] (26) QCSDP (27) PIsEmptyProof [EQUIVALENT, 0 ms] (28) YES (29) QCSDP (30) QCSDPReductionPairProof [EQUIVALENT, 19 ms] (31) QCSDP (32) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (33) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(zeros) -> mark(cons(0, zeros)) active(U11(tt, L)) -> mark(s(length(L))) active(and(tt, X)) -> mark(X) active(isNat(0)) -> mark(tt) active(isNat(length(V1))) -> mark(isNatList(V1)) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNatIList(V)) -> mark(isNatList(V)) active(isNatIList(zeros)) -> mark(tt) active(isNatIList(cons(V1, V2))) -> mark(and(isNat(V1), isNatIList(V2))) active(isNatList(nil)) -> mark(tt) active(isNatList(cons(V1, V2))) -> mark(and(isNat(V1), isNatList(V2))) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(U11(and(isNatList(L), isNat(N)), L)) active(cons(X1, X2)) -> cons(active(X1), X2) active(U11(X1, X2)) -> U11(active(X1), X2) active(s(X)) -> s(active(X)) active(length(X)) -> length(active(X)) active(and(X1, X2)) -> and(active(X1), X2) cons(mark(X1), X2) -> mark(cons(X1, X2)) U11(mark(X1), X2) -> mark(U11(X1, X2)) s(mark(X)) -> mark(s(X)) length(mark(X)) -> mark(length(X)) and(mark(X1), X2) -> mark(and(X1, X2)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(s(X)) -> s(proper(X)) proper(length(X)) -> length(proper(X)) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(isNat(X)) -> isNat(proper(X)) proper(isNatList(X)) -> isNatList(proper(X)) proper(isNatIList(X)) -> isNatIList(proper(X)) proper(nil) -> ok(nil) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) s(ok(X)) -> ok(s(X)) length(ok(X)) -> ok(length(X)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) isNat(ok(X)) -> ok(isNat(X)) isNatList(ok(X)) -> ok(isNatList(X)) isNatIList(ok(X)) -> ok(isNatIList(X)) top(mark(X)) -> top(proper(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472