Haskell pair #487598580

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.45215988159 seconds
cpu usage	14.041750207
max memory	7.29411584E8

stage attributes

key	value
output-size	76986
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox/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) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) LetRed [EQUIVALENT, 0 ms]
(6) HASKELL
(7) Narrow [SOUND, 0 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) QDP
(11) TransformationProof [EQUIVALENT, 0 ms]
(12) QDP
(13) DependencyGraphProof [EQUIVALENT, 0 ms]
(14) QDP
(15) UsableRulesProof [EQUIVALENT, 0 ms]
(16) QDP
(17) QReductionProof [EQUIVALENT, 0 ms]
(18) QDP
(19) TransformationProof [EQUIVALENT, 0 ms]
(20) QDP
(21) TransformationProof [EQUIVALENT, 0 ms]
(22) QDP
(23) TransformationProof [EQUIVALENT, 0 ms]
(24) QDP
(25) TransformationProof [EQUIVALENT, 0 ms]
(26) QDP
(27) TransformationProof [EQUIVALENT, 0 ms]
(28) QDP
(29) QDPSizeChangeProof [EQUIVALENT, 11 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;
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' [] vy = [];
nub' (x : xs) ls  | x `elem` ls = nub' xs ls
 | otherwise = x : nub' xs (x : ls);
 };

}

popout

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

job log

popout

actions all output return to Haskell