details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.15787982941 seconds
cpu usage	12.98895057
max memory	6.99977728E8

stage attributes

key	value
output-size	10037
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) IPR [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) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) 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; partition :: (a -> Bool) -> [a] -> ([a],[a]); partition p xs = foldr (select p) ([],[]) xs; select p x ~((ts,fs)) | p x = (x : ts,fs) | otherwise = (ts,x : fs); } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) IPR (EQUIVALENT) IrrPat Reductions: The variables of the following irrefutable Pattern "~(ts,fs)" are replaced by calls to these functions "select0 (ts,fs) = ts; " "select1 (ts,fs) = fs; " ---------------------------------------- (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; partition :: (a -> Bool) -> [a] -> ([a],[a]); partition p xs = foldr (select p) ([],[]) xs; select p x vw | p x = (x : select0 vw,select1 vw) | otherwise = (select0 vw,x : select1 vw); select0 (ts,fs) = ts; select1 (ts,fs) = fs; } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (3) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. popout

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

job log

popout

actions

all output return to Haskell