details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.07667 seconds
cpu usage	10.0022
user time	9.68862
system time	0.313536
max virtual memory	1.828352E7
max residence set size	580128.0

stage attributes

key	value
starexec-result	YES

output

7.78/3.47 YES 9.68/3.99 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.68/3.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.68/3.99 9.68/3.99 9.68/3.99 H-Termination with start terms of the given HASKELL could be proven: 9.68/3.99 9.68/3.99 (0) HASKELL 9.68/3.99 (1) BR [EQUIVALENT, 0 ms] 9.68/3.99 (2) HASKELL 9.68/3.99 (3) COR [EQUIVALENT, 0 ms] 9.68/3.99 (4) HASKELL 9.68/3.99 (5) NumRed [SOUND, 0 ms] 9.68/3.99 (6) HASKELL 9.68/3.99 (7) Narrow [EQUIVALENT, 13 ms] 9.68/3.99 (8) YES 9.68/3.99 9.68/3.99 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (0) 9.68/3.99 Obligation: 9.68/3.99 mainModule Main 9.68/3.99 module Main where { 9.68/3.99 import qualified Prelude; 9.68/3.99 } 9.68/3.99 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (1) BR (EQUIVALENT) 9.68/3.99 Replaced joker patterns by fresh variables and removed binding patterns. 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (2) 9.68/3.99 Obligation: 9.68/3.99 mainModule Main 9.68/3.99 module Main where { 9.68/3.99 import qualified Prelude; 9.68/3.99 } 9.68/3.99 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (3) COR (EQUIVALENT) 9.68/3.99 Cond Reductions: 9.68/3.99 The following Function with conditions 9.68/3.99 "undefined |Falseundefined; 9.68/3.99 " 9.68/3.99 is transformed to 9.68/3.99 "undefined = undefined1; 9.68/3.99 " 9.68/3.99 "undefined0 True = undefined; 9.68/3.99 " 9.68/3.99 "undefined1 = undefined0 False; 9.68/3.99 " 9.68/3.99 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (4) 9.68/3.99 Obligation: 9.68/3.99 mainModule Main 9.68/3.99 module Main where { 9.68/3.99 import qualified Prelude; 9.68/3.99 } 9.68/3.99 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (5) NumRed (SOUND) 9.68/3.99 Num Reduction:All numbers are transformed to their corresponding representation with Succ, Pred and Zero. 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (6) 9.68/3.99 Obligation: 9.68/3.99 mainModule Main 9.68/3.99 module Main where { 9.68/3.99 import qualified Prelude; 9.68/3.99 } 9.68/3.99 9.68/3.99 ---------------------------------------- 9.68/3.99 9.68/3.99 (7) Narrow (EQUIVALENT) 9.68/3.99 Haskell To QDPs 9.68/3.99 9.68/3.99 digraph dp_graph { 9.68/3.99 node [outthreshold=100, inthreshold=100];1[label="succ",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 9.68/3.99 3[label="succ vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 9.68/3.99 4[label="toEnum . (Pos (Succ Zero) +) . fromEnum",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3]; 9.68/3.99 5[label="toEnum ((Pos (Succ Zero) +) . fromEnum)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 9.68/3.99 6[label="primIntToChar ((Pos (Succ Zero) +) . fromEnum)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 9.68/3.99 7[label="primIntToChar (Pos (Succ Zero) + fromEnum vx3)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 9.68/3.99 8[label="primIntToChar (primPlusInt (Pos (Succ Zero)) (fromEnum vx3))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 9.68/3.99 9[label="primIntToChar (primPlusInt (Pos (Succ Zero)) (primCharToInt vx3))",fontsize=16,color="burlywood",shape="box"];24[label="vx3/Char vx30",fontsize=10,color="white",style="solid",shape="box"];9 -> 24[label="",style="solid", color="burlywood", weight=9]; 9.68/3.99 24 -> 10[label="",style="solid", color="burlywood", weight=3]; 9.68/3.99 10[label="primIntToChar (primPlusInt (Pos (Succ Zero)) (primCharToInt (Char vx30)))",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3]; 9.68/3.99 11[label="primIntToChar (primPlusInt (Pos (Succ Zero)) (Pos vx30))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3]; 9.68/3.99 12[label="primIntToChar (Pos (primPlusNat (Succ Zero) vx30))",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3]; 9.68/3.99 13[label="Char (primPlusNat (Succ Zero) vx30)",fontsize=16,color="green",shape="box"];13 -> 14[label="",style="dashed", color="green", weight=3]; 9.68/3.99 14[label="primPlusNat (Succ Zero) vx30",fontsize=16,color="burlywood",shape="box"];25[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];14 -> 25[label="",style="solid", color="burlywood", weight=9]; 9.68/3.99 25 -> 15[label="",style="solid", color="burlywood", weight=3]; 9.68/3.99 26[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];14 -> 26[label="",style="solid", color="burlywood", weight=9]; 9.68/3.99 26 -> 16[label="",style="solid", color="burlywood", weight=3]; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52