Haskell pair #487598843

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.68336582184 seconds
cpu usage	14.809346238
max memory	9.22783744E8

stage attributes

key	value
output-size	222664
starexec-result	MAYBE

output

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


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


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

(0) HASKELL
(1) IFR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) BR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) COR [EQUIVALENT, 23 ms]
(6) HASKELL
(7) LetRed [EQUIVALENT, 0 ms]
(8) HASKELL
(9) NumRed [SOUND, 0 ms]
(10) HASKELL
(11) Narrow [SOUND, 0 ms]
(12) AND
    (13) QDP
        (14) DependencyGraphProof [EQUIVALENT, 0 ms]
        (15) AND
            (16) QDP
                (17) MNOCProof [EQUIVALENT, 20 ms]
                (18) QDP
                (19) NonTerminationLoopProof [COMPLETE, 0 ms]
                (20) NO
            (21) QDP
                (22) QDPOrderProof [EQUIVALENT, 75 ms]
                (23) QDP
                (24) DependencyGraphProof [EQUIVALENT, 0 ms]
                (25) AND
                    (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
    (38) QDP
        (39) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (40) YES
    (41) QDP
        (42) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (43) YES
(44) Narrow [COMPLETE, 0 ms]
(45) TRUE


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

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

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

(1) IFR (EQUIVALENT)
If Reductions:
The following If expression
"if n >= 0 then x ^ n else recip (x ^ (`negate` n))"
is transformed to
"prPr0 x n True = x ^ n;
prPr0 x n False = recip (x ^ (`negate` n));
"
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;
"

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

(2)
Obligation:
mainModule Main 
module Main where {
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