Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317402
details
property
value
status
complete
benchmark
shows_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
17.4085 seconds
cpu usage
31.9437
user time
30.3367
system time
1.60703
max virtual memory
1.8353612E7
max residence set size
4310332.0
stage attributes
key
value
starexec-result
MAYBE
output
29.71/16.78 MAYBE 31.54/17.35 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 31.54/17.35 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 31.54/17.35 31.54/17.35 31.54/17.35 H-Termination with start terms of the given HASKELL could not be shown: 31.54/17.35 31.54/17.35 (0) HASKELL 31.54/17.35 (1) BR [EQUIVALENT, 0 ms] 31.54/17.35 (2) HASKELL 31.54/17.35 (3) COR [EQUIVALENT, 0 ms] 31.54/17.35 (4) HASKELL 31.54/17.35 (5) Narrow [SOUND, 0 ms] 31.54/17.35 (6) AND 31.54/17.35 (7) QDP 31.54/17.35 (8) QDPOrderProof [EQUIVALENT, 20 ms] 31.54/17.35 (9) QDP 31.54/17.35 (10) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.35 (11) QDP 31.54/17.35 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.54/17.35 (13) YES 31.54/17.35 (14) QDP 31.54/17.35 (15) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.35 (16) QDP 31.54/17.35 (17) QDPOrderProof [EQUIVALENT, 0 ms] 31.54/17.35 (18) QDP 31.54/17.35 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.35 (20) QDP 31.54/17.35 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.54/17.35 (22) YES 31.54/17.35 (23) QDP 31.54/17.35 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.54/17.35 (25) YES 31.54/17.35 (26) QDP 31.54/17.35 (27) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.35 (28) QDP 31.54/17.35 (29) TransformationProof [EQUIVALENT, 0 ms] 31.54/17.36 (30) QDP 31.54/17.36 (31) UsableRulesProof [EQUIVALENT, 0 ms] 31.54/17.36 (32) QDP 31.54/17.36 (33) QReductionProof [EQUIVALENT, 0 ms] 31.54/17.36 (34) QDP 31.54/17.36 (35) MNOCProof [EQUIVALENT, 0 ms] 31.54/17.36 (36) QDP 31.54/17.36 (37) InductionCalculusProof [EQUIVALENT, 0 ms] 31.54/17.36 (38) QDP 31.54/17.36 (39) TransformationProof [EQUIVALENT, 0 ms] 31.54/17.36 (40) QDP 31.54/17.36 (41) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.36 (42) QDP 31.54/17.36 (43) TransformationProof [EQUIVALENT, 0 ms] 31.54/17.36 (44) QDP 31.54/17.36 (45) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.36 (46) QDP 31.54/17.36 (47) TransformationProof [EQUIVALENT, 0 ms] 31.54/17.36 (48) QDP 31.54/17.36 (49) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.36 (50) QDP 31.54/17.36 (51) TransformationProof [EQUIVALENT, 0 ms] 31.54/17.36 (52) QDP 31.54/17.36 (53) DependencyGraphProof [EQUIVALENT, 0 ms] 31.54/17.36 (54) QDP 31.54/17.36 (55) MNOCProof [EQUIVALENT, 0 ms] 31.54/17.36 (56) QDP 31.54/17.36 (57) InductionCalculusProof [EQUIVALENT, 0 ms] 31.54/17.36 (58) QDP 31.54/17.36 (59) Narrow [COMPLETE, 0 ms] 31.54/17.36 (60) TRUE 31.54/17.36 31.54/17.36 31.54/17.36 ---------------------------------------- 31.54/17.36 31.54/17.36 (0) 31.54/17.36 Obligation: 31.54/17.36 mainModule Main 31.54/17.36 module Main where { 31.54/17.36 import qualified Prelude; 31.54/17.36 data Main.Char = Char MyInt ; 31.54/17.36 31.54/17.36 data List a = Cons a (List a) | Nil ; 31.54/17.36 31.54/17.36 data MyBool = MyTrue | MyFalse ; 31.54/17.36 31.54/17.36 data MyInt = Pos Main.Nat | Neg Main.Nat ; 31.54/17.36 31.54/17.36 data Main.Nat = Succ Main.Nat | Zero ; 31.54/17.36 31.54/17.36 divMyInt :: MyInt -> MyInt -> MyInt; 31.54/17.36 divMyInt = primDivInt; 31.54/17.36 31.54/17.36 error :: a; 31.54/17.36 error = stop MyTrue; 31.54/17.36 31.54/17.36 modMyInt :: MyInt -> MyInt -> MyInt; 31.54/17.36 modMyInt = primModInt; 31.54/17.36 31.54/17.36 primDivInt :: MyInt -> MyInt -> MyInt; 31.54/17.36 primDivInt (Main.Pos x) (Main.Pos (Main.Succ y)) = Main.Pos (primDivNatS x (Main.Succ y)); 31.54/17.36 primDivInt (Main.Pos x) (Main.Neg (Main.Succ y)) = Main.Neg (primDivNatP x (Main.Succ y)); 31.54/17.36 primDivInt (Main.Neg x) (Main.Pos (Main.Succ y)) = Main.Neg (primDivNatP x (Main.Succ y));
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52