Funct Progr 77531 pair #381920269

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	33.5929210186 seconds
cpu usage	51.640446154
max memory	4.525006848E9

stage attributes

key	value
output-size	200964
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: 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) TransformationProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) TransformationProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) TransformationProof [EQUIVALENT, 0 ms]
        (19) QDP
        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (21) YES


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

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

data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

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

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

data Tup2 a b = Tup2 a b ;

break :: (a  ->  MyBool)  ->  List a  ->  Tup2 (List a) (List a);
break p = span (pt not p);

esEsChar :: Main.Char  ->  Main.Char  ->  MyBool;
esEsChar = primEqChar;

lines :: List Main.Char  ->  List (List Main.Char);
lines Nil = Nil;
lines s = Cons (linesL s) (linesLines0 s (linesS' s));

linesL xw = linesL0 xw (linesVu44 xw);

linesL0 xw (Tup2 l vv) = l;

linesLines0 xw Nil = Nil;
linesLines0 xw (Cons vw s'') = lines s'';

linesS' xw = linesS'0 xw (linesVu44 xw);

linesS'0 xw (Tup2 vx s') = s';

linesVu44 xw = break (esEsChar (Main.Char (Main.Pos (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ Main.Zero))))))))))))) xw;

not :: MyBool  ->  MyBool;
not MyTrue = MyFalse;
not MyFalse = MyTrue;

otherwise :: MyBool;
otherwise = MyTrue;

primEqChar :: Main.Char  ->  Main.Char  ->  MyBool;
primEqChar (Main.Char x) (Main.Char y) = primEqInt x y;

primEqInt :: MyInt  ->  MyInt  ->  MyBool;
primEqInt (Main.Pos (Main.Succ x)) (Main.Pos (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Neg (Main.Succ x)) (Main.Neg (Main.Succ y)) = primEqNat x y;
primEqInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = MyTrue;
primEqInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = MyTrue;
primEqInt vy vz = MyFalse;

primEqNat :: Main.Nat  ->  Main.Nat  ->  MyBool;
primEqNat Main.Zero Main.Zero = MyTrue;

popout

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

job log

popout

actions all output return to Funct Progr 77531