Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598209
details
property
value
status
complete
benchmark
gcd_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.43696403503 seconds
cpu usage
23.34014518
max memory
1.863647232E9
stage attributes
key
value
output-size
328921
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) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) AND (13) QDP (14) TransformationProof [EQUIVALENT, 0 ms] (15) QDP (16) QDPOrderProof [EQUIVALENT, 66 ms] (17) QDP (18) DependencyGraphProof [EQUIVALENT, 0 ms] (19) QDP (20) InductionCalculusProof [EQUIVALENT, 0 ms] (21) QDP (22) NonInfProof [EQUIVALENT, 52 ms] (23) QDP (24) DependencyGraphProof [EQUIVALENT, 0 ms] (25) QDP (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] (27) YES (28) QDP (29) TransformationProof [EQUIVALENT, 0 ms] (30) QDP (31) TransformationProof [EQUIVALENT, 0 ms] (32) QDP (33) QDPOrderProof [EQUIVALENT, 0 ms] (34) QDP (35) DependencyGraphProof [EQUIVALENT, 0 ms] (36) QDP (37) QDPOrderProof [EQUIVALENT, 29 ms] (38) QDP (39) DependencyGraphProof [EQUIVALENT, 0 ms] (40) QDP (41) InductionCalculusProof [EQUIVALENT, 0 ms] (42) QDP (43) NonInfProof [EQUIVALENT, 64 ms] (44) QDP (45) DependencyGraphProof [EQUIVALENT, 0 ms] (46) AND (47) QDP (48) QDPSizeChangeProof [EQUIVALENT, 0 ms] (49) YES (50) QDP (51) QDPSizeChangeProof [EQUIVALENT, 0 ms] (52) 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 Ordering = LT | EQ | GT ; abs :: MyInt -> MyInt; abs = absReal; absReal x = absReal2 x; absReal0 x MyTrue = negate x; absReal1 x MyTrue = x; absReal1 x MyFalse = absReal0 x otherwise; absReal2 x = absReal1 x (gtEs x (fromInt (Main.Pos Main.Zero))); compare :: MyInt -> MyInt -> Ordering; compare = primCmpInt; error :: a; error = stop MyTrue;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell