Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599731
details
property
value
status
complete
benchmark
Prelude_EQEQ_8.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.22786784172 seconds
cpu usage
10.250455752
max memory
5.89746176E8
stage attributes
key
value
output-size
45107
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) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) 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="primEqFloat vz3 vz4",fontsize=16,color="burlywood",shape="box"];505[label="vz3/Float vz30 vz31",fontsize=10,color="white",style="solid",shape="box"];5 -> 505[label="",style="solid", color="burlywood", weight=9]; 505 -> 6[label="",style="solid", color="burlywood", weight=3]; 6[label="primEqFloat (Float vz30 vz31) vz4",fontsize=16,color="burlywood",shape="box"];506[label="vz4/Float vz40 vz41",fontsize=10,color="white",style="solid",shape="box"];6 -> 506[label="",style="solid", color="burlywood", weight=9]; 506 -> 7[label="",style="solid", color="burlywood", weight=3]; 7[label="primEqFloat (Float vz30 vz31) (Float vz40 vz41)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 8[label="vz30 * vz41 == vz31 * vz40",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 9[label="primEqInt (vz30 * vz41) (vz31 * vz40)",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3]; 10[label="primEqInt (primMulInt vz30 vz41) (vz31 * vz40)",fontsize=16,color="burlywood",shape="box"];507[label="vz30/Pos vz300",fontsize=10,color="white",style="solid",shape="box"];10 -> 507[label="",style="solid", color="burlywood", weight=9]; 507 -> 11[label="",style="solid", color="burlywood", weight=3]; 508[label="vz30/Neg vz300",fontsize=10,color="white",style="solid",shape="box"];10 -> 508[label="",style="solid", color="burlywood", weight=9]; 508 -> 12[label="",style="solid", color="burlywood", weight=3]; 11[label="primEqInt (primMulInt (Pos vz300) vz41) (vz31 * vz40)",fontsize=16,color="burlywood",shape="box"];509[label="vz41/Pos vz410",fontsize=10,color="white",style="solid",shape="box"];11 -> 509[label="",style="solid", color="burlywood", weight=9]; 509 -> 13[label="",style="solid", color="burlywood", weight=3]; 510[label="vz41/Neg vz410",fontsize=10,color="white",style="solid",shape="box"];11 -> 510[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