Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487091818
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
n143.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.22985 seconds
cpu usage
9.51913
user time
8.98599
system time
0.533142
max virtual memory
1.9543684E7
max residence set size
1434704.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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 2 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) 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) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) 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. ---------------------------------------- (3) 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. ---------------------------------------- (4) 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. ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (6) 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. ---------------------------------------- (7) DependencyGraphProof (EQUIVALENT)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard