Haskell pair #487598333

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.1214530468 seconds
cpu usage	9.441174368
max memory	5.75401984E8

stage attributes

key	value
output-size	3877
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) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [EQUIVALENT, 28 ms]
(6) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Maybe a = Nothing  | Just a ;

gtGt0 q vv = q;

gtGtEsMaybe :: Main.Maybe a  ->  (a  ->  Main.Maybe b)  ->  Main.Maybe b;
gtGtEsMaybe (Main.Just x) k = k x;
gtGtEsMaybe Main.Nothing k = Main.Nothing;

gtGtMaybe :: Main.Maybe b  ->  Main.Maybe a  ->  Main.Maybe a;
gtGtMaybe p q = gtGtEsMaybe p (gtGt0 q);

}

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

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Maybe a = Nothing  | Just a ;

gtGt0 q vv = q;

gtGtEsMaybe :: Main.Maybe a  ->  (a  ->  Main.Maybe b)  ->  Main.Maybe b;
gtGtEsMaybe (Main.Just x) k = k x;
gtGtEsMaybe Main.Nothing k = Main.Nothing;

gtGtMaybe :: Main.Maybe b  ->  Main.Maybe a  ->  Main.Maybe a;
gtGtMaybe p q = gtGtEsMaybe p (gtGt0 q);

}

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

(3) COR (EQUIVALENT)
Cond Reductions:
The following Function with conditions
"undefined |Falseundefined;
"
is transformed to
"undefined  = undefined1;
"
"undefined0 True = undefined;
"
"undefined1  = undefined0 False;
"

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

(4)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Maybe a = Nothing  | Just a ;

gtGt0 q vv = q;

gtGtEsMaybe :: Main.Maybe a  ->  (a  ->  Main.Maybe b)  ->  Main.Maybe b;
gtGtEsMaybe (Main.Just x) k = k x;
gtGtEsMaybe Main.Nothing k = Main.Nothing;

gtGtMaybe :: Main.Maybe a  ->  Main.Maybe b  ->  Main.Maybe b;
gtGtMaybe p q = gtGtEsMaybe p (gtGt0 q);

}

popout

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

job log

popout

actions all output return to Haskell