Haskell pair #487598335

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.15915489197 seconds
cpu usage	9.885717979
max memory	5.6653824E8

stage attributes

key	value
output-size	12552
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 [EQUIVALENT, 32 ms]
(6) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

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

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

fromEnumChar :: Main.Char  ->  MyInt;
fromEnumChar = primCharToInt;

primCharToInt :: Main.Char  ->  MyInt;
primCharToInt (Main.Char x) = x;

primIntToChar :: MyInt  ->  Main.Char;
primIntToChar x = Main.Char x;

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;

pt :: (a  ->  c)  ->  (b  ->  a)  ->  b  ->  c;
pt f g x = f (g x);

succChar :: Main.Char  ->  Main.Char;
succChar = pt toEnumChar (pt (psMyInt (Main.Pos (Main.Succ Main.Zero))) fromEnumChar);

toEnumChar :: MyInt  ->  Main.Char;
toEnumChar = primIntToChar;

}

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

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

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

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

fromEnumChar :: Main.Char  ->  MyInt;
fromEnumChar = primCharToInt;

primCharToInt :: Main.Char  ->  MyInt;
primCharToInt (Main.Char x) = x;

primIntToChar :: MyInt  ->  Main.Char;

popout

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

job log

popout

actions all output return to Haskell