Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Relative pair #487521016
details
property
value
status
complete
benchmark
dup04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
Mixed_relative_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
60.8940830231 seconds
cpu usage
238.253985512
max memory
1.116520448E10
stage attributes
key
value
output-size
6854
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) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 636 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 394 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(a(b(b(a(a(x1)))))) -> a(a(b(b(b(b(a(a(x1)))))))) b(b(a(a(b(b(x1)))))) -> b(b(a(a(a(a(b(b(x1)))))))) The relative TRS consists of the following S rules: a(a(x1)) -> a(a(a(a(a(a(x1)))))) b(b(x1)) -> b(b(b(b(b(b(x1)))))) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is a(a(b(b(a(a(x1)))))) -> a(a(b(b(b(b(a(a(x1)))))))) b(b(a(a(b(b(x1)))))) -> b(b(a(a(a(a(b(b(x1)))))))) The set of rules S is a(a(x1)) -> a(a(a(a(a(a(x1)))))) b(b(x1)) -> b(b(b(b(b(b(x1)))))) We have obtained the following relative TRS: The set of rules R is a(a(b(b(a(a(x1)))))) -> a(a(b(b(b(b(a(a(x1)))))))) b(b(a(a(b(b(x1)))))) -> b(b(a(a(a(a(b(b(x1)))))))) The set of rules S is a(a(x1)) -> a(a(a(a(a(a(x1)))))) b(b(x1)) -> b(b(b(b(b(b(x1)))))) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(a(b(b(a(a(x1)))))) -> a(a(b(b(b(b(a(a(x1)))))))) b(b(a(a(b(b(x1)))))) -> b(b(a(a(a(a(b(b(x1)))))))) The relative TRS consists of the following S rules: a(a(x1)) -> a(a(a(a(a(a(x1)))))) b(b(x1)) -> b(b(b(b(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_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1)))))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1)))))))) a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1)))))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1)))))))) b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))))) -> b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))))))) b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))))) -> b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))))))) The relative TRS consists of the following S rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Relative