Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598882
details
property
value
status
complete
benchmark
Prelude_SLASHEQ_5.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n153.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.14726209641 seconds
cpu usage
10.109480771
max memory
5.75442944E8
stage attributes
key
value
output-size
15901
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) 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="(/=)",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="(/=) vz3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="(/=) vz3 vz4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="not (vz3 == vz4)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 6[label="not (primEqInt vz3 vz4)",fontsize=16,color="burlywood",shape="box"];63[label="vz3/Pos vz30",fontsize=10,color="white",style="solid",shape="box"];6 -> 63[label="",style="solid", color="burlywood", weight=9]; 63 -> 7[label="",style="solid", color="burlywood", weight=3]; 64[label="vz3/Neg vz30",fontsize=10,color="white",style="solid",shape="box"];6 -> 64[label="",style="solid", color="burlywood", weight=9]; 64 -> 8[label="",style="solid", color="burlywood", weight=3]; 7[label="not (primEqInt (Pos vz30) vz4)",fontsize=16,color="burlywood",shape="box"];65[label="vz30/Succ vz300",fontsize=10,color="white",style="solid",shape="box"];7 -> 65[label="",style="solid", color="burlywood", weight=9]; 65 -> 9[label="",style="solid", color="burlywood", weight=3]; 66[label="vz30/Zero",fontsize=10,color="white",style="solid",shape="box"];7 -> 66[label="",style="solid", color="burlywood", weight=9]; 66 -> 10[label="",style="solid", color="burlywood", weight=3]; 8[label="not (primEqInt (Neg vz30) vz4)",fontsize=16,color="burlywood",shape="box"];67[label="vz30/Succ vz300",fontsize=10,color="white",style="solid",shape="box"];8 -> 67[label="",style="solid", color="burlywood", weight=9]; 67 -> 11[label="",style="solid", color="burlywood", weight=3]; 68[label="vz30/Zero",fontsize=10,color="white",style="solid",shape="box"];8 -> 68[label="",style="solid", color="burlywood", weight=9]; 68 -> 12[label="",style="solid", color="burlywood", weight=3]; 9[label="not (primEqInt (Pos (Succ vz300)) vz4)",fontsize=16,color="burlywood",shape="box"];69[label="vz4/Pos vz40",fontsize=10,color="white",style="solid",shape="box"];9 -> 69[label="",style="solid", color="burlywood", weight=9]; 69 -> 13[label="",style="solid", color="burlywood", weight=3]; 70[label="vz4/Neg vz40",fontsize=10,color="white",style="solid",shape="box"];9 -> 70[label="",style="solid", color="burlywood", weight=9]; 70 -> 14[label="",style="solid", color="burlywood", weight=3]; 10[label="not (primEqInt (Pos Zero) vz4)",fontsize=16,color="burlywood",shape="box"];71[label="vz4/Pos vz40",fontsize=10,color="white",style="solid",shape="box"];10 -> 71[label="",style="solid", color="burlywood", weight=9]; 71 -> 15[label="",style="solid", color="burlywood", weight=3]; 72[label="vz4/Neg vz40",fontsize=10,color="white",style="solid",shape="box"];10 -> 72[label="",style="solid", color="burlywood", weight=9]; 72 -> 16[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 Haskell