Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Relative pair #487521051
details
property
value
status
complete
benchmark
zr03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Mixed_relative_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.77372503281 seconds
cpu usage
4.047957718
max memory
2.94170624E8
stage attributes
key
value
output-size
3042
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) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 2 ms] (6) RelTRS (7) RIsEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(a(x1)) -> a(b(a(x1))) The relative TRS consists of the following S rules: b(x1) -> b(b(x1)) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is a(a(x1)) -> a(b(a(x1))) The set of rules S is b(x1) -> b(b(x1)) We have obtained the following relative TRS: The set of rules R is a(a(x1)) -> a(b(a(x1))) The set of rules S is b(x1) -> b(b(x1)) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(a(x1)) -> a(b(a(x1))) The relative TRS consists of the following S rules: b(x1) -> b(b(x1)) ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled ---------------------------------------- (4) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a_{a_1}(a_{a_1}(x1)) -> a_{b_1}(b_{a_1}(a_{a_1}(x1))) a_{a_1}(a_{b_1}(x1)) -> a_{b_1}(b_{a_1}(a_{b_1}(x1))) The relative TRS consists of the following S rules: b_{a_1}(x1) -> b_{b_1}(b_{a_1}(x1)) b_{b_1}(x1) -> b_{b_1}(b_{b_1}(x1)) ---------------------------------------- (5) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = 1 + x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Relative