Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716967
details
property
value
status
complete
benchmark
Ex9_BLR02_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.68962311745 seconds
cpu usage
10.728737277
max memory
7.64596224E8
stage attributes
key
value
output-size
50675
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) DependencyPairsProof [EQUIVALENT, 46 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) UsableRulesProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES (25) QDP (26) UsableRulesProof [EQUIVALENT, 0 ms] (27) QDP (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] (29) YES (30) QDP (31) QDPOrderProof [EQUIVALENT, 38 ms] (32) QDP (33) QDPOrderProof [EQUIVALENT, 45 ms] (34) QDP (35) DependencyGraphProof [EQUIVALENT, 0 ms] (36) QDP (37) QDPOrderProof [EQUIVALENT, 27 ms] (38) QDP (39) QDPOrderProof [EQUIVALENT, 21 ms] (40) QDP (41) QDPOrderProof [EQUIVALENT, 0 ms] (42) QDP (43) DependencyGraphProof [EQUIVALENT, 0 ms] (44) QDP (45) UsableRulesProof [EQUIVALENT, 0 ms] (46) QDP (47) QDPSizeChangeProof [EQUIVALENT, 0 ms] (48) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(filter(cons(X, Y), 0, M)) -> mark(cons(0, filter(Y, M, M))) active(filter(cons(X, Y), s(N), M)) -> mark(cons(X, filter(Y, N, M))) active(sieve(cons(0, Y))) -> mark(cons(0, sieve(Y))) active(sieve(cons(s(N), Y))) -> mark(cons(s(N), sieve(filter(Y, N, N)))) active(nats(N)) -> mark(cons(N, nats(s(N)))) active(zprimes) -> mark(sieve(nats(s(s(0))))) mark(filter(X1, X2, X3)) -> active(filter(mark(X1), mark(X2), mark(X3))) mark(cons(X1, X2)) -> active(cons(mark(X1), X2)) mark(0) -> active(0) mark(s(X)) -> active(s(mark(X))) mark(sieve(X)) -> active(sieve(mark(X))) mark(nats(X)) -> active(nats(mark(X))) mark(zprimes) -> active(zprimes) filter(mark(X1), X2, X3) -> filter(X1, X2, X3) filter(X1, mark(X2), X3) -> filter(X1, X2, X3) filter(X1, X2, mark(X3)) -> filter(X1, X2, X3) filter(active(X1), X2, X3) -> filter(X1, X2, X3) filter(X1, active(X2), X3) -> filter(X1, X2, X3) filter(X1, X2, active(X3)) -> filter(X1, X2, X3) cons(mark(X1), X2) -> cons(X1, X2) cons(X1, mark(X2)) -> cons(X1, X2) cons(active(X1), X2) -> cons(X1, X2) cons(X1, active(X2)) -> cons(X1, X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) sieve(mark(X)) -> sieve(X) sieve(active(X)) -> sieve(X) nats(mark(X)) -> nats(X) nats(active(X)) -> nats(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472