Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965295
details
property
value
status
complete
benchmark
emmes-nonloop-ex6_2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n137.star.cs.uiowa.edu
space
EEG_IJCAR_12
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
12.7627279758 seconds
cpu usage
34.837599547
max memory
1.075662848E9
stage attributes
key
value
output-size
18731
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished 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, 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) MRRProof [EQUIVALENT, 30 ms] (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) TRUE (23) QDP (24) UsableRulesProof [EQUIVALENT, 0 ms] (25) QDP (26) QReductionProof [EQUIVALENT, 0 ms] (27) QDP (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] (29) YES (30) QDP (31) MNOCProof [EQUIVALENT, 0 ms] (32) QDP (33) NonLoopProof [COMPLETE, 188 ms] (34) 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(xs, ys) -> appendAkk(reverse(xs), ys) appendAkk(nil, ys) -> ys appendAkk(cons(x, xs), ys) -> appendAkk(xs, cons(x, ys)) reverse(nil) -> nil reverse(cons(x, xs)) -> append(reverse(xs), cons(x, nil)) 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(xs, ys) -> appendAkk(reverse(xs), ys) appendAkk(nil, ys) -> ys appendAkk(cons(x, xs), ys) -> appendAkk(xs, cons(x, ys)) reverse(nil) -> nil reverse(cons(x, xs)) -> append(reverse(xs), cons(x, nil)) 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(xs, ys) -> appendAkk(reverse(xs), ys) appendAkk(nil, ys) -> ys appendAkk(cons(x, xs), ys) -> appendAkk(xs, cons(x, ys)) reverse(nil) -> nil reverse(cons(x, xs)) -> append(reverse(xs), cons(x, nil))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard