Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599256
details
property
value
status
complete
benchmark
Prelude_subtract_2.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.41238307953 seconds
cpu usage
9.942117446
max memory
5.91347712E8
stage attributes
key
value
output-size
12150
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="subtract",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="subtract vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="subtract vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="flip (-) vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 6[label="(-) vx4 vx3",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 7[label="primMinusInt vx4 vx3",fontsize=16,color="burlywood",shape="box"];49[label="vx4/Pos vx40",fontsize=10,color="white",style="solid",shape="box"];7 -> 49[label="",style="solid", color="burlywood", weight=9]; 49 -> 8[label="",style="solid", color="burlywood", weight=3]; 50[label="vx4/Neg vx40",fontsize=10,color="white",style="solid",shape="box"];7 -> 50[label="",style="solid", color="burlywood", weight=9]; 50 -> 9[label="",style="solid", color="burlywood", weight=3]; 8[label="primMinusInt (Pos vx40) vx3",fontsize=16,color="burlywood",shape="box"];51[label="vx3/Pos vx30",fontsize=10,color="white",style="solid",shape="box"];8 -> 51[label="",style="solid", color="burlywood", weight=9]; 51 -> 10[label="",style="solid", color="burlywood", weight=3]; 52[label="vx3/Neg vx30",fontsize=10,color="white",style="solid",shape="box"];8 -> 52[label="",style="solid", color="burlywood", weight=9]; 52 -> 11[label="",style="solid", color="burlywood", weight=3]; 9[label="primMinusInt (Neg vx40) vx3",fontsize=16,color="burlywood",shape="box"];53[label="vx3/Pos vx30",fontsize=10,color="white",style="solid",shape="box"];9 -> 53[label="",style="solid", color="burlywood", weight=9]; 53 -> 12[label="",style="solid", color="burlywood", weight=3]; 54[label="vx3/Neg vx30",fontsize=10,color="white",style="solid",shape="box"];9 -> 54[label="",style="solid", color="burlywood", weight=9]; 54 -> 13[label="",style="solid", color="burlywood", weight=3]; 10[label="primMinusInt (Pos vx40) (Pos vx30)",fontsize=16,color="black",shape="box"];10 -> 14[label="",style="solid", color="black", weight=3]; 11[label="primMinusInt (Pos vx40) (Neg vx30)",fontsize=16,color="black",shape="box"];11 -> 15[label="",style="solid", color="black", weight=3]; 12[label="primMinusInt (Neg vx40) (Pos vx30)",fontsize=16,color="black",shape="box"];12 -> 16[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