details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.09701609612 seconds
cpu usage	9.706004223
max memory	6.00653824E8

stage attributes

key	value
output-size	3474
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) Narrow [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Either a b = Left a | Right b ; either :: (b -> a) -> (c -> a) -> Either b c -> a; either l r (Left x) = l x; either l r (Right y) = r y; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; data Either b a = Left b | Right a ; either :: (b -> a) -> (c -> a) -> Either b c -> a; either l r (Left x) = l x; either l r (Right y) = r y; } ---------------------------------------- (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; data Either b a = Left b | Right a ; either :: (a -> b) -> (c -> b) -> Either a c -> b; either l r (Left x) = l x; either l r (Right y) = r y; } ---------------------------------------- (5) Narrow (EQUIVALENT) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="either",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="either vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="either vx3 vx4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3]; 5[label="either vx3 vx4 vx5",fontsize=16,color="burlywood",shape="triangle"];12[label="vx5/Left vx50",fontsize=10,color="white",style="solid",shape="box"];5 -> 12[label="",style="solid", color="burlywood", weight=9]; 12 -> 6[label="",style="solid", color="burlywood", weight=3]; 13[label="vx5/Right vx50",fontsize=10,color="white",style="solid",shape="box"];5 -> 13[label="",style="solid", color="burlywood", weight=9]; 13 -> 7[label="",style="solid", color="burlywood", weight=3]; 6[label="either vx3 vx4 (Left vx50)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; popout

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

job log

popout

actions

all output return to Haskell