Funct Progr 77531 pair #381920682

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.85985898972 seconds
cpu usage	18.58555086
max memory	1.40099584E9

stage attributes

key	value
output-size	191426
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

(0) HASKELL
(1) BR [EQUIVALENT, 12 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) LetRed [EQUIVALENT, 0 ms]
(6) HASKELL
(7) Narrow [SOUND, 0 ms]
(8) AND
    (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 3 ms]
        (11) YES
    (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
    (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES
    (21) QDP
        (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (23) 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;
nub :: Eq a => [a]  ->  [a];
nub l = nub' l [] where { 
nub' [] _ = [];
nub' (x : xs) ls  | x `elem` ls = nub' xs ls
 | otherwise = x : nub' xs (x : ls);
 };

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

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

(1) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(2)
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;
nub :: Eq a => [a]  ->  [a];
nub l = nub' l [] where { 
nub' [] xw = [];
nub' (x : xs) ls  | x `elem` ls = nub' xs ls
 | otherwise = x : nub' xs (x : ls);
 };

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

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

popout

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

job log

popout

actions all output return to Funct Progr 77531