details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.20947384834 seconds
cpu usage	9.740641069
max memory	6.13728256E8

stage attributes

key	value
output-size	3968
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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 [SOUND, 0 ms] (6) QDP (7) QDPSizeChangeProof [EQUIVALENT, 0 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) Narrow (SOUND) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="foldr",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="foldr vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="foldr vx3 vx4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3]; 5[label="foldr vx3 vx4 vx5",fontsize=16,color="burlywood",shape="triangle"];13[label="vx5/vx50 : vx51",fontsize=10,color="white",style="solid",shape="box"];5 -> 13[label="",style="solid", color="burlywood", weight=9]; 13 -> 6[label="",style="solid", color="burlywood", weight=3]; 14[label="vx5/[]",fontsize=10,color="white",style="solid",shape="box"];5 -> 14[label="",style="solid", color="burlywood", weight=9]; 14 -> 7[label="",style="solid", color="burlywood", weight=3]; 6[label="foldr vx3 vx4 (vx50 : vx51)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; 7[label="foldr vx3 vx4 []",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3]; 8[label="vx3 vx50 (foldr vx3 vx4 vx51)",fontsize=16,color="green",shape="box"];8 -> 10[label="",style="dashed", color="green", weight=3]; 8 -> 11[label="",style="dashed", color="green", weight=3]; 9[label="vx4",fontsize=16,color="green",shape="box"];10[label="vx50",fontsize=16,color="green",shape="box"];11 -> 5[label="",style="dashed", color="red", weight=0]; 11[label="foldr vx3 vx4 vx51",fontsize=16,color="magenta"];11 -> 12[label="",style="dashed", color="magenta", weight=3]; 12[label="vx51",fontsize=16,color="green",shape="box"];} ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: new_foldr(vx3, vx4, :(vx50, vx51), h, ba) -> new_foldr(vx3, vx4, vx51, h, ba) popout

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

job log

popout

actions

all output return to Haskell