Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317464
details
property
value
status
complete
benchmark
GTEQ_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n082.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.06916 seconds
cpu usage
9.47657
user time
9.17565
system time
0.300926
max virtual memory
1.828352E7
max residence set size
577916.0
stage attributes
key
value
starexec-result
YES
output
7.79/3.53 YES 9.34/4.02 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.34/4.02 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.34/4.02 9.34/4.02 9.34/4.02 H-Termination with start terms of the given HASKELL could be proven: 9.34/4.02 9.34/4.02 (0) HASKELL 9.34/4.02 (1) BR [EQUIVALENT, 0 ms] 9.34/4.02 (2) HASKELL 9.34/4.02 (3) COR [EQUIVALENT, 0 ms] 9.34/4.02 (4) HASKELL 9.34/4.02 (5) Narrow [EQUIVALENT, 0 ms] 9.34/4.02 (6) YES 9.34/4.02 9.34/4.02 9.34/4.02 ---------------------------------------- 9.34/4.02 9.34/4.02 (0) 9.34/4.02 Obligation: 9.34/4.02 mainModule Main 9.34/4.02 module Main where { 9.34/4.02 import qualified Prelude; 9.34/4.02 data MyBool = MyTrue | MyFalse ; 9.34/4.02 9.34/4.02 data Ordering = LT | EQ | GT ; 9.34/4.02 9.34/4.02 data Tup0 = Tup0 ; 9.34/4.02 9.34/4.02 compareTup0 :: Tup0 -> Tup0 -> Ordering; 9.34/4.02 compareTup0 Tup0 Tup0 = EQ; 9.34/4.02 9.34/4.02 esEsOrdering :: Ordering -> Ordering -> MyBool; 9.34/4.02 esEsOrdering LT LT = MyTrue; 9.34/4.02 esEsOrdering LT EQ = MyFalse; 9.34/4.02 esEsOrdering LT GT = MyFalse; 9.34/4.02 esEsOrdering EQ LT = MyFalse; 9.34/4.02 esEsOrdering EQ EQ = MyTrue; 9.34/4.02 esEsOrdering EQ GT = MyFalse; 9.34/4.02 esEsOrdering GT LT = MyFalse; 9.34/4.02 esEsOrdering GT EQ = MyFalse; 9.34/4.02 esEsOrdering GT GT = MyTrue; 9.34/4.02 9.34/4.02 fsEsOrdering :: Ordering -> Ordering -> MyBool; 9.34/4.02 fsEsOrdering x y = not (esEsOrdering x y); 9.34/4.02 9.34/4.02 gtEsTup0 :: Tup0 -> Tup0 -> MyBool; 9.34/4.02 gtEsTup0 x y = fsEsOrdering (compareTup0 x y) LT; 9.34/4.02 9.34/4.02 not :: MyBool -> MyBool; 9.34/4.02 not MyTrue = MyFalse; 9.34/4.02 not MyFalse = MyTrue; 9.34/4.02 9.34/4.02 } 9.34/4.02 9.34/4.02 ---------------------------------------- 9.34/4.02 9.34/4.02 (1) BR (EQUIVALENT) 9.34/4.02 Replaced joker patterns by fresh variables and removed binding patterns. 9.34/4.02 ---------------------------------------- 9.34/4.02 9.34/4.02 (2) 9.34/4.02 Obligation: 9.34/4.02 mainModule Main 9.34/4.02 module Main where { 9.34/4.02 import qualified Prelude; 9.34/4.02 data MyBool = MyTrue | MyFalse ; 9.34/4.02 9.34/4.02 data Ordering = LT | EQ | GT ; 9.34/4.02 9.34/4.02 data Tup0 = Tup0 ; 9.34/4.02 9.34/4.02 compareTup0 :: Tup0 -> Tup0 -> Ordering; 9.34/4.02 compareTup0 Tup0 Tup0 = EQ; 9.34/4.02 9.34/4.02 esEsOrdering :: Ordering -> Ordering -> MyBool; 9.34/4.02 esEsOrdering LT LT = MyTrue; 9.34/4.02 esEsOrdering LT EQ = MyFalse; 9.34/4.02 esEsOrdering LT GT = MyFalse; 9.34/4.02 esEsOrdering EQ LT = MyFalse; 9.34/4.02 esEsOrdering EQ EQ = MyTrue; 9.34/4.02 esEsOrdering EQ GT = MyFalse; 9.34/4.02 esEsOrdering GT LT = MyFalse; 9.34/4.02 esEsOrdering GT EQ = MyFalse; 9.34/4.02 esEsOrdering GT GT = MyTrue; 9.34/4.02 9.34/4.02 fsEsOrdering :: Ordering -> Ordering -> MyBool; 9.34/4.02 fsEsOrdering x y = not (esEsOrdering x y); 9.34/4.02 9.34/4.02 gtEsTup0 :: Tup0 -> Tup0 -> MyBool; 9.34/4.02 gtEsTup0 x y = fsEsOrdering (compareTup0 x y) LT; 9.34/4.02 9.34/4.02 not :: MyBool -> MyBool; 9.34/4.02 not MyTrue = MyFalse; 9.34/4.02 not MyFalse = MyTrue; 9.34/4.02 9.34/4.02 } 9.34/4.02 9.34/4.02 ---------------------------------------- 9.34/4.02
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52