Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487091452
details
property
value
status
complete
benchmark
z094.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n022.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.06578 seconds
cpu usage
9.23127
user time
8.74947
system time
0.481802
max virtual memory
3.8849112E7
max residence set size
1206440.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) DependencyPairsProof [EQUIVALENT, 13 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) QDPOrderProof [EQUIVALENT, 0 ms] (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 4 ms] (18) QDP (19) PisEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x1) -> n(c(c(x1))) c(f(x1)) -> f(c(c(x1))) c(c(x1)) -> c(x1) n(s(x1)) -> f(s(s(x1))) n(f(x1)) -> f(n(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: f(x1) -> c(c(n(x1))) f(c(x1)) -> c(c(f(x1))) c(c(x1)) -> c(x1) s(n(x1)) -> s(s(f(x1))) f(n(x1)) -> n(f(x1)) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: F(x1) -> C(c(n(x1))) F(x1) -> C(n(x1)) F(c(x1)) -> C(c(f(x1))) F(c(x1)) -> C(f(x1)) F(c(x1)) -> F(x1) S(n(x1)) -> S(s(f(x1))) S(n(x1)) -> S(f(x1)) S(n(x1)) -> F(x1) F(n(x1)) -> F(x1) The TRS R consists of the following rules: f(x1) -> c(c(n(x1))) f(c(x1)) -> c(c(f(x1))) c(c(x1)) -> c(x1) s(n(x1)) -> s(s(f(x1))) f(n(x1)) -> n(f(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 5 less nodes. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard