Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516963500
details
property
value
status
complete
benchmark
PEANO_nosorts_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.28324103355 seconds
cpu usage
5.977370373
max memory
4.78654464E8
stage attributes
key
value
output-size
7237
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [EQUIVALENT, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 52 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(U11(tt, M, N)) -> mark(U12(tt, M, N)) active(U12(tt, M, N)) -> mark(s(plus(N, M))) active(plus(N, 0)) -> mark(N) active(plus(N, s(M))) -> mark(U11(tt, M, N)) active(U11(X1, X2, X3)) -> U11(active(X1), X2, X3) active(U12(X1, X2, X3)) -> U12(active(X1), X2, X3) active(s(X)) -> s(active(X)) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) U11(mark(X1), X2, X3) -> mark(U11(X1, X2, X3)) U12(mark(X1), X2, X3) -> mark(U12(X1, X2, X3)) s(mark(X)) -> mark(s(X)) plus(mark(X1), X2) -> mark(plus(X1, X2)) plus(X1, mark(X2)) -> mark(plus(X1, X2)) proper(U11(X1, X2, X3)) -> U11(proper(X1), proper(X2), proper(X3)) proper(tt) -> ok(tt) proper(U12(X1, X2, X3)) -> U12(proper(X1), proper(X2), proper(X3)) proper(s(X)) -> s(proper(X)) proper(plus(X1, X2)) -> plus(proper(X1), proper(X2)) proper(0) -> ok(0) U11(ok(X1), ok(X2), ok(X3)) -> ok(U11(X1, X2, X3)) U12(ok(X1), ok(X2), ok(X3)) -> ok(U12(X1, X2, X3)) s(ok(X)) -> ok(s(X)) plus(ok(X1), ok(X2)) -> ok(plus(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Q is empty. ---------------------------------------- (1) QTRSToCSRProof (EQUIVALENT) The following Q TRS is given: Q restricted rewrite system: The TRS R consists of the following rules: active(U11(tt, M, N)) -> mark(U12(tt, M, N)) active(U12(tt, M, N)) -> mark(s(plus(N, M))) active(plus(N, 0)) -> mark(N) active(plus(N, s(M))) -> mark(U11(tt, M, N)) active(U11(X1, X2, X3)) -> U11(active(X1), X2, X3) active(U12(X1, X2, X3)) -> U12(active(X1), X2, X3) active(s(X)) -> s(active(X)) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) U11(mark(X1), X2, X3) -> mark(U11(X1, X2, X3)) U12(mark(X1), X2, X3) -> mark(U12(X1, X2, X3)) s(mark(X)) -> mark(s(X)) plus(mark(X1), X2) -> mark(plus(X1, X2)) plus(X1, mark(X2)) -> mark(plus(X1, X2)) proper(U11(X1, X2, X3)) -> U11(proper(X1), proper(X2), proper(X3)) proper(tt) -> ok(tt) proper(U12(X1, X2, X3)) -> U12(proper(X1), proper(X2), proper(X3)) proper(s(X)) -> s(proper(X)) proper(plus(X1, X2)) -> plus(proper(X1), proper(X2)) proper(0) -> ok(0) U11(ok(X1), ok(X2), ok(X3)) -> ok(U11(X1, X2, X3)) U12(ok(X1), ok(X2), ok(X3)) -> ok(U12(X1, X2, X3)) s(ok(X)) -> ok(s(X)) plus(ok(X1), ok(X2)) -> ok(plus(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Q is empty. Special symbols used for the transformation (see [GM04]): top: top_1, active: active_1, mark: mark_1, ok: ok_1, proper: proper_1 The replacement map contains the following entries:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard