Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Relat 19260 pair #381725277
details
property
value
status
complete
benchmark
zr12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Mixed_relative_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.24460792542 seconds
cpu usage
6.202942856
max memory
5.96832256E8
stage attributes
key
value
output-size
4607
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 of the given RelTRS could be proven: (0) RelTRS (1) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 52 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 0 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 13 ms] (8) RelTRS (9) RIsEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(b(x1)) -> a(x1) d(b(x1)) -> b(x1) d(c(x1)) -> c(x1) The relative TRS consists of the following S rules: a(x1) -> d(a(x1)) c(x1) -> c(b(x1)) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is a(b(x1)) -> a(x1) d(b(x1)) -> b(x1) d(c(x1)) -> c(x1) The set of rules S is a(x1) -> d(a(x1)) c(x1) -> c(b(x1)) We have obtained the following relative TRS: The set of rules R is b(a(x1)) -> a(x1) b(d(x1)) -> b(x1) c(d(x1)) -> c(x1) The set of rules S is a(x1) -> a(d(x1)) c(x1) -> b(c(x1)) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(a(x1)) -> a(x1) b(d(x1)) -> b(x1) c(d(x1)) -> c(x1) The relative TRS consists of the following S rules: a(x1) -> a(d(x1)) c(x1) -> b(c(x1)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(b(x_1)) = [[0], [0]] + [[1, 1], [0, 0]] * x_1 >>> <<< POL(a(x_1)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 >>> <<< POL(d(x_1)) = [[0], [2]] + [[1, 0], [0, 1]] * x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Relat 19260