Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599566
details
property
value
status
complete
benchmark
Prelude_odd_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.07568907738 seconds
cpu usage
9.434416136
max memory
6.08813056E8
stage attributes
key
value
output-size
5697
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="odd",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="odd vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 4[label="not . even",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="not (even vx3)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 6[label="not (primEvenInt vx3)",fontsize=16,color="burlywood",shape="box"];22[label="vx3/Pos vx30",fontsize=10,color="white",style="solid",shape="box"];6 -> 22[label="",style="solid", color="burlywood", weight=9]; 22 -> 7[label="",style="solid", color="burlywood", weight=3]; 23[label="vx3/Neg vx30",fontsize=10,color="white",style="solid",shape="box"];6 -> 23[label="",style="solid", color="burlywood", weight=9]; 23 -> 8[label="",style="solid", color="burlywood", weight=3]; 7[label="not (primEvenInt (Pos vx30))",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3]; 8[label="not (primEvenInt (Neg vx30))",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3]; 9[label="not (primEvenNat vx30)",fontsize=16,color="burlywood",shape="triangle"];24[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];9 -> 24[label="",style="solid", color="burlywood", weight=9]; 24 -> 11[label="",style="solid", color="burlywood", weight=3]; 25[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];9 -> 25[label="",style="solid", color="burlywood", weight=9]; 25 -> 12[label="",style="solid", color="burlywood", weight=3]; 10 -> 9[label="",style="dashed", color="red", weight=0]; 10[label="not (primEvenNat vx30)",fontsize=16,color="magenta"];10 -> 13[label="",style="dashed", color="magenta", weight=3]; 11[label="not (primEvenNat (Succ vx300))",fontsize=16,color="burlywood",shape="box"];26[label="vx300/Succ vx3000",fontsize=10,color="white",style="solid",shape="box"];11 -> 26[label="",style="solid", color="burlywood", weight=9]; 26 -> 14[label="",style="solid", color="burlywood", weight=3]; 27[label="vx300/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 27[label="",style="solid", color="burlywood", weight=9]; 27 -> 15[label="",style="solid", color="burlywood", weight=3]; 12[label="not (primEvenNat Zero)",fontsize=16,color="black",shape="box"];12 -> 16[label="",style="solid", color="black", weight=3]; 13[label="vx30",fontsize=16,color="green",shape="box"];14[label="not (primEvenNat (Succ (Succ vx3000)))",fontsize=16,color="black",shape="box"];14 -> 17[label="",style="solid", color="black", weight=3]; 15[label="not (primEvenNat (Succ Zero))",fontsize=16,color="black",shape="box"];15 -> 18[label="",style="solid", color="black", weight=3]; 16[label="not True",fontsize=16,color="black",shape="box"];16 -> 19[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