Haskell pair #487599451

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.260160923 seconds
cpu usage	20.007470777
max memory	1.729589248E9

stage attributes

key	value
output-size	1015304
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) CR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) IFR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) BR [EQUIVALENT, 0 ms]
(6) HASKELL
(7) COR [EQUIVALENT, 6 ms]
(8) HASKELL
(9) LetRed [EQUIVALENT, 0 ms]
(10) HASKELL
(11) NumRed [SOUND, 0 ms]
(12) HASKELL
(13) Narrow [SOUND, 0 ms]
(14) AND
    (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) QDP
        (19) DependencyGraphProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) QDPSizeChangeProof [EQUIVALENT, 10 ms]
        (22) YES
    (23) QDP
        (24) QDPSizeChangeProof [EQUIVALENT, 14 ms]
        (25) YES
    (26) QDP
        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (28) YES
    (29) QDP
        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (31) YES
    (32) QDP
        (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (34) YES
    (35) QDP
        (36) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (37) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(1) CR (EQUIVALENT)
Case Reductions:
The following Case expression
"case compare x y of {
EQ  -> o;
LT  -> LT;
GT  -> GT}
"
is transformed to
"primCompAux0 o EQ = o;
primCompAux0 o LT = LT;
primCompAux0 o GT = GT;
"

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(3) IFR (EQUIVALENT)
If Reductions:
The following If expression
"if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero"
is transformed to
"primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y));
primDivNatS0 x y False = Zero;
"
The following If expression
"if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x"
is transformed to

popout

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

job log

popout

actions all output return to Haskell