Haskell pair #487598419

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.03739714622 seconds
cpu usage	24.676845449
max memory	1.839566848E9

stage attributes

key	value
output-size	351233
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 [SOUND, 0 ms]
(6) AND
    (7) QDP
        (8) QDPOrderProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) DependencyGraphProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) QDPOrderProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) DependencyGraphProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (22) YES
    (23) QDP
        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (25) YES
    (26) QDP
        (27) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (28) YES
    (29) QDP
        (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (31) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data MyBool = MyTrue  | MyFalse ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

data Ordering = LT  | EQ  | GT ;

data Tup2 a b = Tup2 a b ;

compareMyInt :: MyInt  ->  MyInt  ->  Ordering;
compareMyInt = primCmpInt;

divModDivMod0 wx wy d MyTrue = Tup2 (msMyInt (divModQ wx wy) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero)))) (psMyInt (divModR wx wy) d);
divModDivMod0 wx wy d MyFalse = divModQr wx wy;

divModMyInt :: MyInt  ->  MyInt  ->  Tup2 MyInt MyInt;
divModMyInt n d = divModDivMod0 n d d (esEsMyInt (signumMyInt (divModR n d)) (negateMyInt (signumMyInt d)));

divModQ wx wy = divModQ1 wx wy (divModVu5 wx wy);

divModQ1 wx wy (Tup2 q vv) = q;

divModQr wx wy = divModQr0 wx wy (divModVu5 wx wy);

divModQr0 wx wy qr = qr;

divModR wx wy = divModR0 wx wy (divModVu5 wx wy);

divModR0 wx wy (Tup2 vw r) = r;

divModVu5 wx wy = quotRemMyInt wx wy;

error :: a;
error = stop MyTrue;

esEsMyInt :: MyInt  ->  MyInt  ->  MyBool;
esEsMyInt = primEqInt;

esEsOrdering :: Ordering  ->  Ordering  ->  MyBool;
esEsOrdering LT LT = MyTrue;
esEsOrdering LT EQ = MyFalse;
esEsOrdering LT GT = MyFalse;
esEsOrdering EQ LT = MyFalse;
esEsOrdering EQ EQ = MyTrue;
esEsOrdering EQ GT = MyFalse;

popout

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

job log

popout

actions all output return to Haskell