Haskell pair #487598389

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.6344230175 seconds
cpu usage	10.793853291
max memory	5.99990272E8

stage attributes

key	value
output-size	99208
starexec-result	MAYBE

output

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


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


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

(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) MNOCProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) NonTerminationLoopProof [COMPLETE, 0 ms]
        (11) NO
    (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
    (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES
(21) Narrow [COMPLETE, 0 ms]
(22) TRUE


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

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

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

enumFromThenMyInt :: MyInt  ->  MyInt  ->  List MyInt;
enumFromThenMyInt = numericEnumFromThen;

iterate :: (a  ->  a)  ->  a  ->  List a;
iterate f x = Cons x (iterate f (f x));

msMyInt :: MyInt  ->  MyInt  ->  MyInt;
msMyInt = primMinusInt;

numericEnumFromThen n m = iterate (psMyInt (msMyInt m n)) n;

primMinusInt :: MyInt  ->  MyInt  ->  MyInt;
primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y);
primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y);
primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x;
primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y;

primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;
primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero;
primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x);
primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y;

primPlusInt :: MyInt  ->  MyInt  ->  MyInt;
primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y;
primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x;
primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y);
primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y);

primPlusNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
primPlusNat Main.Zero Main.Zero = Main.Zero;
primPlusNat Main.Zero (Main.Succ y) = Main.Succ y;
primPlusNat (Main.Succ x) Main.Zero = Main.Succ x;
primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y));

psMyInt :: MyInt  ->  MyInt  ->  MyInt;
psMyInt = primPlusInt;

}

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

(1) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(2)
Obligation:
mainModule Main

popout

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

job log

popout

actions all output return to Haskell