Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487511513
details
property
value
status
complete
benchmark
x06.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Secret_07_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.75991606712 seconds
cpu usage
22.225086208
max memory
3.780673536E9
stage attributes
key
value
output-size
12768
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 21 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 198 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 84 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 71 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 38 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(b(x1)) -> c(b(x1)) c(c(x1)) -> d(b(x1)) d(x1) -> c(e(x1)) b(b(x1)) -> f(x1) c(b(x1)) -> g(x1) e(x1) -> f(x1) e(x1) -> b(b(x1)) f(g(x1)) -> a(c(x1)) g(f(x1)) -> e(x1) a(x1) -> b(c(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)) -> C(b(x1)) C(c(x1)) -> D(b(x1)) C(c(x1)) -> B(x1) D(x1) -> C(e(x1)) D(x1) -> E(x1) B(b(x1)) -> F(x1) C(b(x1)) -> G(x1) E(x1) -> F(x1) E(x1) -> B(b(x1)) E(x1) -> B(x1) F(g(x1)) -> A(c(x1)) F(g(x1)) -> C(x1) G(f(x1)) -> E(x1) A(x1) -> B(c(x1)) A(x1) -> C(x1) The TRS R consists of the following rules: a(b(x1)) -> c(b(x1)) c(c(x1)) -> d(b(x1)) d(x1) -> c(e(x1)) b(b(x1)) -> f(x1) c(b(x1)) -> g(x1) e(x1) -> f(x1) e(x1) -> b(b(x1)) f(g(x1)) -> a(c(x1)) g(f(x1)) -> e(x1) a(x1) -> b(c(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard