Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072118
details
property
value
status
complete
benchmark
Ex8_BLR02.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n191.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.02015 seconds
cpu usage
4.41281
user time
4.20304
system time
0.209771
max virtual memory
1.8477524E7
max residence set size
310084.0
stage attributes
key
value
starexec-result
NO
output
NO 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 disproven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) QDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) QDP (24) QReductionProof [EQUIVALENT, 0 ms] (25) QDP (26) MNOCProof [EQUIVALENT, 0 ms] (27) QDP (28) NonTerminationLoopProof [COMPLETE, 0 ms] (29) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: fib(N) -> sel(N, fib1(s(0), s(0))) fib1(X, Y) -> cons(X, fib1(Y, add(X, Y))) add(0, X) -> X add(s(X), Y) -> s(add(X, Y)) sel(0, cons(X, XS)) -> X sel(s(N), cons(X, XS)) -> sel(N, XS) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: fib(N) -> sel(N, fib1(s(0), s(0))) fib1(X, Y) -> cons(X, fib1(Y, add(X, Y))) add(0, X) -> X add(s(X), Y) -> s(add(X, Y)) sel(0, cons(X, XS)) -> X sel(s(N), cons(X, XS)) -> sel(N, XS) The set Q consists of the following terms: fib(x0) fib1(x0, x1) add(0, x0) add(s(x0), x1) sel(0, cons(x0, x1)) sel(s(x0), cons(x1, x2)) ---------------------------------------- (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: FIB(N) -> SEL(N, fib1(s(0), s(0))) FIB(N) -> FIB1(s(0), s(0)) FIB1(X, Y) -> FIB1(Y, add(X, Y)) FIB1(X, Y) -> ADD(X, Y) ADD(s(X), Y) -> ADD(X, Y) SEL(s(N), cons(X, XS)) -> SEL(N, XS)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard