details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.05649805069 seconds
cpu usage	9.217808716
max memory	5.39746304E8

stage attributes

key	value
output-size	5014
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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 [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; predMyInt :: MyInt -> MyInt; predMyInt (Main.Pos Main.Zero) = Main.Neg (Main.Succ Main.Zero); predMyInt (Main.Neg Main.Zero) = Main.Neg (Main.Succ Main.Zero); predMyInt (Main.Pos (Main.Succ x)) = Main.Pos x; predMyInt (Main.Neg (Main.Succ x)) = Main.Neg (Main.Succ (Main.Succ x)); } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; predMyInt :: MyInt -> MyInt; predMyInt (Main.Pos Main.Zero) = Main.Neg (Main.Succ Main.Zero); predMyInt (Main.Neg Main.Zero) = Main.Neg (Main.Succ Main.Zero); predMyInt (Main.Pos (Main.Succ x)) = Main.Pos x; predMyInt (Main.Neg (Main.Succ x)) = Main.Neg (Main.Succ (Main.Succ x)); } ---------------------------------------- (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; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; predMyInt :: MyInt -> MyInt; predMyInt (Main.Pos Main.Zero) = Main.Neg (Main.Succ Main.Zero); predMyInt (Main.Neg Main.Zero) = Main.Neg (Main.Succ Main.Zero); predMyInt (Main.Pos (Main.Succ x)) = Main.Pos x; predMyInt (Main.Neg (Main.Succ x)) = Main.Neg (Main.Succ (Main.Succ x)); } ---------------------------------------- popout

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

job log

popout

actions

all output return to Haskell