Haskell pair #487598337

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.8172659874 seconds
cpu usage	9.792774119
max memory	6.01321472E8

stage attributes

key	value
output-size	10882
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE
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 not be shown:

(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) NonTerminationLoopProof [COMPLETE, 0 ms]
        (12) NO
(13) Narrow [COMPLETE, 0 ms]
(14) TRUE


----------------------------------------

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

cycle :: List a  ->  List a;
cycle Nil = Main.error;
cycle xs = cycleXs' xs;

cycleXs' vv = psPs vv (cycleXs' vv);

error :: a;
error = stop MyTrue;

psPs :: List a  ->  List a  ->  List a;
psPs Nil ys = ys;
psPs (Cons x xs) ys = Cons x (psPs xs ys);

stop :: MyBool  ->  a;
stop MyFalse = stop MyFalse;

}

----------------------------------------

(1) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

cycle :: List a  ->  List a;
cycle Nil = Main.error;
cycle xs = cycleXs' xs;

cycleXs' vv = psPs vv (cycleXs' vv);

error :: a;
error = stop MyTrue;

psPs :: List a  ->  List a  ->  List a;
psPs Nil ys = ys;
psPs (Cons x xs) ys = Cons x (psPs xs ys);

stop :: MyBool  ->  a;
stop MyFalse = stop MyFalse;

}

----------------------------------------

(3) COR (EQUIVALENT)
Cond Reductions:
The following Function with conditions
"undefined |Falseundefined;
"
is transformed to

popout

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

job log

popout

actions all output return to Haskell