Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599569
details
property
value
status
complete
benchmark
Prelude_SLASHEQ_9.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.1268389225 seconds
cpu usage
10.300050708
max memory
5.55962368E8
stage attributes
key
value
output-size
32237
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="(/=)",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="burlywood",shape="box"];123[label="vz3/vz30 :% vz31",fontsize=10,color="white",style="solid",shape="box"];5 -> 123[label="",style="solid", color="burlywood", weight=9]; 123 -> 6[label="",style="solid", color="burlywood", weight=3]; 6[label="not (vz30 :% vz31 == vz4)",fontsize=16,color="burlywood",shape="box"];124[label="vz4/vz40 :% vz41",fontsize=10,color="white",style="solid",shape="box"];6 -> 124[label="",style="solid", color="burlywood", weight=9]; 124 -> 7[label="",style="solid", color="burlywood", weight=3]; 7[label="not (vz30 :% vz31 == vz40 :% vz41)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 8[label="not (vz30 == vz40 && vz31 == vz41)",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 9[label="not (primEqInt vz30 vz40 && vz31 == vz41)",fontsize=16,color="burlywood",shape="box"];125[label="vz30/Pos vz300",fontsize=10,color="white",style="solid",shape="box"];9 -> 125[label="",style="solid", color="burlywood", weight=9]; 125 -> 10[label="",style="solid", color="burlywood", weight=3]; 126[label="vz30/Neg vz300",fontsize=10,color="white",style="solid",shape="box"];9 -> 126[label="",style="solid", color="burlywood", weight=9]; 126 -> 11[label="",style="solid", color="burlywood", weight=3]; 10[label="not (primEqInt (Pos vz300) vz40 && vz31 == vz41)",fontsize=16,color="burlywood",shape="box"];127[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];10 -> 127[label="",style="solid", color="burlywood", weight=9]; 127 -> 12[label="",style="solid", color="burlywood", weight=3]; 128[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];10 -> 128[label="",style="solid", color="burlywood", weight=9]; 128 -> 13[label="",style="solid", color="burlywood", weight=3]; 11[label="not (primEqInt (Neg vz300) vz40 && vz31 == vz41)",fontsize=16,color="burlywood",shape="box"];129[label="vz300/Succ vz3000",fontsize=10,color="white",style="solid",shape="box"];11 -> 129[label="",style="solid", color="burlywood", weight=9]; 129 -> 14[label="",style="solid", color="burlywood", weight=3]; 130[label="vz300/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 130[label="",style="solid", color="burlywood", weight=9];
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell