Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599082
details
property
value
status
complete
benchmark
Prelude_EQEQ_4.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n093.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.6872889996 seconds
cpu usage
11.348646314
max memory
6.22104576E8
stage attributes
key
value
output-size
149594
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, 7 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) 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="(==) xv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="(==) xv3 xv4",fontsize=16,color="burlywood",shape="triangle"];600[label="xv3/xv30 : xv31",fontsize=10,color="white",style="solid",shape="box"];4 -> 600[label="",style="solid", color="burlywood", weight=9]; 600 -> 5[label="",style="solid", color="burlywood", weight=3]; 601[label="xv3/[]",fontsize=10,color="white",style="solid",shape="box"];4 -> 601[label="",style="solid", color="burlywood", weight=9]; 601 -> 6[label="",style="solid", color="burlywood", weight=3]; 5[label="(==) xv30 : xv31 xv4",fontsize=16,color="burlywood",shape="box"];602[label="xv4/xv40 : xv41",fontsize=10,color="white",style="solid",shape="box"];5 -> 602[label="",style="solid", color="burlywood", weight=9]; 602 -> 7[label="",style="solid", color="burlywood", weight=3]; 603[label="xv4/[]",fontsize=10,color="white",style="solid",shape="box"];5 -> 603[label="",style="solid", color="burlywood", weight=9]; 603 -> 8[label="",style="solid", color="burlywood", weight=3]; 6[label="(==) [] xv4",fontsize=16,color="burlywood",shape="box"];604[label="xv4/xv40 : xv41",fontsize=10,color="white",style="solid",shape="box"];6 -> 604[label="",style="solid", color="burlywood", weight=9]; 604 -> 9[label="",style="solid", color="burlywood", weight=3]; 605[label="xv4/[]",fontsize=10,color="white",style="solid",shape="box"];6 -> 605[label="",style="solid", color="burlywood", weight=9]; 605 -> 10[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