Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487524131
details
property
value
status
complete
benchmark
MYNAT_complete_noand_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n137.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
12.1438090801 seconds
cpu usage
39.861534657
max memory
3.052036096E9
stage attributes
key
value
output-size
97834
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 217 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 10 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QReductionProof [EQUIVALENT, 0 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QReductionProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) QDPOrderProof [EQUIVALENT, 6334 ms] (21) QDP (22) DependencyGraphProof [EQUIVALENT, 0 ms] (23) QDP (24) UsableRulesProof [EQUIVALENT, 0 ms] (25) QDP (26) QReductionProof [EQUIVALENT, 4 ms] (27) QDP (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] (29) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__U101(tt, M, N) -> a__U102(a__isNatKind(M), M, N) a__U102(tt, M, N) -> a__U103(a__isNat(N), M, N) a__U103(tt, M, N) -> a__U104(a__isNatKind(N), M, N) a__U104(tt, M, N) -> a__plus(a__x(mark(N), mark(M)), mark(N)) a__U11(tt, V1, V2) -> a__U12(a__isNatKind(V1), V1, V2) a__U12(tt, V1, V2) -> a__U13(a__isNatKind(V2), V1, V2) a__U13(tt, V1, V2) -> a__U14(a__isNatKind(V2), V1, V2) a__U14(tt, V1, V2) -> a__U15(a__isNat(V1), V2) a__U15(tt, V2) -> a__U16(a__isNat(V2)) a__U16(tt) -> tt a__U21(tt, V1) -> a__U22(a__isNatKind(V1), V1) a__U22(tt, V1) -> a__U23(a__isNat(V1)) a__U23(tt) -> tt a__U31(tt, V1, V2) -> a__U32(a__isNatKind(V1), V1, V2) a__U32(tt, V1, V2) -> a__U33(a__isNatKind(V2), V1, V2) a__U33(tt, V1, V2) -> a__U34(a__isNatKind(V2), V1, V2) a__U34(tt, V1, V2) -> a__U35(a__isNat(V1), V2) a__U35(tt, V2) -> a__U36(a__isNat(V2)) a__U36(tt) -> tt a__U41(tt, V2) -> a__U42(a__isNatKind(V2)) a__U42(tt) -> tt a__U51(tt) -> tt a__U61(tt, V2) -> a__U62(a__isNatKind(V2)) a__U62(tt) -> tt a__U71(tt, N) -> a__U72(a__isNatKind(N), N) a__U72(tt, N) -> mark(N) a__U81(tt, M, N) -> a__U82(a__isNatKind(M), M, N) a__U82(tt, M, N) -> a__U83(a__isNat(N), M, N) a__U83(tt, M, N) -> a__U84(a__isNatKind(N), M, N) a__U84(tt, M, N) -> s(a__plus(mark(N), mark(M))) a__U91(tt, N) -> a__U92(a__isNatKind(N)) a__U92(tt) -> 0 a__isNat(0) -> tt a__isNat(plus(V1, V2)) -> a__U11(a__isNatKind(V1), V1, V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1), V1) a__isNat(x(V1, V2)) -> a__U31(a__isNatKind(V1), V1, V2) a__isNatKind(0) -> tt a__isNatKind(plus(V1, V2)) -> a__U41(a__isNatKind(V1), V2) a__isNatKind(s(V1)) -> a__U51(a__isNatKind(V1)) a__isNatKind(x(V1, V2)) -> a__U61(a__isNatKind(V1), V2) a__plus(N, 0) -> a__U71(a__isNat(N), N) a__plus(N, s(M)) -> a__U81(a__isNat(M), M, N) a__x(N, 0) -> a__U91(a__isNat(N), N) a__x(N, s(M)) -> a__U101(a__isNat(M), M, N) mark(U101(X1, X2, X3)) -> a__U101(mark(X1), X2, X3) mark(U102(X1, X2, X3)) -> a__U102(mark(X1), X2, X3) mark(isNatKind(X)) -> a__isNatKind(X) mark(U103(X1, X2, X3)) -> a__U103(mark(X1), X2, X3)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost