Haskell pair #487598129

details

property	value
status	complete
benchmark	floor_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	basic_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.63019895554 seconds
cpu usage	21.71158234
max memory	1.369849856E9

stage attributes

key	value
output-size	585695
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) 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, 26 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) AND
            (17) QDP
                (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (19) YES
            (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


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

(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 Ratio a = CnPc a a ;

data Tup2 b a = Tup2 b a ;

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

compareRatio :: Ratio MyInt  ->  Ratio MyInt  ->  Ordering;
compareRatio (CnPc x y) (CnPc x' y') = compareMyInt (srMyInt x y') (srMyInt x' y);

error :: a;
error = stop MyTrue;

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;
esEsOrdering GT LT = MyFalse;
esEsOrdering GT EQ = MyFalse;
esEsOrdering GT GT = MyTrue;

floorFloor0 xv MyTrue = msMyInt (floorN xv) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero)));
floorFloor0 xv MyFalse = floorN xv;

floorN xv = floorN0 xv (floorVu9 xv);

floorN0 xv (Tup2 n vw) = n;

floorR xv = floorR0 xv (floorVu9 xv);

floorR0 xv (Tup2 vv r) = r;

floorRatio :: Ratio MyInt  ->  MyInt;
floorRatio x = floorFloor0 x (ltRatio (floorR x) (fromIntRatio (Main.Pos Main.Zero)));

floorVu9 xv = properFractionRatio xv;

fromIntMyInt :: MyInt  ->  MyInt;

popout

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

job log

popout

actions all output return to Haskell