Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Funct Progr 77531 pair #381920610
details
property
value
status
complete
benchmark
Prelude_inRange_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.98734617233 seconds
cpu usage
9.885838662
max memory
5.46893824E8
stage attributes
key
value
output-size
37038
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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="inRange",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="inRange vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="inRange vx3 vx4",fontsize=16,color="burlywood",shape="triangle"];210[label="vx3/(vx30,vx31)",fontsize=10,color="white",style="solid",shape="box"];4 -> 210[label="",style="solid", color="burlywood", weight=9]; 210 -> 5[label="",style="solid", color="burlywood", weight=3]; 5[label="inRange (vx30,vx31) vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 6[label="vx30 <= vx4 && vx4 <= vx31",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 7[label="compare vx30 vx4 /= GT && vx4 <= vx31",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 8[label="not (compare vx30 vx4 == GT) && vx4 <= vx31",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 9[label="not (primCmpInt vx30 vx4 == GT) && vx4 <= vx31",fontsize=16,color="burlywood",shape="box"];211[label="vx30/Pos vx300",fontsize=10,color="white",style="solid",shape="box"];9 -> 211[label="",style="solid", color="burlywood", weight=9]; 211 -> 10[label="",style="solid", color="burlywood", weight=3]; 212[label="vx30/Neg vx300",fontsize=10,color="white",style="solid",shape="box"];9 -> 212[label="",style="solid", color="burlywood", weight=9]; 212 -> 11[label="",style="solid", color="burlywood", weight=3]; 10[label="not (primCmpInt (Pos vx300) vx4 == GT) && vx4 <= vx31",fontsize=16,color="burlywood",shape="box"];213[label="vx300/Succ vx3000",fontsize=10,color="white",style="solid",shape="box"];10 -> 213[label="",style="solid", color="burlywood", weight=9]; 213 -> 12[label="",style="solid", color="burlywood", weight=3]; 214[label="vx300/Zero",fontsize=10,color="white",style="solid",shape="box"];10 -> 214[label="",style="solid", color="burlywood", weight=9]; 214 -> 13[label="",style="solid", color="burlywood", weight=3]; 11[label="not (primCmpInt (Neg vx300) vx4 == GT) && vx4 <= vx31",fontsize=16,color="burlywood",shape="box"];215[label="vx300/Succ vx3000",fontsize=10,color="white",style="solid",shape="box"];11 -> 215[label="",style="solid", color="burlywood", weight=9]; 215 -> 14[label="",style="solid", color="burlywood", weight=3]; 216[label="vx300/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 216[label="",style="solid", color="burlywood", weight=9]; 216 -> 15[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 Funct Progr 77531