Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599170
details
property
value
status
complete
benchmark
Prelude_concat_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.14720702171 seconds
cpu usage
9.710441412
max memory
5.88173312E8
stage attributes
key
value
output-size
5779
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 [SOUND, 0 ms] (6) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) 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="concat",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="concat vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 4[label="foldr (++) [] vx3",fontsize=16,color="burlywood",shape="triangle"];18[label="vx3/vx30 : vx31",fontsize=10,color="white",style="solid",shape="box"];4 -> 18[label="",style="solid", color="burlywood", weight=9]; 18 -> 5[label="",style="solid", color="burlywood", weight=3]; 19[label="vx3/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 19[label="",style="solid", color="burlywood", weight=9]; 19 -> 6[label="",style="solid", color="burlywood", weight=3]; 5[label="foldr (++) [] (vx30 : vx31)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3]; 6[label="foldr (++) [] []",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; 7 -> 9[label="",style="dashed", color="red", weight=0]; 7[label="(++) vx30 foldr (++) [] vx31",fontsize=16,color="magenta"];7 -> 10[label="",style="dashed", color="magenta", weight=3]; 8[label="[]",fontsize=16,color="green",shape="box"];10 -> 4[label="",style="dashed", color="red", weight=0]; 10[label="foldr (++) [] vx31",fontsize=16,color="magenta"];10 -> 11[label="",style="dashed", color="magenta", weight=3]; 9[label="(++) vx30 vx4",fontsize=16,color="burlywood",shape="triangle"];20[label="vx30/vx300 : vx301",fontsize=10,color="white",style="solid",shape="box"];9 -> 20[label="",style="solid", color="burlywood", weight=9]; 20 -> 12[label="",style="solid", color="burlywood", weight=3]; 21[label="vx30/[]",fontsize=10,color="white",style="solid",shape="box"];9 -> 21[label="",style="solid", color="burlywood", weight=9]; 21 -> 13[label="",style="solid", color="burlywood", weight=3]; 11[label="vx31",fontsize=16,color="green",shape="box"];12[label="(++) (vx300 : vx301) vx4",fontsize=16,color="black",shape="box"];12 -> 14[label="",style="solid", color="black", weight=3]; 13[label="(++) [] vx4",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3]; 14[label="vx300 : vx301 ++ vx4",fontsize=16,color="green",shape="box"];14 -> 16[label="",style="dashed", color="green", weight=3]; 15[label="vx4",fontsize=16,color="green",shape="box"];16 -> 9[label="",style="dashed", color="red", weight=0];
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell