Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Relative pair #487520976
details
property
value
status
complete
benchmark
zr09.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n184.star.cs.uiowa.edu
space
Mixed_relative_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.33342814445 seconds
cpu usage
6.037042506
max memory
5.90327808E8
stage attributes
key
value
output-size
2812
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRSRRRProof [EQUIVALENT, 71 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 9 ms] (4) RelTRS (5) RIsEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(b(x1)) -> b(a(x1)) d(c(x1)) -> d(a(x1)) The relative TRS consists of the following S rules: a(x1) -> b(c(x1)) b(c(x1)) -> a(c(x1)) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(a(x_1)) = [[0], [1]] + [[1, 1], [0, 1]] * x_1 >>> <<< POL(b(x_1)) = [[0], [1]] + [[1, 0], [0, 1]] * x_1 >>> <<< POL(d(x_1)) = [[0], [0]] + [[2, 0], [0, 0]] * x_1 >>> <<< POL(c(x_1)) = [[0], [0]] + [[1, 1], [0, 0]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: a(b(x1)) -> b(a(x1)) Rules from S: none ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: d(c(x1)) -> d(a(x1)) The relative TRS consists of the following S rules: a(x1) -> b(c(x1)) b(c(x1)) -> a(c(x1)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(d(x_1)) = [[2], [0]] + [[2, 2], [0, 0]] * x_1 >>> <<< POL(c(x_1)) = [[0], [1]] + [[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 Relative