details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.89973688126 seconds
cpu usage	10.012911443
max memory	6.14506496E8

stage attributes

key	value
output-size	7245
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) NumRed [SOUND, 0 ms] (6) HASKELL (7) Narrow [EQUIVALENT, 7 ms] (8) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (3) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; " "undefined0 True = undefined; " "undefined1 = undefined0 False; " ---------------------------------------- (4) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (5) NumRed (SOUND) Num Reduction:All numbers are transformed to their corresponding representation with Succ, Pred and Zero. ---------------------------------------- (6) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (7) Narrow (EQUIVALENT) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="fromInteger",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="fromInteger vx3",fontsize=16,color="blue",shape="box"];29[label="fromInteger :: Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];3 -> 29[label="",style="solid", color="blue", weight=9]; 29 -> 4[label="",style="solid", color="blue", weight=3]; 30[label="fromInteger :: Integer -> Float",fontsize=10,color="white",style="solid",shape="box"];3 -> 30[label="",style="solid", color="blue", weight=9]; 30 -> 5[label="",style="solid", color="blue", weight=3]; 31[label="fromInteger :: Integer -> Integer",fontsize=10,color="white",style="solid",shape="box"];3 -> 31[label="",style="solid", color="blue", weight=9]; 31 -> 6[label="",style="solid", color="blue", weight=3]; 32[label="fromInteger :: Integer -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];3 -> 32[label="",style="solid", color="blue", weight=9]; 32 -> 7[label="",style="solid", color="blue", weight=3]; 33[label="fromInteger :: Integer -> Double",fontsize=10,color="white",style="solid",shape="box"];3 -> 33[label="",style="solid", color="blue", weight=9]; 33 -> 8[label="",style="solid", color="blue", weight=3]; popout

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

job log

popout

actions

all output return to Haskell