Haskell pair #487598429

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.67396903038 seconds
cpu usage	11.566210043
max memory	6.30284288E8

stage attributes

key	value
output-size	91324
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 [SOUND, 0 ms]
(6) AND
    (7) QDP
        (8) DependencyGraphProof [EQUIVALENT, 0 ms]
        (9) AND
            (10) QDP
                (11) TransformationProof [EQUIVALENT, 0 ms]
                (12) QDP
                (13) UsableRulesProof [EQUIVALENT, 0 ms]
                (14) QDP
                (15) QReductionProof [EQUIVALENT, 0 ms]
                (16) QDP
                (17) TransformationProof [EQUIVALENT, 0 ms]
                (18) QDP
                (19) UsableRulesProof [EQUIVALENT, 0 ms]
                (20) QDP
                (21) QReductionProof [EQUIVALENT, 0 ms]
                (22) QDP
                (23) TransformationProof [EQUIVALENT, 0 ms]
                (24) QDP
                (25) TransformationProof [EQUIVALENT, 0 ms]
                (26) QDP
                (27) DependencyGraphProof [EQUIVALENT, 0 ms]
                (28) QDP
                (29) UsableRulesProof [EQUIVALENT, 0 ms]
                (30) QDP
                (31) QReductionProof [EQUIVALENT, 0 ms]
                (32) QDP
                (33) TransformationProof [EQUIVALENT, 0 ms]
                (34) QDP
                (35) UsableRulesProof [EQUIVALENT, 0 ms]
                (36) QDP
                (37) QReductionProof [EQUIVALENT, 0 ms]
                (38) QDP
                (39) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (40) YES
            (41) QDP
                (42) QDPOrderProof [EQUIVALENT, 45 ms]
                (43) QDP
                (44) DependencyGraphProof [EQUIVALENT, 0 ms]
                (45) QDP
                (46) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (47) YES
    (48) QDP
        (49) DependencyGraphProof [EQUIVALENT, 0 ms]
        (50) AND
            (51) QDP
                (52) MRRProof [EQUIVALENT, 0 ms]
                (53) QDP
                (54) PisEmptyProof [EQUIVALENT, 0 ms]
                (55) YES
            (56) QDP
                (57) QDPOrderProof [EQUIVALENT, 9 ms]
                (58) QDP
                (59) DependencyGraphProof [EQUIVALENT, 0 ms]
                (60) QDP
                (61) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (62) YES
    (63) QDP
        (64) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (65) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data MyBool = MyTrue  | MyFalse ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

data Tup2 a b = Tup2 a b ;

error :: a;
error = stop MyTrue;

primDivNatS :: Main.Nat  ->  Main.Nat  ->  Main.Nat;

popout

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

job log

popout

actions all output return to Haskell