Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714968
details
property
value
status
complete
benchmark
Ex1_Luc04b_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.75330495834 seconds
cpu usage
3.959818868
max memory
2.45948416E8
stage attributes
key
value
output-size
11562
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, 50 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 17 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 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: Q restricted rewrite system: The TRS R consists of the following rules: active(nats) -> mark(cons(0, incr(nats))) active(pairs) -> mark(cons(0, incr(odds))) active(odds) -> mark(incr(pairs)) active(incr(cons(X, XS))) -> mark(cons(s(X), incr(XS))) active(head(cons(X, XS))) -> mark(X) active(tail(cons(X, XS))) -> mark(XS) active(cons(X1, X2)) -> cons(active(X1), X2) active(incr(X)) -> incr(active(X)) active(s(X)) -> s(active(X)) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) incr(mark(X)) -> mark(incr(X)) s(mark(X)) -> mark(s(X)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) proper(nats) -> ok(nats) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(incr(X)) -> incr(proper(X)) proper(pairs) -> ok(pairs) proper(odds) -> ok(odds) proper(s(X)) -> s(proper(X)) proper(head(X)) -> head(proper(X)) proper(tail(X)) -> tail(proper(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) incr(ok(X)) -> ok(incr(X)) s(ok(X)) -> ok(s(X)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) 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(nats) -> mark(cons(0, incr(nats))) active(pairs) -> mark(cons(0, incr(odds))) active(odds) -> mark(incr(pairs)) active(incr(cons(X, XS))) -> mark(cons(s(X), incr(XS))) active(head(cons(X, XS))) -> mark(X) active(tail(cons(X, XS))) -> mark(XS) active(cons(X1, X2)) -> cons(active(X1), X2) active(incr(X)) -> incr(active(X)) active(s(X)) -> s(active(X)) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) incr(mark(X)) -> mark(incr(X)) s(mark(X)) -> mark(s(X)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) proper(nats) -> ok(nats) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(incr(X)) -> incr(proper(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472