Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710317
details
property
value
status
complete
benchmark
selsort.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n003.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.16463899612 seconds
cpu usage
5.533639901
max memory
4.05262336E8
stage attributes
key
value
output-size
34053
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) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 26 ms] (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) TRUE (23) QDP (24) UsableRulesProof [EQUIVALENT, 0 ms] (25) QDP (26) QReductionProof [EQUIVALENT, 0 ms] (27) QDP (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] (29) YES (30) QDP (31) UsableRulesProof [EQUIVALENT, 0 ms] (32) QDP (33) QReductionProof [EQUIVALENT, 0 ms] (34) QDP (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] (36) YES (37) QDP (38) UsableRulesProof [EQUIVALENT, 0 ms] (39) QDP (40) QReductionProof [EQUIVALENT, 0 ms] (41) QDP (42) QDPOrderProof [EQUIVALENT, 22 ms] (43) QDP (44) DependencyGraphProof [EQUIVALENT, 0 ms] (45) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: eq(0, 0) -> true eq(0, s(Y)) -> false eq(s(X), 0) -> false eq(s(X), s(Y)) -> eq(X, Y) le(0, Y) -> true le(s(X), 0) -> false le(s(X), s(Y)) -> le(X, Y) min(cons(0, nil)) -> 0 min(cons(s(N), nil)) -> s(N) min(cons(N, cons(M, L))) -> ifmin(le(N, M), cons(N, cons(M, L))) ifmin(true, cons(N, cons(M, L))) -> min(cons(N, L)) ifmin(false, cons(N, cons(M, L))) -> min(cons(M, L)) replace(N, M, nil) -> nil replace(N, M, cons(K, L)) -> ifrepl(eq(N, K), N, M, cons(K, L)) ifrepl(true, N, M, cons(K, L)) -> cons(M, L) ifrepl(false, N, M, cons(K, L)) -> cons(K, replace(N, M, L)) selsort(nil) -> nil selsort(cons(N, L)) -> ifselsort(eq(N, min(cons(N, L))), cons(N, L)) ifselsort(true, cons(N, L)) -> cons(N, selsort(L)) ifselsort(false, cons(N, L)) -> cons(min(cons(N, L)), selsort(replace(min(cons(N, L)), N, L))) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472