Haskell pair #487598651

details

property	value
status	complete
benchmark	List_genericSplitAt_1.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n108.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.71711111069 seconds
cpu usage	15.140868464
max memory	7.25200896E8

stage attributes

key	value
output-size	38797
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files


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


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


H-Termination with start terms of the given HASKELL could be proven:

(0) HASKELL
(1) LR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) CR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) IFR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) BR [EQUIVALENT, 0 ms]
(8) HASKELL
(9) COR [EQUIVALENT, 0 ms]
(10) HASKELL
(11) LetRed [EQUIVALENT, 0 ms]
(12) HASKELL
(13) NumRed [SOUND, 0 ms]
(14) HASKELL
(15) Narrow [SOUND, 0 ms]
(16) QDP
(17) TransformationProof [EQUIVALENT, 0 ms]
(18) QDP
(19) DependencyGraphProof [EQUIVALENT, 0 ms]
(20) QDP
(21) TransformationProof [EQUIVALENT, 0 ms]
(22) QDP
(23) DependencyGraphProof [EQUIVALENT, 0 ms]
(24) QDP
(25) UsableRulesProof [EQUIVALENT, 0 ms]
(26) QDP
(27) QReductionProof [EQUIVALENT, 0 ms]
(28) QDP
(29) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(30) YES


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

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
genericSplitAt :: Integral b => b  ->  [a]  ->  ([a],[a]);
genericSplitAt 0 xs = ([],xs);
genericSplitAt _ [] = ([],[]);
genericSplitAt n (x : xs)  | n > 0 = (x : xs',xs'') where { 
vv9 = genericSplitAt (n - 1) xs;
xs' = (\(xs',_) ->xs') vv9;
xs'' = (\(_,xs'') ->xs'') vv9;
 };
genericSplitAt _ _ = error [];

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

(1) LR (EQUIVALENT)
Lambda Reductions:
The following Lambda expression
"\(_,xs'')->xs''"
is transformed to
"xs''0 (_,xs'') = xs'';
"
The following Lambda expression
"\(xs',_)->xs'"
is transformed to
"xs'0 (xs',_) = xs';
"

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

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;

popout

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

job log

popout

actions all output return to Haskell