details

property	value
status	complete
benchmark	Prelude_maxBound_4.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n182.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.20549 seconds
cpu usage	9.87736
user time	9.58131
system time	0.296049
max virtual memory	1.828834E7
max residence set size	571708.0

stage attributes

key	value
starexec-result	NO

output

7.99/3.62 NO 9.72/4.11 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.72/4.11 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.72/4.11 9.72/4.11 9.72/4.11 H-Termination with start terms of the given HASKELL could be disproven: 9.72/4.11 9.72/4.11 (0) HASKELL 9.72/4.11 (1) BR [EQUIVALENT, 0 ms] 9.72/4.11 (2) HASKELL 9.72/4.11 (3) COR [EQUIVALENT, 0 ms] 9.72/4.11 (4) HASKELL 9.72/4.11 (5) Narrow [COMPLETE, 0 ms] 9.72/4.11 (6) QDP 9.72/4.11 (7) NonTerminationLoopProof [COMPLETE, 0 ms] 9.72/4.11 (8) NO 9.72/4.11 9.72/4.11 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (0) 9.72/4.11 Obligation: 9.72/4.11 mainModule Main 9.72/4.11 module Main where { 9.72/4.11 import qualified Prelude; 9.72/4.11 } 9.72/4.11 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (1) BR (EQUIVALENT) 9.72/4.11 Replaced joker patterns by fresh variables and removed binding patterns. 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (2) 9.72/4.11 Obligation: 9.72/4.11 mainModule Main 9.72/4.11 module Main where { 9.72/4.11 import qualified Prelude; 9.72/4.11 } 9.72/4.11 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (3) COR (EQUIVALENT) 9.72/4.11 Cond Reductions: 9.72/4.11 The following Function with conditions 9.72/4.11 "undefined |Falseundefined; 9.72/4.11 " 9.72/4.11 is transformed to 9.72/4.11 "undefined = undefined1; 9.72/4.11 " 9.72/4.11 "undefined0 True = undefined; 9.72/4.11 " 9.72/4.11 "undefined1 = undefined0 False; 9.72/4.11 " 9.72/4.11 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (4) 9.72/4.11 Obligation: 9.72/4.11 mainModule Main 9.72/4.11 module Main where { 9.72/4.11 import qualified Prelude; 9.72/4.11 } 9.72/4.11 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (5) Narrow (COMPLETE) 9.72/4.11 Haskell To QDPs 9.72/4.11 9.72/4.11 digraph dp_graph { 9.72/4.11 node [outthreshold=100, inthreshold=100];1[label="maxBound",fontsize=16,color="black",shape="box"];1 -> 3[label="",style="solid", color="black", weight=3]; 9.72/4.11 3[label="primMaxInt",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 9.72/4.11 4 -> 3[label="",style="dashed", color="red", weight=0]; 9.72/4.11 4[label="primMaxInt",fontsize=16,color="magenta"];} 9.72/4.11 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (6) 9.72/4.11 Obligation: 9.72/4.11 Q DP problem: 9.72/4.11 The TRS P consists of the following rules: 9.72/4.11 9.72/4.11 new_primMaxInt([]) -> new_primMaxInt([]) 9.72/4.11 9.72/4.11 R is empty. 9.72/4.11 Q is empty. 9.72/4.11 We have to consider all (P,Q,R)-chains. 9.72/4.11 ---------------------------------------- 9.72/4.11 9.72/4.11 (7) NonTerminationLoopProof (COMPLETE) 9.72/4.11 We used the non-termination processor [FROCOS05] to show that the DP problem is infinite. 9.72/4.11 Found a loop by semiunifying a rule from P directly. 9.72/4.11 9.72/4.11 s = new_primMaxInt([]) evaluates to t =new_primMaxInt([]) 9.72/4.11 9.72/4.11 Thus s starts an infinite chain as s semiunifies with t with the following substitutions: 9.72/4.11 * Matcher: [ ] 9.72/4.11 * Semiunifier: [ ] 9.72/4.11 9.72/4.11 -------------------------------------------------------------------------------- popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell 2019-04-01 06.52