Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Relative pair #487521111
details
property
value
status
complete
benchmark
r6.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
Waldmann_06_relative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.5922999382 seconds
cpu usage
11.108901454
max memory
1.104826368E9
stage attributes
key
value
output-size
2684
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRSRRRProof [EQUIVALENT, 119 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 6 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: b(b(x1)) -> c(b(c(x1))) c(c(c(x1))) -> a(x1) The relative TRS consists of the following S rules: a(x1) -> a(c(b(x1))) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^3, +, *, >=, >) : <<< POL(b(x_1)) = [[0], [0], [2]] + [[1, 0, 1], [0, 0, 2], [0, 1, 2]] * x_1 >>> <<< POL(c(x_1)) = [[0], [0], [0]] + [[1, 1, 0], [0, 1, 2], [0, 0, 0]] * x_1 >>> <<< POL(a(x_1)) = [[0], [0], [0]] + [[1, 0, 3], [0, 0, 0], [0, 0, 0]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: b(b(x1)) -> c(b(c(x1))) Rules from S: none ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: c(c(c(x1))) -> a(x1) The relative TRS consists of the following S rules: a(x1) -> a(c(b(x1))) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(c(x_1)) = [[0], [1]] + [[1, 2], [2, 1]] * x_1 >>> <<< POL(a(x_1)) = [[0], [2]] + [[2, 0], [0, 0]] * x_1 >>> <<< POL(b(x_1)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Relative