Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598497
details
property
value
status
complete
benchmark
Prelude_minBound_4.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)
10.1227021217 seconds
cpu usage
10.046271329
max memory
5.67590912E8
stage attributes
key
value
output-size
2806
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [COMPLETE, 0 ms] (6) QDP (7) NonTerminationLoopProof [COMPLETE, 0 ms] (8) NO ---------------------------------------- (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 (COMPLETE) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="minBound",fontsize=16,color="black",shape="box"];1 -> 3[label="",style="solid", color="black", weight=3]; 3[label="primMinInt",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 4 -> 3[label="",style="dashed", color="red", weight=0]; 4[label="primMinInt",fontsize=16,color="magenta"];} ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: new_primMinInt([]) -> new_primMinInt([]) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (7) NonTerminationLoopProof (COMPLETE) We used the non-termination processor [FROCOS05] to show that the DP problem is infinite. Found a loop by semiunifying a rule from P directly. s = new_primMinInt([]) evaluates to t =new_primMinInt([])
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell