Funct Progr 77531 pair #381920559

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.21934199333 seconds
cpu usage	12.692661788
max memory	7.4932224E8

stage attributes

key	value
output-size	101448
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (9) YES
    (10) QDP
        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (12) YES
    (13) QDP
        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (15) YES
    (16) QDP
        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (18) YES
    (19) QDP
        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (21) YES
    (22) QDP
        (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (24) YES
    (25) QDP
        (26) DependencyGraphProof [EQUIVALENT, 0 ms]
        (27) AND
            (28) QDP
                (29) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (30) YES
            (31) QDP
                (32) QDPOrderProof [EQUIVALENT, 26 ms]
                (33) QDP
                (34) DependencyGraphProof [EQUIVALENT, 0 ms]
                (35) QDP
                (36) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (37) 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 Ratio a = CnPc a a ;

data Tup2 b a = Tup2 b a ;

error :: a;
error = stop MyTrue;

fromEnumRatio :: Ratio MyInt  ->  MyInt;
fromEnumRatio = truncateRatio;

fromIntMyInt :: MyInt  ->  MyInt;
fromIntMyInt x = x;

fromIntRatio :: MyInt  ->  Ratio MyInt;
fromIntRatio = intToRatio;

intToRatio x = CnPc (fromIntMyInt x) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero)));

primDivNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
primDivNatS Main.Zero Main.Zero = Main.error;
primDivNatS (Main.Succ x) Main.Zero = Main.error;
primDivNatS (Main.Succ x) (Main.Succ y) = primDivNatS0 x y (primGEqNatS x y);
primDivNatS Main.Zero (Main.Succ x) = Main.Zero;

primDivNatS0 x y MyTrue = Main.Succ (primDivNatS (primMinusNatS x y) (Main.Succ y));
primDivNatS0 x y MyFalse = Main.Zero;

primGEqNatS :: Main.Nat  ->  Main.Nat  ->  MyBool;
primGEqNatS (Main.Succ x) Main.Zero = MyTrue;
primGEqNatS (Main.Succ x) (Main.Succ y) = primGEqNatS x y;
primGEqNatS Main.Zero (Main.Succ x) = MyFalse;
primGEqNatS Main.Zero Main.Zero = MyTrue;

primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;

popout

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

job log

popout

actions all output return to Funct Progr 77531