Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Relat 19260 pair #381725229
details
property
value
status
complete
benchmark
r3.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
Waldmann_06_relative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.50215482712 seconds
cpu usage
31.017303851
max memory
3.71841024E9
stage attributes
key
value
output-size
6249
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) FlatCCProof [EQUIVALENT, 0 ms] (2) RelTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 268 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 0 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 0 ms] (10) RelTRS (11) RIsEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(a(x1)) -> x1 The relative TRS consists of the following S rules: a(a(x1)) -> b(a(a(a(b(x1))))) ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(a(a(x1))) -> a(x1) b(a(a(x1))) -> b(x1) The relative TRS consists of the following S rules: a(a(a(x1))) -> a(b(a(a(a(b(x1)))))) b(a(a(x1))) -> b(b(a(a(a(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}(a_{a_1}(x1))) -> a_{a_1}(x1) a_{a_1}(a_{a_1}(a_{b_1}(x1))) -> a_{b_1}(x1) b_{a_1}(a_{a_1}(a_{a_1}(x1))) -> b_{a_1}(x1) b_{a_1}(a_{a_1}(a_{b_1}(x1))) -> b_{b_1}(x1) The relative TRS consists of the following S rules: a_{a_1}(a_{a_1}(a_{a_1}(x1))) -> a_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))))) a_{a_1}(a_{a_1}(a_{b_1}(x1))) -> a_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))))) b_{a_1}(a_{a_1}(a_{a_1}(x1))) -> b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))))) b_{a_1}(a_{a_1}(a_{b_1}(x1))) -> b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))))) ---------------------------------------- (5) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^3, +, *, >=, >) : <<< POL(a_{a_1}(x_1)) = [[0], [0], [1]] + [[1, 1, 0], [0, 0, 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