Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598441
details
property
value
status
complete
benchmark
mod_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.58082008362 seconds
cpu usage
11.276358314
max memory
6.07264768E8
stage attributes
key
value
output-size
63276
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 [SOUND, 0 ms] (6) AND (7) QDP (8) DependencyGraphProof [EQUIVALENT, 0 ms] (9) AND (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 7 ms] (12) YES (13) QDP (14) QDPOrderProof [EQUIVALENT, 49 ms] (15) QDP (16) DependencyGraphProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) AND (23) QDP (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] (25) YES (26) QDP (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] (28) YES (29) QDP (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] (31) 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 ; error :: a; error = stop MyTrue; modMyInt :: MyInt -> MyInt -> MyInt; modMyInt = primModInt; 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; primMinusNatS :: Main.Nat -> Main.Nat -> Main.Nat; primMinusNatS (Main.Succ x) (Main.Succ y) = primMinusNatS x y; primMinusNatS Main.Zero (Main.Succ y) = Main.Zero; primMinusNatS x Main.Zero = x; primModInt :: MyInt -> MyInt -> MyInt; primModInt (Main.Pos x) (Main.Pos (Main.Succ y)) = Main.Pos (primModNatS x (Main.Succ y)); primModInt (Main.Pos x) (Main.Neg (Main.Succ y)) = Main.Neg (primModNatP x (Main.Succ y)); primModInt (Main.Neg x) (Main.Pos (Main.Succ y)) = Main.Pos (primModNatP x (Main.Succ y)); primModInt (Main.Neg x) (Main.Neg (Main.Succ y)) = Main.Neg (primModNatS x (Main.Succ y)); primModInt vv vw = Main.error; primModNatP :: Main.Nat -> Main.Nat -> Main.Nat; primModNatP Main.Zero Main.Zero = Main.error; primModNatP Main.Zero (Main.Succ x) = Main.Zero; primModNatP (Main.Succ x) Main.Zero = Main.error; primModNatP (Main.Succ x) (Main.Succ Main.Zero) = Main.Zero; primModNatP (Main.Succ x) (Main.Succ (Main.Succ y)) = primModNatP0 x y (primGEqNatS x y); primModNatP0 x y MyTrue = primModNatP (primMinusNatS x (Main.Succ y)) (Main.Succ (Main.Succ y)); primModNatP0 x y MyFalse = primMinusNatS (Main.Succ y) x; primModNatS :: Main.Nat -> Main.Nat -> Main.Nat; primModNatS Main.Zero Main.Zero = Main.error; primModNatS Main.Zero (Main.Succ x) = Main.Zero; primModNatS (Main.Succ x) Main.Zero = Main.error; primModNatS (Main.Succ x) (Main.Succ Main.Zero) = Main.Zero; primModNatS (Main.Succ x) (Main.Succ (Main.Succ y)) = primModNatS0 x y (primGEqNatS x (Main.Succ y));
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell