Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487091998
details
property
value
status
complete
benchmark
un07.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
Trafo_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.02044 seconds
cpu usage
17.2967
user time
16.473
system time
0.823691
max virtual memory
4.0327912E7
max residence set size
2179268.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 23 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 506 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(x1)) -> b(a(b(x1))) b(b(a(b(x1)))) -> b(a(b(a(a(b(b(x1))))))) b(a(b(x1))) -> b(a(a(b(x1)))) b(a(a(b(a(b(x1)))))) -> b(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: b_{b_1}(b_{b_1}(x1)) -> b_{a_1}(a_{b_1}(b_{b_1}(x1))) b_{b_1}(b_{a_1}(x1)) -> b_{a_1}(a_{b_1}(b_{a_1}(x1))) b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{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_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))))) b_{a_1}(a_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))) -> b_{b_1}(b_{b_1}(x1)) b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))) -> b_{b_1}(b_{a_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: B_{B_1}(b_{b_1}(x1)) -> B_{A_1}(a_{b_1}(b_{b_1}(x1))) B_{B_1}(b_{a_1}(x1)) -> B_{A_1}(a_{b_1}(b_{a_1}(x1))) B_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> B_{A_1}(a_{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_{b_1}(b_{b_1}(x1)))) -> B_{A_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) B_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1)) B_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> B_{A_1}(a_{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_{b_1}(b_{a_1}(x1)))) -> B_{A_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) B_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> B_{B_1}(b_{a_1}(x1)) B_{A_1}(a_{b_1}(b_{b_1}(x1))) -> B_{A_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) B_{A_1}(a_{b_1}(b_{a_1}(x1))) -> B_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) B_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))) -> B_{B_1}(b_{b_1}(x1)) B_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))) -> B_{B_1}(b_{a_1}(x1)) The TRS R consists of the following rules: b_{b_1}(b_{b_1}(x1)) -> b_{a_1}(a_{b_1}(b_{b_1}(x1))) b_{b_1}(b_{a_1}(x1)) -> b_{a_1}(a_{b_1}(b_{a_1}(x1))) b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{a_1}(a_{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_{b_1}(b_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))))) b_{a_1}(a_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))) -> b_{b_1}(b_{b_1}(x1)) b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))) -> b_{b_1}(b_{a_1}(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard