Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709968
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
n050.star.cs.uiowa.edu
space
EEG_IJCAR_12
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
11.9918410778 seconds
cpu usage
31.74367337
max memory
8.57903104E8
stage attributes
key
value
output-size
11803
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 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) MNOCProof [EQUIVALENT, 0 ms] (23) QDP (24) NonLoopProof [COMPLETE, 119 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:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472