TRS Standard pair #487067263

details

property	value
status	complete
benchmark	emmes-nonloop-ex6_1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n074.star.cs.uiowa.edu
space	EEG_IJCAR_12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.9679 seconds
cpu usage	30.4736
user time	29.808
system time	0.665629
max virtual memory	3.7133732E7
max residence set size	1061384.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) AAECC Innermost [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 10 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) MNOCProof [EQUIVALENT, 0 ms]
        (23) QDP
        (24) NonLoopProof [COMPLETE, 136 ms]
        (25) NO


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   f(true, xs) -> f(isList(xs), append(cons(a, nil), xs))
   isList(nil) -> true
   isList(cons(x, xs)) -> isList(xs)
   append(nil, ys) -> ys
   append(cons(x, xs), ys) -> cons(x, append(xs, ys))

Q is empty.

----------------------------------------

(1) AAECC Innermost (EQUIVALENT)
We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is 
   isList(nil) -> true
   isList(cons(x, xs)) -> isList(xs)
   append(nil, ys) -> ys
   append(cons(x, xs), ys) -> cons(x, append(xs, ys))

The TRS R 2 is 
   f(true, xs) -> f(isList(xs), append(cons(a, nil), xs))

The signature Sigma is {f_2}
----------------------------------------

(2)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   f(true, xs) -> f(isList(xs), append(cons(a, nil), xs))
   isList(nil) -> true
   isList(cons(x, xs)) -> isList(xs)
   append(nil, ys) -> ys
   append(cons(x, xs), ys) -> cons(x, append(xs, ys))

The set Q consists of the following terms:

   f(true, x0)
   isList(nil)
   isList(cons(x0, x1))
   append(nil, x0)
   append(cons(x0, 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:

   F(true, xs) -> F(isList(xs), append(cons(a, nil), xs))
   F(true, xs) -> ISLIST(xs)
   F(true, xs) -> APPEND(cons(a, nil), xs)
   ISLIST(cons(x, xs)) -> ISLIST(xs)

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Standard