Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072193
details
property
value
status
complete
benchmark
Ex1_Luc02b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.10967 seconds
cpu usage
4.83398
user time
4.60803
system time
0.225946
max virtual memory
1.8477524E7
max residence set size
361020.0
stage attributes
key
value
starexec-result
NO
output
NO 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 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) TransformationProof [EQUIVALENT, 0 ms] (27) QDP (28) TransformationProof [EQUIVALENT, 0 ms] (29) QDP (30) NonTerminationLoopProof [COMPLETE, 0 ms] (31) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: from(X) -> cons(X, from(s(X))) first(0, Z) -> nil first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z)) sel(0, cons(X, Z)) -> X sel(s(X), cons(Y, Z)) -> sel(X, Z) 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: from(X) -> cons(X, from(s(X))) first(0, Z) -> nil first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z)) sel(0, cons(X, Z)) -> X sel(s(X), cons(Y, Z)) -> sel(X, Z) The set Q consists of the following terms: from(x0) first(0, x0) first(s(x0), cons(x1, x2)) 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: FROM(X) -> FROM(s(X)) FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z) SEL(s(X), cons(Y, Z)) -> SEL(X, Z) The TRS R consists of the following rules: from(X) -> cons(X, from(s(X)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard