Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487091122
details
property
value
status
complete
benchmark
z015.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n150.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.81117 seconds
cpu usage
7.67251
user time
7.25553
system time
0.416976
max virtual memory
2.007346E7
max residence set size
913660.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) DependencyPairsProof [EQUIVALENT, 4 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 46 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(x1)) -> b(a(a(a(x1)))) b(a(x1)) -> a(a(x1)) a(a(x1)) -> a(c(b(x1))) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: A(b(x1)) -> B(a(a(a(x1)))) A(b(x1)) -> A(a(a(x1))) A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) B(a(x1)) -> A(a(x1)) A(a(x1)) -> A(c(b(x1))) A(a(x1)) -> B(x1) The TRS R consists of the following rules: a(b(x1)) -> b(a(a(a(x1)))) b(a(x1)) -> a(a(x1)) a(a(x1)) -> a(c(b(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: B(a(x1)) -> A(a(x1)) A(b(x1)) -> B(a(a(a(x1)))) A(b(x1)) -> A(a(a(x1))) A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) A(a(x1)) -> B(x1) The TRS R consists of the following rules: a(b(x1)) -> b(a(a(a(x1)))) b(a(x1)) -> a(a(x1)) a(a(x1)) -> a(c(b(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]. The following pairs can be oriented strictly and are deleted. A(b(x1)) -> B(a(a(a(x1)))) A(b(x1)) -> A(a(a(x1))) A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation: POL( A_1(x_1) ) = x_1 + 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard