Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516976078
details
property
value
status
complete
benchmark
dup15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n061.star.cs.uiowa.edu
space
Trafo_06
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
6.42875099182 seconds
cpu usage
22.128681555
max memory
1.319522304E9
stage attributes
key
value
output-size
8278
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 14 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 44 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 17 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 59 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 193 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(d(d(x1)))) -> d(d(b(b(x1)))) a(a(x1)) -> b(b(b(b(b(b(x1)))))) b(b(d(d(b(b(x1)))))) -> a(a(c(c(x1)))) c(c(x1)) -> d(d(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(a(d(d(x1)))) -> B(b(x1)) A(a(d(d(x1)))) -> B(x1) A(a(x1)) -> B(b(b(b(b(b(x1)))))) A(a(x1)) -> B(b(b(b(b(x1))))) A(a(x1)) -> B(b(b(b(x1)))) A(a(x1)) -> B(b(b(x1))) A(a(x1)) -> B(b(x1)) A(a(x1)) -> B(x1) B(b(d(d(b(b(x1)))))) -> A(a(c(c(x1)))) B(b(d(d(b(b(x1)))))) -> A(c(c(x1))) B(b(d(d(b(b(x1)))))) -> C(c(x1)) B(b(d(d(b(b(x1)))))) -> C(x1) The TRS R consists of the following rules: a(a(d(d(x1)))) -> d(d(b(b(x1)))) a(a(x1)) -> b(b(b(b(b(b(x1)))))) b(b(d(d(b(b(x1)))))) -> a(a(c(c(x1)))) c(c(x1)) -> d(d(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 2 less nodes. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: B(b(d(d(b(b(x1)))))) -> A(a(c(c(x1)))) A(a(d(d(x1)))) -> B(b(x1)) B(b(d(d(b(b(x1)))))) -> A(c(c(x1))) A(a(d(d(x1)))) -> B(x1) A(a(x1)) -> B(b(b(b(b(b(x1)))))) A(a(x1)) -> B(b(b(b(b(x1))))) A(a(x1)) -> B(b(b(b(x1)))) A(a(x1)) -> B(b(b(x1))) A(a(x1)) -> B(b(x1)) A(a(x1)) -> B(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 Standard