Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975130
details
property
value
status
complete
benchmark
size-12-alpha-3-num-455.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
5.57920598984 seconds
cpu usage
18.978646935
max memory
1.268649984E9
stage attributes
key
value
output-size
5952
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 9 ms] (2) QDP (3) MRRProof [EQUIVALENT, 45 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 47 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 45 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> b(c(x1)) b(a(b(x1))) -> c(x1) c(c(x1)) -> a(a(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(x1) -> B(c(x1)) A(x1) -> C(x1) B(a(b(x1))) -> C(x1) C(c(x1)) -> A(a(b(x1))) C(c(x1)) -> A(b(x1)) C(c(x1)) -> B(x1) The TRS R consists of the following rules: a(x1) -> b(c(x1)) b(a(b(x1))) -> c(x1) c(c(x1)) -> a(a(b(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) MRRProof (EQUIVALENT) By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented. Strictly oriented dependency pairs: C(c(x1)) -> A(b(x1)) C(c(x1)) -> B(x1) Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = 2 + x_1 POL(B(x_1)) = 1 + x_1 POL(C(x_1)) = 2 + x_1 POL(a(x_1)) = 1 + x_1 POL(b(x_1)) = x_1 POL(c(x_1)) = 1 + x_1 ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A(x1) -> B(c(x1)) A(x1) -> C(x1) B(a(b(x1))) -> C(x1) C(c(x1)) -> A(a(b(x1)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard