Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381720320
details
property
value
status
complete
benchmark
z024.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.4824821949 seconds
cpu usage
10.88924481
max memory
1.463783424E9
stage attributes
key
value
output-size
4095
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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) RootLabelingProof [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 1 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(x1))) -> a(a(b(b(a(a(x1)))))) b(a(a(b(x1)))) -> b(a(b(x1))) Q is empty. ---------------------------------------- (1) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{b_1}(b_{a_1}(a_{a_1}(x1))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1)))))) a_{b_1}(b_{a_1}(a_{b_1}(x1))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1)))))) b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{a_1}(x1))) b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(x1))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A_{B_1}(b_{a_1}(a_{a_1}(x1))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1))))) A_{B_1}(b_{a_1}(a_{a_1}(x1))) -> B_{A_1}(a_{a_1}(a_{a_1}(x1))) A_{B_1}(b_{a_1}(a_{b_1}(x1))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1))))) A_{B_1}(b_{a_1}(a_{b_1}(x1))) -> B_{A_1}(a_{a_1}(a_{b_1}(x1))) B_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{a_1}(x1))) B_{A_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(x1))) The TRS R consists of the following rules: a_{b_1}(b_{a_1}(a_{a_1}(x1))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{a_1}(x1)))))) a_{b_1}(b_{a_1}(a_{b_1}(x1))) -> a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(x1)))))) b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{a_1}(x1))) b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 5 less nodes. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: B_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{a_1}(x1))) The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685