Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598142
details
property
value
status
complete
benchmark
drop_1.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)
4.35683202744 seconds
cpu usage
10.18761941
max memory
5.7894912E8
stage attributes
key
value
output-size
23077
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) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) QDP (13) QReductionProof [EQUIVALENT, 0 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; 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 Ordering = LT | EQ | GT ; compareMyInt :: MyInt -> MyInt -> Ordering; compareMyInt = primCmpInt; drop :: MyInt -> List a -> List a; drop n xs = drop3 n xs; drop vv Nil = drop1 vv Nil; drop n (Cons vw xs) = drop0 n (Cons vw xs); drop0 n (Cons vw xs) = drop (msMyInt n (Main.Pos (Main.Succ Main.Zero))) xs; drop1 vv Nil = Nil; drop1 vz wu = drop0 vz wu; drop2 n xs MyTrue = xs; drop2 n xs MyFalse = drop1 n xs; drop3 n xs = drop2 n xs (ltEsMyInt n (Main.Pos Main.Zero)); drop3 wv ww = drop1 wv ww; esEsOrdering :: Ordering -> Ordering -> MyBool; esEsOrdering LT LT = MyTrue; esEsOrdering LT EQ = MyFalse; esEsOrdering LT GT = MyFalse; esEsOrdering EQ LT = MyFalse; esEsOrdering EQ EQ = MyTrue; esEsOrdering EQ GT = MyFalse; esEsOrdering GT LT = MyFalse; esEsOrdering GT EQ = MyFalse; esEsOrdering GT GT = MyTrue; fsEsOrdering :: Ordering -> Ordering -> MyBool; fsEsOrdering x y = not (esEsOrdering x y); ltEsMyInt :: MyInt -> MyInt -> MyBool; ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT; msMyInt :: MyInt -> MyInt -> MyInt; msMyInt = primMinusInt; not :: MyBool -> MyBool; not MyTrue = MyFalse; not MyFalse = MyTrue; primCmpInt :: MyInt -> MyInt -> Ordering; primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; primCmpInt (Main.Pos x) (Main.Neg y) = GT; primCmpInt (Main.Neg x) (Main.Pos y) = LT;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell