details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.1034 seconds
cpu usage	31.5774
user time	29.9629
system time	1.61453
max virtual memory	1.8353612E7
max residence set size	4321204.0

stage attributes

key	value
starexec-result	MAYBE

output

28.97/15.41 MAYBE 31.40/15.99 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 31.40/15.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 31.40/15.99 31.40/15.99 31.40/15.99 H-Termination with start terms of the given HASKELL could not be shown: 31.40/15.99 31.40/15.99 (0) HASKELL 31.40/15.99 (1) IFR [EQUIVALENT, 0 ms] 31.40/15.99 (2) HASKELL 31.40/15.99 (3) BR [EQUIVALENT, 0 ms] 31.40/15.99 (4) HASKELL 31.40/15.99 (5) COR [EQUIVALENT, 0 ms] 31.40/15.99 (6) HASKELL 31.40/15.99 (7) NumRed [SOUND, 5 ms] 31.40/15.99 (8) HASKELL 31.40/15.99 (9) Narrow [SOUND, 0 ms] 31.40/15.99 (10) AND 31.40/15.99 (11) QDP 31.40/15.99 (12) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (13) QDP 31.40/15.99 (14) QDPOrderProof [EQUIVALENT, 0 ms] 31.40/15.99 (15) QDP 31.40/15.99 (16) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (17) QDP 31.40/15.99 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.40/15.99 (19) YES 31.40/15.99 (20) QDP 31.40/15.99 (21) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (22) QDP 31.40/15.99 (23) TransformationProof [EQUIVALENT, 0 ms] 31.40/15.99 (24) QDP 31.40/15.99 (25) UsableRulesProof [EQUIVALENT, 0 ms] 31.40/15.99 (26) QDP 31.40/15.99 (27) QReductionProof [EQUIVALENT, 0 ms] 31.40/15.99 (28) QDP 31.40/15.99 (29) MNOCProof [EQUIVALENT, 0 ms] 31.40/15.99 (30) QDP 31.40/15.99 (31) InductionCalculusProof [EQUIVALENT, 0 ms] 31.40/15.99 (32) QDP 31.40/15.99 (33) TransformationProof [EQUIVALENT, 0 ms] 31.40/15.99 (34) QDP 31.40/15.99 (35) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (36) QDP 31.40/15.99 (37) TransformationProof [EQUIVALENT, 0 ms] 31.40/15.99 (38) QDP 31.40/15.99 (39) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (40) QDP 31.40/15.99 (41) TransformationProof [EQUIVALENT, 0 ms] 31.40/15.99 (42) QDP 31.40/15.99 (43) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (44) QDP 31.40/15.99 (45) TransformationProof [EQUIVALENT, 1 ms] 31.40/15.99 (46) QDP 31.40/15.99 (47) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (48) QDP 31.40/15.99 (49) MNOCProof [EQUIVALENT, 0 ms] 31.40/15.99 (50) QDP 31.40/15.99 (51) InductionCalculusProof [EQUIVALENT, 0 ms] 31.40/15.99 (52) QDP 31.40/15.99 (53) QDP 31.40/15.99 (54) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.40/15.99 (55) YES 31.40/15.99 (56) QDP 31.40/15.99 (57) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (58) QDP 31.40/15.99 (59) QDPOrderProof [EQUIVALENT, 0 ms] 31.40/15.99 (60) QDP 31.40/15.99 (61) DependencyGraphProof [EQUIVALENT, 0 ms] 31.40/15.99 (62) QDP 31.40/15.99 (63) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.40/15.99 (64) YES 31.40/15.99 (65) Narrow [COMPLETE, 0 ms] 31.40/15.99 (66) TRUE 31.40/15.99 31.40/15.99 31.40/15.99 ---------------------------------------- 31.40/15.99 31.40/15.99 (0) 31.40/15.99 Obligation: 31.40/15.99 mainModule Main 31.40/15.99 module Main where { 31.40/15.99 import qualified Prelude; 31.40/15.99 } 31.40/15.99 31.40/15.99 ---------------------------------------- 31.40/15.99 31.40/15.99 (1) IFR (EQUIVALENT) 31.40/15.99 If Reductions: 31.40/15.99 The following If expression 31.40/15.99 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 31.40/15.99 is transformed to 31.40/15.99 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 31.40/15.99 primModNatS0 x y False = Succ x; 31.40/15.99 " 31.40/15.99 The following If expression 31.40/15.99 "if primGEqNatS x y then primModNatP (primMinusNatS x y) (Succ y) else primMinusNatS y x" 31.40/15.99 is transformed to 31.40/15.99 "primModNatP0 x y True = primModNatP (primMinusNatS x y) (Succ y); 31.40/15.99 primModNatP0 x y False = primMinusNatS y x; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52