Haskell pair #487598224

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.44717097282 seconds
cpu usage	9.9067408
max memory	6.09632256E8

stage attributes

key	value
output-size	18837
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: 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) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (9) YES
    (10) QDP
        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (12) YES


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

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

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

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

fsFloat :: Float  ->  Float  ->  Float;
fsFloat = primDivFloat;

primDivFloat :: Float  ->  Float  ->  Float;
primDivFloat (Float x1 x2) (Float y1 y2) = Float (srMyInt x1 y2) (srMyInt x2 y1);

primMulInt :: MyInt  ->  MyInt  ->  MyInt;
primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y);
primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y);
primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y);
primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y);

primMulNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
primMulNat Main.Zero Main.Zero = Main.Zero;
primMulNat Main.Zero (Main.Succ y) = Main.Zero;
primMulNat (Main.Succ x) Main.Zero = Main.Zero;
primMulNat (Main.Succ x) (Main.Succ y) = primPlusNat (primMulNat x (Main.Succ y)) (Main.Succ 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));

srMyInt :: MyInt  ->  MyInt  ->  MyInt;
srMyInt = primMulInt;

}

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

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

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

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

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

fsFloat :: Float  ->  Float  ->  Float;
fsFloat = primDivFloat;

primDivFloat :: Float  ->  Float  ->  Float;
primDivFloat (Float x1 x2) (Float y1 y2) = Float (srMyInt x1 y2) (srMyInt x2 y1);

primMulInt :: MyInt  ->  MyInt  ->  MyInt;
primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y);
primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y);
primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y);
primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y);

primMulNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;

popout

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

job log

popout

actions all output return to Haskell