Haskell pair #487599425

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.66210818291 seconds
cpu usage	12.494648092
max memory	6.83962368E8

stage attributes

key	value
output-size	10165
starexec-result	MAYBE

output

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


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


MAYBE
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 not be shown:

(0) HASKELL
(1) CR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) BR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) COR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) Narrow [SOUND, 0 ms]
(8) QDP
    (9) NonTerminationLoopProof [COMPLETE, 0 ms]
    (10) NO
(11) Narrow [COMPLETE, 0 ms]
(12) QDP
    (13) DependencyGraphProof [EQUIVALENT, 0 ms]
    (14) TRUE


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

(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;
unfoldr :: (b  ->  Maybe (a,b))  ->  b  ->  [a];
unfoldr f b = case f b of { 
Just (a,new_b)-> a : unfoldr f new_b; 
Nothing-> []; 
 } ;

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

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

(1) CR (EQUIVALENT)
Case Reductions:
The following Case expression
"case f b of {
Just (a,new_b)  -> a : unfoldr f new_b;
Nothing  -> []}
"
is transformed to
"unfoldr0 f (Just (a,new_b)) = a : unfoldr f new_b;
unfoldr0 f Nothing = [];
"

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

(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;
unfoldr :: (b  ->  Maybe (a,b))  ->  b  ->  [a];
unfoldr f b = unfoldr0 f (f b);

unfoldr0 f (Just (a,new_b)) = a : unfoldr f new_b;
unfoldr0 f Nothing = [];

}
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 Haskell