Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598381
details
property
value
status
complete
benchmark
enumFromTo_6.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
16.302077055 seconds
cpu usage
34.172786187
max memory
4.215762944E9
stage attributes
key
value
output-size
154647
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) MRRProof [EQUIVALENT, 113 ms] (11) QDP (12) TransformationProof [EQUIVALENT, 0 ms] (13) QDP (14) QReductionProof [EQUIVALENT, 0 ms] (15) QDP (16) TransformationProof [EQUIVALENT, 0 ms] (17) QDP (18) TransformationProof [EQUIVALENT, 0 ms] (19) QDP (20) UsableRulesProof [EQUIVALENT, 0 ms] (21) QDP (22) QReductionProof [EQUIVALENT, 0 ms] (23) QDP (24) TransformationProof [EQUIVALENT, 0 ms] (25) QDP (26) UsableRulesProof [EQUIVALENT, 0 ms] (27) QDP (28) QReductionProof [EQUIVALENT, 0 ms] (29) QDP (30) QDPOrderProof [EQUIVALENT, 42 ms] (31) QDP (32) TransformationProof [EQUIVALENT, 0 ms] (33) QDP (34) DependencyGraphProof [EQUIVALENT, 0 ms] (35) TRUE (36) QDP (37) QDPPairToRuleProof [EQUIVALENT, 0 ms] (38) AND (39) QDP (40) TransformationProof [EQUIVALENT, 0 ms] (41) QDP (42) DependencyGraphProof [EQUIVALENT, 0 ms] (43) QDP (44) UsableRulesProof [EQUIVALENT, 0 ms] (45) QDP (46) QReductionProof [EQUIVALENT, 0 ms] (47) QDP (48) InductionCalculusProof [EQUIVALENT, 0 ms] (49) QDP (50) NonInfProof [EQUIVALENT, 194 ms] (51) QDP (52) DependencyGraphProof [EQUIVALENT, 0 ms] (53) TRUE (54) QDP (55) QDPSizeChangeProof [EQUIVALENT, 0 ms] (56) YES (57) QDP (58) QDPSizeChangeProof [EQUIVALENT, 0 ms] (59) YES (60) QDP (61) QDPSizeChangeProof [EQUIVALENT, 0 ms] (62) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Ordering = LT | EQ | GT ; data Main.WHNF a = WHNF a ; compareMyInt :: MyInt -> MyInt -> Ordering; compareMyInt = primCmpInt;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell