details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	19.6443 seconds
cpu usage	38.5678
user time	36.9842
system time	1.58358
max virtual memory	1.8353612E7
max residence set size	4327976.0

stage attributes

key	value
starexec-result	MAYBE

output

35.59/18.82 MAYBE 38.12/19.53 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 38.12/19.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 38.12/19.53 38.12/19.53 38.12/19.53 H-Termination with start terms of the given HASKELL could not be shown: 38.12/19.53 38.12/19.53 (0) HASKELL 38.12/19.53 (1) BR [EQUIVALENT, 0 ms] 38.12/19.53 (2) HASKELL 38.12/19.53 (3) COR [EQUIVALENT, 0 ms] 38.12/19.53 (4) HASKELL 38.12/19.53 (5) Narrow [SOUND, 0 ms] 38.12/19.53 (6) AND 38.12/19.53 (7) QDP 38.12/19.53 (8) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (9) QDP 38.12/19.53 (10) TransformationProof [EQUIVALENT, 0 ms] 38.12/19.53 (11) QDP 38.12/19.53 (12) UsableRulesProof [EQUIVALENT, 0 ms] 38.12/19.53 (13) QDP 38.12/19.53 (14) QReductionProof [EQUIVALENT, 0 ms] 38.12/19.53 (15) QDP 38.12/19.53 (16) TransformationProof [EQUIVALENT, 0 ms] 38.12/19.53 (17) QDP 38.12/19.53 (18) MNOCProof [EQUIVALENT, 0 ms] 38.12/19.53 (19) QDP 38.12/19.53 (20) InductionCalculusProof [EQUIVALENT, 0 ms] 38.12/19.53 (21) QDP 38.12/19.53 (22) TransformationProof [EQUIVALENT, 0 ms] 38.12/19.53 (23) QDP 38.12/19.53 (24) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (25) QDP 38.12/19.53 (26) TransformationProof [EQUIVALENT, 0 ms] 38.12/19.53 (27) QDP 38.12/19.53 (28) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (29) QDP 38.12/19.53 (30) TransformationProof [EQUIVALENT, 0 ms] 38.12/19.53 (31) QDP 38.12/19.53 (32) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (33) QDP 38.12/19.53 (34) TransformationProof [EQUIVALENT, 0 ms] 38.12/19.53 (35) QDP 38.12/19.53 (36) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (37) QDP 38.12/19.53 (38) MNOCProof [EQUIVALENT, 0 ms] 38.12/19.53 (39) QDP 38.12/19.53 (40) InductionCalculusProof [EQUIVALENT, 0 ms] 38.12/19.53 (41) QDP 38.12/19.53 (42) QDP 38.12/19.53 (43) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (44) QDP 38.12/19.53 (45) QDPOrderProof [EQUIVALENT, 9 ms] 38.12/19.53 (46) QDP 38.12/19.53 (47) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (48) QDP 38.12/19.53 (49) QDPSizeChangeProof [EQUIVALENT, 0 ms] 38.12/19.53 (50) YES 38.12/19.53 (51) QDP 38.12/19.53 (52) QDPOrderProof [EQUIVALENT, 0 ms] 38.12/19.53 (53) QDP 38.12/19.53 (54) DependencyGraphProof [EQUIVALENT, 0 ms] 38.12/19.53 (55) QDP 38.12/19.53 (56) QDPSizeChangeProof [EQUIVALENT, 0 ms] 38.12/19.53 (57) YES 38.12/19.53 (58) QDP 38.12/19.53 (59) QDPSizeChangeProof [EQUIVALENT, 0 ms] 38.12/19.53 (60) YES 38.12/19.53 (61) Narrow [COMPLETE, 0 ms] 38.12/19.53 (62) TRUE 38.12/19.53 38.12/19.53 38.12/19.53 ---------------------------------------- 38.12/19.53 38.12/19.53 (0) 38.12/19.53 Obligation: 38.12/19.53 mainModule Main 38.12/19.53 module Main where { 38.12/19.53 import qualified Prelude; 38.12/19.53 data Main.Char = Char MyInt ; 38.12/19.53 38.12/19.53 data List a = Cons a (List a) | Nil ; 38.12/19.53 38.12/19.53 data MyBool = MyTrue | MyFalse ; 38.12/19.53 38.12/19.53 data MyInt = Pos Main.Nat | Neg Main.Nat ; 38.12/19.53 38.12/19.53 data Main.Nat = Succ Main.Nat | Zero ; 38.12/19.53 38.12/19.53 data Ordering = LT | EQ | GT ; 38.12/19.53 38.12/19.53 data Ratio a = CnPc a a ; 38.12/19.53 38.12/19.53 compareMyInt :: MyInt -> MyInt -> Ordering; 38.12/19.53 compareMyInt = primCmpInt; 38.12/19.53 38.12/19.53 divMyInt :: MyInt -> MyInt -> MyInt; 38.12/19.53 divMyInt = primDivInt; 38.12/19.53 38.12/19.53 error :: a; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52