Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598847
details
property
value
status
complete
benchmark
Prelude_negate_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.37459087372 seconds
cpu usage
9.616386897
max memory
5.50981632E8
stage attributes
key
value
output-size
3184
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 [EQUIVALENT, 25 ms] (6) 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 (EQUIVALENT) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="negate",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="negate vx3",fontsize=16,color="burlywood",shape="triangle"];12[label="vx3/vx30 :% vx31",fontsize=10,color="white",style="solid",shape="box"];3 -> 12[label="",style="solid", color="burlywood", weight=9]; 12 -> 4[label="",style="solid", color="burlywood", weight=3]; 4[label="negate vx30 :% vx31",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="(negate vx30) :% vx31",fontsize=16,color="green",shape="box"];5 -> 6[label="",style="dashed", color="green", weight=3]; 6[label="negate vx30",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 7[label="primNegInt vx30",fontsize=16,color="burlywood",shape="box"];13[label="vx30/Pos vx300",fontsize=10,color="white",style="solid",shape="box"];7 -> 13[label="",style="solid", color="burlywood", weight=9]; 13 -> 8[label="",style="solid", color="burlywood", weight=3]; 14[label="vx30/Neg vx300",fontsize=10,color="white",style="solid",shape="box"];7 -> 14[label="",style="solid", color="burlywood", weight=9]; 14 -> 9[label="",style="solid", color="burlywood", weight=3]; 8[label="primNegInt (Pos vx300)",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3]; 9[label="primNegInt (Neg vx300)",fontsize=16,color="black",shape="box"];9 -> 11[label="",style="solid", color="black", weight=3]; 10[label="Neg vx300",fontsize=16,color="green",shape="box"];11[label="Pos vx300",fontsize=16,color="green",shape="box"];} ---------------------------------------- (6) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell